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.r092-tall-171624189900722.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DES-PT-40b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900722
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 115K 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 DES-PT-40b-CTLFireability-2024-00
FORMULA_NAME DES-PT-40b-CTLFireability-2024-01
FORMULA_NAME DES-PT-40b-CTLFireability-2024-02
FORMULA_NAME DES-PT-40b-CTLFireability-2024-03
FORMULA_NAME DES-PT-40b-CTLFireability-2024-04
FORMULA_NAME DES-PT-40b-CTLFireability-2024-05
FORMULA_NAME DES-PT-40b-CTLFireability-2024-06
FORMULA_NAME DES-PT-40b-CTLFireability-2024-07
FORMULA_NAME DES-PT-40b-CTLFireability-2024-08
FORMULA_NAME DES-PT-40b-CTLFireability-2024-09
FORMULA_NAME DES-PT-40b-CTLFireability-2024-10
FORMULA_NAME DES-PT-40b-CTLFireability-2024-11
FORMULA_NAME DES-PT-40b-CTLFireability-2023-12
FORMULA_NAME DES-PT-40b-CTLFireability-2023-13
FORMULA_NAME DES-PT-40b-CTLFireability-2023-14
FORMULA_NAME DES-PT-40b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716354829159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 05:13:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 05:13:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:13:50] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-22 05:13:50] [INFO ] Transformed 439 places.
[2024-05-22 05:13:50] [INFO ] Transformed 390 transitions.
[2024-05-22 05:13:50] [INFO ] Found NUPN structural information;
[2024-05-22 05:13:50] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 119 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 418 transition count 372
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 418 transition count 372
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 410 transition count 364
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 410 transition count 364
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 410 transition count 359
Applied a total of 60 rules in 90 ms. Remains 410 /439 variables (removed 29) and now considering 359/390 (removed 31) transitions.
// Phase 1: matrix 359 rows 410 cols
[2024-05-22 05:13:50] [INFO ] Computed 62 invariants in 43 ms
[2024-05-22 05:13:51] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-22 05:13:51] [INFO ] Invariant cache hit.
[2024-05-22 05:13:51] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2024-05-22 05:13:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/410 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 358 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (OVERLAPS) 359/769 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:14:02] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 19 ms to minimize.
[2024-05-22 05:14:02] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:14:03] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:14:03] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:14:06] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:14:10] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:14:13] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:14:16] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:14:16] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:14:16] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:14:16] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:14:16] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:14:16] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-22 05:14:16] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:14:17] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 9/487 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:14:19] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:14:20] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-22 05:14:21] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:14:21] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:14:21] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
SMT process timed out in 30260ms, After SMT, problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 30280ms
Starting structural reductions in LTL mode, iteration 1 : 410/439 places, 359/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31209 ms. Remains : 410/439 places, 359/390 transitions.
Support contains 119 out of 410 places after structural reductions.
[2024-05-22 05:14:21] [INFO ] Flatten gal took : 57 ms
[2024-05-22 05:14:22] [INFO ] Flatten gal took : 26 ms
[2024-05-22 05:14:22] [INFO ] Input system was already deterministic with 359 transitions.
Reduction of identical properties reduced properties to check from 96 to 94
RANDOM walk for 40000 steps (335 resets) in 2651 ms. (15 steps per ms) remains 44/94 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
[2024-05-22 05:14:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 102/163 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 55/218 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 171/389 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 4/393 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 9 (OVERLAPS) 345/738 variables, 393/455 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/738 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 22/760 variables, 12/467 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 0/467 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 13 (OVERLAPS) 5/765 variables, 3/470 constraints. Problems are: Problem set: 1 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/769 variables, and 470 constraints, problems are : Problem set: 1 solved, 43 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 408/410 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 102/161 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 43 unsolved
[2024-05-22 05:14:28] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:14:28] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 55/216 variables, 17/35 constraints. Problems are: Problem set: 1 solved, 43 unsolved
[2024-05-22 05:14:29] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 173/389 variables, 27/63 constraints. Problems are: Problem set: 1 solved, 43 unsolved
[2024-05-22 05:14:29] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2024-05-22 05:14:29] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 2/65 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 4/393 variables, 2/67 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 345/738 variables, 393/460 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/738 variables, 42/502 constraints. Problems are: Problem set: 1 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/769 variables, and 502 constraints, problems are : Problem set: 1 solved, 43 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/410 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 5/5 constraints]
After SMT, in 10087ms problems are : Problem set: 1 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 404 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 404 transition count 345
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 394 transition count 344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 393 transition count 344
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 24 place count 393 transition count 335
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 42 place count 384 transition count 335
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 50 place count 376 transition count 327
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 376 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 62 place count 376 transition count 323
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 64 place count 374 transition count 321
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 374 transition count 321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 70 place count 374 transition count 317
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 73 place count 372 transition count 316
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 128 rules applied. Total rules applied 201 place count 308 transition count 252
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 207 place count 305 transition count 255
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 208 place count 305 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 209 place count 304 transition count 254
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 210 place count 304 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 211 place count 303 transition count 253
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 213 place count 303 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 214 place count 302 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 215 place count 301 transition count 252
Applied a total of 215 rules in 203 ms. Remains 301 /410 variables (removed 109) and now considering 252/359 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 301/410 places, 252/359 transitions.
RANDOM walk for 40000 steps (1142 resets) in 517 ms. (77 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4002 steps (18 resets) in 32 ms. (121 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (20 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (24 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (17 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (20 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (17 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (17 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (21 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (19 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (21 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (16 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (25 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (22 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (17 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (18 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (20 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (18 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (20 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (26 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (21 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (20 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (20 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (17 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
Interrupted probabilistic random walk after 529956 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 42
Probabilistic random walk after 529956 steps, saw 76526 distinct states, run finished after 3004 ms. (steps per millisecond=176 ) properties seen :0
// Phase 1: matrix 252 rows 301 cols
[2024-05-22 05:14:37] [INFO ] Computed 59 invariants in 8 ms
[2024-05-22 05:14:37] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 52/108 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/151 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 117/268 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 252/521 variables, 269/328 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 32/553 variables, 32/364 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:14:40] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/553 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 16 (OVERLAPS) 0/553 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 365 constraints, problems are : Problem set: 0 solved, 42 unsolved in 6528 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 301/301 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 52/108 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:14:43] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 43/151 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 117/268 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:14:44] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 252/521 variables, 269/330 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/521 variables, 28/362 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:14:49] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
[2024-05-22 05:14:49] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:14:49] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-22 05:14:50] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:14:50] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:14:50] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:14:50] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:14:51] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/521 variables, 8/370 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:14:58] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:14:59] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/521 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:15:06] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:15:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/521 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:15:17] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/521 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/521 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 42 unsolved
SMT process timed out in 51597ms, After SMT, problems are : Problem set: 0 solved, 42 unsolved
Fused 42 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 114 ms.
Support contains 56 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 252/252 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 298 transition count 249
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 298 transition count 248
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 297 transition count 245
Applied a total of 11 rules in 27 ms. Remains 297 /301 variables (removed 4) and now considering 245/252 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 297/301 places, 245/252 transitions.
RANDOM walk for 40000 steps (1242 resets) in 460 ms. (86 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (23 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (18 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (19 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (22 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (24 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (25 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (22 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (24 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (25 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (25 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (18 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (18 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (19 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (24 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (24 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (22 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
Interrupted probabilistic random walk after 557987 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 42
Probabilistic random walk after 557987 steps, saw 78913 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
// Phase 1: matrix 245 rows 297 cols
[2024-05-22 05:15:32] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 05:15:32] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 50/106 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 42/148 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 116/264 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 1/265 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 245/510 variables, 265/324 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 32/542 variables, 32/360 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:15:34] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/542 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:15:36] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:15:36] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 16 (OVERLAPS) 0/542 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 363 constraints, problems are : Problem set: 0 solved, 42 unsolved in 6470 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/297 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 50/106 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 42/148 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 116/264 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:15:39] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 1/265 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 245/510 variables, 265/328 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 28/360 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:15:44] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:15:44] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:15:45] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:15:45] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:15:46] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:15:54] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
[2024-05-22 05:15:54] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/510 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/510 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 17 (OVERLAPS) 32/542 variables, 32/399 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/542 variables, 14/413 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:16:26] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:16:27] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/542 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 05:16:35] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:16:37] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/542 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/542 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/542 variables, and 417 constraints, problems are : Problem set: 0 solved, 42 unsolved in 75014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/297 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 15/15 constraints]
After SMT, in 81541ms problems are : Problem set: 0 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 245/245 transitions.
Applied a total of 0 rules in 13 ms. Remains 297 /297 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 297/297 places, 245/245 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 245/245 transitions.
Applied a total of 0 rules in 8 ms. Remains 297 /297 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-22 05:16:53] [INFO ] Invariant cache hit.
[2024-05-22 05:16:53] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 05:16:53] [INFO ] Invariant cache hit.
[2024-05-22 05:16:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 05:16:54] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-22 05:16:54] [INFO ] Redundant transitions in 11 ms returned []
Running 242 sub problems to find dead transitions.
[2024-05-22 05:16:54] [INFO ] Invariant cache hit.
[2024-05-22 05:16:54] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 3/297 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 245/542 variables, 297/356 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:17:03] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:17:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:17:09] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/542 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:17:11] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 13 (OVERLAPS) 0/542 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 364 constraints, problems are : Problem set: 0 solved, 242 unsolved in 25827 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/297 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 3/297 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 245/542 variables, 297/360 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/542 variables, 242/606 constraints. Problems are: Problem set: 0 solved, 242 unsolved
[2024-05-22 05:17:29] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:17:29] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-22 05:17:29] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-22 05:17:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2024-05-22 05:17:30] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:17:30] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:17:32] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:17:32] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:17:40] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/542 variables, 9/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/542 variables, and 615 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 297/297 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 13/13 constraints]
After SMT, in 55981ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 55984ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56471 ms. Remains : 297/297 places, 245/245 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-22 05:17:50] [INFO ] Flatten gal took : 20 ms
[2024-05-22 05:17:50] [INFO ] Flatten gal took : 22 ms
[2024-05-22 05:17:50] [INFO ] Input system was already deterministic with 359 transitions.
Computed a total of 219 stabilizing places and 211 stable transitions
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 398 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 394 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 393 transition count 333
Applied a total of 43 rules in 24 ms. Remains 393 /410 variables (removed 17) and now considering 333/359 (removed 26) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:17:50] [INFO ] Computed 62 invariants in 10 ms
[2024-05-22 05:17:50] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 05:17:50] [INFO ] Invariant cache hit.
[2024-05-22 05:17:50] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:17:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:17:56] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:17:56] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-22 05:17:56] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-05-22 05:17:56] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:17:56] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:17:57] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:17:57] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:17:57] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:17:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:17:57] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:17:58] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:18:00] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:04] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:18:04] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:18:05] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:18:05] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:18:05] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:18:05] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:18:05] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:18:05] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:18:05] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:08] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-22 05:18:08] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:18:08] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:18:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:18:09] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-22 05:18:09] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:18:09] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:18:09] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:18:11] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:14] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:18:18] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:23] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:18:23] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-22 05:18:23] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:18:23] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:18:24] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:18:24] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-22 05:18:24] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:18:24] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:18:24] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:18:26] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:18:26] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:26] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:18:27] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:18:27] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:30] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:18:32] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:18:32] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:18:33] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 393/410 places, 333/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60761 ms. Remains : 393/410 places, 333/359 transitions.
[2024-05-22 05:18:51] [INFO ] Flatten gal took : 25 ms
[2024-05-22 05:18:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 05:18:51] [INFO ] Input system was already deterministic with 333 transitions.
[2024-05-22 05:18:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 05:18:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 05:18:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15393395806859431847.gal : 8 ms
[2024-05-22 05:18:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8322690491135142077.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15393395806859431847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8322690491135142077.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:19:21] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:19:21] [INFO ] Applying decomposition
[2024-05-22 05:19:21] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14033815982732782933.txt' '-o' '/tmp/graph14033815982732782933.bin' '-w' '/tmp/graph14033815982732782933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14033815982732782933.bin' '-l' '-1' '-v' '-w' '/tmp/graph14033815982732782933.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:19:21] [INFO ] Decomposing Gal with order
[2024-05-22 05:19:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:19:21] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 05:19:21] [INFO ] Flatten gal took : 49 ms
[2024-05-22 05:19:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-22 05:19:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10680821159536379393.gal : 5 ms
[2024-05-22 05:19:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13144962555017109384.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10680821159536379393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13144962555017109384.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 398 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 394 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 393 transition count 333
Applied a total of 43 rules in 45 ms. Remains 393 /410 variables (removed 17) and now considering 333/359 (removed 26) transitions.
[2024-05-22 05:19:51] [INFO ] Invariant cache hit.
[2024-05-22 05:19:51] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 05:19:51] [INFO ] Invariant cache hit.
[2024-05-22 05:19:52] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:19:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:19:57] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:19:57] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
[2024-05-22 05:19:57] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-22 05:19:57] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:19:58] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:19:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:19:58] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:19:58] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:19:58] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 3 ms to minimize.
[2024-05-22 05:19:59] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:19:59] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-22 05:19:59] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-22 05:20:00] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:20:00] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:20:01] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:05] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-22 05:20:05] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:20:06] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:20:06] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:20:06] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:20:06] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:20:06] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:20:06] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:20:06] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:09] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:20:10] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:20:10] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:20:10] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:20:10] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-22 05:20:10] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-05-22 05:20:10] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:20:10] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:20:12] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:16] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:19] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:20:19] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:20:19] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:20:19] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:20:19] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:20:19] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:20:19] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:20:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:20:20] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-22 05:20:20] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:20:20] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:20:20] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:20:26] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:20:27] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-22 05:20:27] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:28] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:20:28] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:20:29] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:31] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:20:33] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:34] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:20:34] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 393/410 places, 333/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60768 ms. Remains : 393/410 places, 333/359 transitions.
[2024-05-22 05:20:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:20:52] [INFO ] Flatten gal took : 12 ms
[2024-05-22 05:20:52] [INFO ] Input system was already deterministic with 333 transitions.
[2024-05-22 05:20:52] [INFO ] Flatten gal took : 12 ms
[2024-05-22 05:20:52] [INFO ] Flatten gal took : 12 ms
[2024-05-22 05:20:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15851536880710082526.gal : 3 ms
[2024-05-22 05:20:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1724646487731277477.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15851536880710082526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1724646487731277477.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:21:22] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:21:22] [INFO ] Applying decomposition
[2024-05-22 05:21:22] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3323356874768428326.txt' '-o' '/tmp/graph3323356874768428326.bin' '-w' '/tmp/graph3323356874768428326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3323356874768428326.bin' '-l' '-1' '-v' '-w' '/tmp/graph3323356874768428326.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:21:22] [INFO ] Decomposing Gal with order
[2024-05-22 05:21:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:21:22] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 05:21:22] [INFO ] Flatten gal took : 21 ms
[2024-05-22 05:21:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 05:21:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4719972815067312859.gal : 5 ms
[2024-05-22 05:21:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9084926416761531067.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4719972815067312859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9084926416761531067.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.7246e+20,7.57239,203048,22200,4194,483793,26990,700,382441,372,181734,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 398 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 394 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 393 transition count 333
Applied a total of 43 rules in 56 ms. Remains 393 /410 variables (removed 17) and now considering 333/359 (removed 26) transitions.
[2024-05-22 05:21:52] [INFO ] Invariant cache hit.
[2024-05-22 05:21:52] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 05:21:52] [INFO ] Invariant cache hit.
[2024-05-22 05:21:53] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:21:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:21:58] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 3 ms to minimize.
[2024-05-22 05:21:58] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 3 ms to minimize.
[2024-05-22 05:21:58] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 3 ms to minimize.
[2024-05-22 05:21:59] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 05:21:59] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:21:59] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:21:59] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:21:59] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:21:59] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:22:00] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:22:00] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:22:00] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:22:01] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:22:01] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:22:02] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:06] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-22 05:22:06] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:22:07] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:22:07] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:22:07] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:22:07] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:22:07] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:22:07] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:22:07] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:11] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:22:11] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:22:11] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:22:11] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:22:11] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-22 05:22:11] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:22:11] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:22:11] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-05-22 05:22:13] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:17] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:20] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:22:20] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:22:20] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:22:20] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:22:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-22 05:22:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:22:21] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:22:21] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:22:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:22:21] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:22:21] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:22:21] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:26] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:22:26] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:22:26] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:22:26] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:22:26] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-05-22 05:22:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:22:27] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:22:27] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:22:27] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:22:28] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:22:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:29] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-05-22 05:22:29] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 4 ms to minimize.
[2024-05-22 05:22:30] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:32] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:22:34] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:22:35] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:22:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 393/410 places, 333/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60804 ms. Remains : 393/410 places, 333/359 transitions.
[2024-05-22 05:22:53] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:22:53] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:22:53] [INFO ] Input system was already deterministic with 333 transitions.
[2024-05-22 05:22:53] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:22:53] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:22:53] [INFO ] Time to serialize gal into /tmp/CTLFireability11266849805473066031.gal : 2 ms
[2024-05-22 05:22:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13431578574438918764.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11266849805473066031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13431578574438918764.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:23:23] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:23:23] [INFO ] Applying decomposition
[2024-05-22 05:23:23] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10447836665103344846.txt' '-o' '/tmp/graph10447836665103344846.bin' '-w' '/tmp/graph10447836665103344846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10447836665103344846.bin' '-l' '-1' '-v' '-w' '/tmp/graph10447836665103344846.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:23:23] [INFO ] Decomposing Gal with order
[2024-05-22 05:23:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:23:23] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 05:23:23] [INFO ] Flatten gal took : 17 ms
[2024-05-22 05:23:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 05:23:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14797928365978916280.gal : 3 ms
[2024-05-22 05:23:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4657405458951239034.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14797928365978916280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4657405458951239034.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 400 transition count 349
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 400 transition count 349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 400 transition count 345
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 396 transition count 341
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 396 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 35 place count 396 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 395 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 395 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 395 transition count 336
Applied a total of 38 rules in 40 ms. Remains 395 /410 variables (removed 15) and now considering 336/359 (removed 23) transitions.
// Phase 1: matrix 336 rows 395 cols
[2024-05-22 05:23:53] [INFO ] Computed 62 invariants in 15 ms
[2024-05-22 05:23:53] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 05:23:53] [INFO ] Invariant cache hit.
[2024-05-22 05:23:54] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-05-22 05:23:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 1/395 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 336/731 variables, 395/457 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:24:01] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-22 05:24:01] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:24:01] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:24:02] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:24:02] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:24:02] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:24:02] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:24:02] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:24:02] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:24:02] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:24:03] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-22 05:24:03] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:24:03] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:24:03] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:24:03] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:24:03] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:24:04] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:24:04] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:24:04] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:24:04] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:24:10] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:24:10] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:24:10] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:24:10] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:24:11] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:24:11] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:24:11] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:24:11] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:24:12] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:24:12] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-22 05:24:12] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-22 05:24:12] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:24:12] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:24:12] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-22 05:24:12] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:24:12] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/731 variables, 16/493 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:24:17] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-22 05:24:17] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:24:18] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:24:18] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:24:18] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:24:18] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-05-22 05:24:19] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-22 05:24:19] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2024-05-22 05:24:19] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-22 05:24:20] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/731 variables, 10/503 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:24:21] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:24:21] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:24:22] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-22 05:24:23] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:24:23] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 731/731 variables, and 508 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 1/395 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 51/113 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:24:27] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:24:27] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:24:27] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:24:27] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:24:27] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:24:27] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:24:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:24:29] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:24:29] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:24:30] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2024-05-22 05:24:30] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:24:30] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:24:31] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:24:34] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:24:36] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:24:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 11 (OVERLAPS) 336/731 variables, 395/524 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/731 variables, 335/859 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 731/731 variables, and 859 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 67/67 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 395/410 places, 336/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60705 ms. Remains : 395/410 places, 336/359 transitions.
[2024-05-22 05:24:54] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:24:54] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:24:54] [INFO ] Input system was already deterministic with 336 transitions.
[2024-05-22 05:24:54] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:24:54] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:24:54] [INFO ] Time to serialize gal into /tmp/CTLFireability780486203273880103.gal : 2 ms
[2024-05-22 05:24:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1155848813574576678.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability780486203273880103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1155848813574576678.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:25:24] [INFO ] Flatten gal took : 23 ms
[2024-05-22 05:25:24] [INFO ] Applying decomposition
[2024-05-22 05:25:24] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14204358484117346073.txt' '-o' '/tmp/graph14204358484117346073.bin' '-w' '/tmp/graph14204358484117346073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14204358484117346073.bin' '-l' '-1' '-v' '-w' '/tmp/graph14204358484117346073.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:25:24] [INFO ] Decomposing Gal with order
[2024-05-22 05:25:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:25:24] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 05:25:24] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:25:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-22 05:25:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13520656438237424854.gal : 4 ms
[2024-05-22 05:25:24] [INFO ] Time to serialize properties into /tmp/CTLFireability5246887516183439543.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13520656438237424854.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5246887516183439543.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 401 transition count 338
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 386 transition count 338
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 386 transition count 327
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 375 transition count 327
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 365 transition count 317
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 365 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 365 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 365 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 364 transition count 311
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 361 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 361 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 90 place count 361 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 360 transition count 302
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 94 place count 359 transition count 302
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 234 place count 289 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 287 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 286 transition count 230
Applied a total of 237 rules in 72 ms. Remains 286 /410 variables (removed 124) and now considering 230/359 (removed 129) transitions.
// Phase 1: matrix 230 rows 286 cols
[2024-05-22 05:25:54] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 05:25:55] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-22 05:25:55] [INFO ] Invariant cache hit.
[2024-05-22 05:25:55] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-22 05:25:55] [INFO ] Redundant transitions in 17 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-22 05:25:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 3/285 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 230/515 variables, 285/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:26:00] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:26:04] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:26:05] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 1/516 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (OVERLAPS) 0/516 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 347 constraints, problems are : Problem set: 0 solved, 226 unsolved in 23343 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 3/285 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 230/515 variables, 285/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 226/572 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:26:34] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:26:34] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/516 variables, and 574 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/286 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 5/5 constraints]
After SMT, in 53485ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 53488ms
Starting structural reductions in SI_CTL mode, iteration 1 : 286/410 places, 230/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54101 ms. Remains : 286/410 places, 230/359 transitions.
[2024-05-22 05:26:48] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:26:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:26:48] [INFO ] Input system was already deterministic with 230 transitions.
RANDOM walk for 866 steps (24 resets) in 7 ms. (108 steps per ms) remains 0/1 properties
FORMULA DES-PT-40b-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 05:26:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:26:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:26:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4268001577160414674.gal : 2 ms
[2024-05-22 05:26:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14131526493351878822.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4268001577160414674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14131526493351878822.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 401 transition count 338
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 386 transition count 338
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 386 transition count 327
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 375 transition count 327
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 365 transition count 317
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 365 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 365 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 365 transition count 311
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 364 transition count 311
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 361 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 361 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 90 place count 361 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 360 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 359 transition count 302
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 228 place count 292 transition count 235
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 290 transition count 233
Applied a total of 230 rules in 49 ms. Remains 290 /410 variables (removed 120) and now considering 233/359 (removed 126) transitions.
// Phase 1: matrix 233 rows 290 cols
[2024-05-22 05:26:49] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 05:26:49] [INFO ] Implicit Places using invariants in 172 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 289/410 places, 233/359 transitions.
Applied a total of 0 rules in 7 ms. Remains 289 /289 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 230 ms. Remains : 289/410 places, 233/359 transitions.
[2024-05-22 05:26:49] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:26:49] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:26:49] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-22 05:26:49] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:26:49] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:26:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10739553803985178842.gal : 2 ms
[2024-05-22 05:26:49] [INFO ] Time to serialize properties into /tmp/CTLFireability14864801434593971210.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10739553803985178842.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14864801434593971210.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:27:19] [INFO ] Flatten gal took : 12 ms
[2024-05-22 05:27:19] [INFO ] Applying decomposition
[2024-05-22 05:27:19] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14999678251535354869.txt' '-o' '/tmp/graph14999678251535354869.bin' '-w' '/tmp/graph14999678251535354869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14999678251535354869.bin' '-l' '-1' '-v' '-w' '/tmp/graph14999678251535354869.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:27:19] [INFO ] Decomposing Gal with order
[2024-05-22 05:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:27:19] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-22 05:27:19] [INFO ] Flatten gal took : 17 ms
[2024-05-22 05:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 2 ms.
[2024-05-22 05:27:19] [INFO ] Time to serialize gal into /tmp/CTLFireability16081362178139886509.gal : 2 ms
[2024-05-22 05:27:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10532299681476885121.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16081362178139886509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10532299681476885121.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.86676e+14,6.11209,150172,21146,5158,345284,20855,396,342930,402,124535,0


Converting to forward existential form...Done !
original formula: AG(((i1.i2.u0.p170==1) + AF(((u15.p92==0)||(u15.p283==0)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((i1.i2.u0.p170==1))),!(((u15.p92==0)||(u15.p283==0))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 401 transition count 338
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 386 transition count 338
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 386 transition count 328
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 376 transition count 328
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 61 place count 366 transition count 318
Iterating global reduction 2 with 10 rules applied. Total rules applied 71 place count 366 transition count 318
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 76 place count 366 transition count 313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 76 place count 366 transition count 312
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 365 transition count 312
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 362 transition count 309
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 362 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 88 place count 362 transition count 305
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 361 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 90 place count 361 transition count 303
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 92 place count 360 transition count 303
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 234 place count 289 transition count 232
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 289 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 287 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 239 place count 286 transition count 230
Applied a total of 239 rules in 56 ms. Remains 286 /410 variables (removed 124) and now considering 230/359 (removed 129) transitions.
// Phase 1: matrix 230 rows 286 cols
[2024-05-22 05:27:49] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 05:27:49] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-22 05:27:49] [INFO ] Invariant cache hit.
[2024-05-22 05:27:49] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-22 05:27:49] [INFO ] Redundant transitions in 2 ms returned []
Running 227 sub problems to find dead transitions.
[2024-05-22 05:27:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 2/285 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 230/515 variables, 285/343 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:27:55] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:27:57] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:28:01] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (OVERLAPS) 1/516 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:28:06] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:28:06] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:28:07] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/516 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:28:09] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/516 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:28:14] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/516 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:28:18] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:28:18] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:28:18] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:28:18] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 356 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 2/285 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 230/515 variables, 285/354 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 227/581 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 227 unsolved
SMT process timed out in 60122ms, After SMT, problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in SI_CTL mode, iteration 1 : 286/410 places, 230/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60664 ms. Remains : 286/410 places, 230/359 transitions.
[2024-05-22 05:28:50] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:28:50] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:28:50] [INFO ] Input system was already deterministic with 230 transitions.
[2024-05-22 05:28:50] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:28:50] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:28:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8170540835920634863.gal : 1 ms
[2024-05-22 05:28:50] [INFO ] Time to serialize properties into /tmp/CTLFireability18310483299451097485.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8170540835920634863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18310483299451097485.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:29:20] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:29:20] [INFO ] Applying decomposition
[2024-05-22 05:29:20] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4653505790931229974.txt' '-o' '/tmp/graph4653505790931229974.bin' '-w' '/tmp/graph4653505790931229974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4653505790931229974.bin' '-l' '-1' '-v' '-w' '/tmp/graph4653505790931229974.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:29:20] [INFO ] Decomposing Gal with order
[2024-05-22 05:29:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:29:20] [INFO ] Removed a total of 7 redundant transitions.
[2024-05-22 05:29:20] [INFO ] Flatten gal took : 12 ms
[2024-05-22 05:29:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 05:29:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11273358360586624049.gal : 2 ms
[2024-05-22 05:29:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16166902932522742786.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11273358360586624049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16166902932522742786.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.09382e+14,2.04823,72812,5689,6520,164179,15652,318,130781,397,109501,0


Converting to forward existential form...Done !
original formula: EF(EG(((i13.i0.u17.p300==1)&&(i13.i0.u45.p400==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((i13.i0.u17.p300==1)&&(i13.i0.u45.p400==1)))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,18.4396,492308,1,0,1.30732e+06,98765,1130,947384,2897,625924,1050775
FORMULA DES-PT-40b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 398 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 394 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 393 transition count 333
Applied a total of 43 rules in 25 ms. Remains 393 /410 variables (removed 17) and now considering 333/359 (removed 26) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:29:38] [INFO ] Computed 62 invariants in 7 ms
[2024-05-22 05:29:38] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 05:29:38] [INFO ] Invariant cache hit.
[2024-05-22 05:29:39] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:29:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-22 05:29:44] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:29:46] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:29:46] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:29:47] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:29:47] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:29:47] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:29:52] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:29:53] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:29:53] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:29:53] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:29:53] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:29:53] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:29:53] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:29:53] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:29:53] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:29:57] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:29:57] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:29:57] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:29:57] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-22 05:29:57] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-22 05:29:57] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:29:57] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:29:57] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-05-22 05:29:59] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:03] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:06] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:30:06] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:30:06] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:30:06] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:30:07] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-22 05:30:07] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:30:07] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:30:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:30:07] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:30:07] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:30:07] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:30:07] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:12] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:30:12] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:30:12] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:30:12] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:30:12] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:30:12] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:30:13] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:30:13] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:30:13] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:30:15] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:30:15] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:15] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:30:15] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:30:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:18] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:30:21] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:30:21] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:30:21] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 393/410 places, 333/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60825 ms. Remains : 393/410 places, 333/359 transitions.
[2024-05-22 05:30:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:30:39] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:30:39] [INFO ] Input system was already deterministic with 333 transitions.
[2024-05-22 05:30:39] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:30:39] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:30:39] [INFO ] Time to serialize gal into /tmp/CTLFireability8776245022975675980.gal : 1 ms
[2024-05-22 05:30:39] [INFO ] Time to serialize properties into /tmp/CTLFireability15659026643130934025.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8776245022975675980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15659026643130934025.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:31:09] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:31:09] [INFO ] Applying decomposition
[2024-05-22 05:31:09] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7490684894720661752.txt' '-o' '/tmp/graph7490684894720661752.bin' '-w' '/tmp/graph7490684894720661752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7490684894720661752.bin' '-l' '-1' '-v' '-w' '/tmp/graph7490684894720661752.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:31:09] [INFO ] Decomposing Gal with order
[2024-05-22 05:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:31:09] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 05:31:09] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:31:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 05:31:09] [INFO ] Time to serialize gal into /tmp/CTLFireability12748375982455839469.gal : 2 ms
[2024-05-22 05:31:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2569494580646928466.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12748375982455839469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2569494580646928466.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 401 transition count 350
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 401 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 401 transition count 346
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 398 transition count 343
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 398 transition count 343
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 398 transition count 341
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 397 transition count 340
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 397 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 397 transition count 339
Applied a total of 33 rules in 25 ms. Remains 397 /410 variables (removed 13) and now considering 339/359 (removed 20) transitions.
// Phase 1: matrix 339 rows 397 cols
[2024-05-22 05:31:39] [INFO ] Computed 62 invariants in 7 ms
[2024-05-22 05:31:40] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-22 05:31:40] [INFO ] Invariant cache hit.
[2024-05-22 05:31:40] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2024-05-22 05:31:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 1/397 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (OVERLAPS) 339/736 variables, 397/459 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:31:47] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:31:47] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:31:47] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:31:48] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:31:48] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:31:48] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:31:48] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-22 05:31:48] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:31:48] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:31:48] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:31:48] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:31:48] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:31:49] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:31:49] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:31:49] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:31:50] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-22 05:31:50] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-22 05:31:50] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-22 05:31:50] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-22 05:31:50] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/736 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:31:55] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:31:55] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:31:56] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/736 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:32:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-22 05:32:02] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:32:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 736/736 variables, and 485 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 1/397 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 26/88 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:32:13] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-22 05:32:14] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:32:14] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:32:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:32:14] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:32:14] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:32:14] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:32:14] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-22 05:32:14] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:32:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:32:15] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:32:15] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:32:15] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:32:15] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:32:15] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-22 05:32:15] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:32:15] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:32:15] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:32:16] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:32:16] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:32:16] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:32:16] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-22 05:32:16] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-22 05:32:16] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 14/122 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:32:18] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:32:18] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-22 05:32:19] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:32:19] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (OVERLAPS) 339/736 variables, 397/523 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/736 variables, 338/861 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 736/736 variables, and 861 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 64/64 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 397/410 places, 339/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60739 ms. Remains : 397/410 places, 339/359 transitions.
[2024-05-22 05:32:40] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:32:40] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:32:40] [INFO ] Input system was already deterministic with 339 transitions.
[2024-05-22 05:32:40] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:32:40] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:32:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9294234221212972445.gal : 2 ms
[2024-05-22 05:32:40] [INFO ] Time to serialize properties into /tmp/CTLFireability16927075533806049421.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9294234221212972445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16927075533806049421.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:33:10] [INFO ] Flatten gal took : 16 ms
[2024-05-22 05:33:10] [INFO ] Applying decomposition
[2024-05-22 05:33:10] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13142594222525003281.txt' '-o' '/tmp/graph13142594222525003281.bin' '-w' '/tmp/graph13142594222525003281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13142594222525003281.bin' '-l' '-1' '-v' '-w' '/tmp/graph13142594222525003281.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:33:10] [INFO ] Decomposing Gal with order
[2024-05-22 05:33:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:33:10] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 05:33:10] [INFO ] Flatten gal took : 21 ms
[2024-05-22 05:33:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 05:33:10] [INFO ] Time to serialize gal into /tmp/CTLFireability10926795893369363559.gal : 3 ms
[2024-05-22 05:33:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4157214647958485708.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10926795893369363559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4157214647958485708.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 398 transition count 347
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 398 transition count 347
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 398 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 394 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 393 transition count 333
Applied a total of 43 rules in 17 ms. Remains 393 /410 variables (removed 17) and now considering 333/359 (removed 26) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:33:40] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 05:33:41] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 05:33:41] [INFO ] Invariant cache hit.
[2024-05-22 05:33:41] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:33:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:33:46] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:33:46] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-22 05:33:47] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-22 05:33:47] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:33:47] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:33:47] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:33:47] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:33:48] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:33:48] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:33:48] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:33:48] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:33:49] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-22 05:33:49] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:33:49] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:33:50] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:33:55] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:33:55] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:33:55] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:33:55] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:33:55] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:33:55] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:33:55] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:33:56] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:33:56] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:33:59] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:33:59] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:33:59] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:33:59] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:33:59] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-22 05:33:59] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-22 05:33:59] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:33:59] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-22 05:34:01] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:34:05] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 11 ms to minimize.
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:34:09] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:34:10] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:34:14] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:34:14] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:34:14] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:34:14] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:34:14] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:34:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-22 05:34:15] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:34:15] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:34:15] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:34:17] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:34:17] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:34:17] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:34:17] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:34:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:34:20] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:34:23] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:34:23] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-22 05:34:23] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 393/410 places, 333/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60777 ms. Remains : 393/410 places, 333/359 transitions.
[2024-05-22 05:34:41] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:34:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:34:41] [INFO ] Input system was already deterministic with 333 transitions.
[2024-05-22 05:34:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:34:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:34:41] [INFO ] Time to serialize gal into /tmp/CTLFireability10796681866544781094.gal : 2 ms
[2024-05-22 05:34:41] [INFO ] Time to serialize properties into /tmp/CTLFireability11017917402918062136.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10796681866544781094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11017917402918062136.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:35:11] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:35:11] [INFO ] Applying decomposition
[2024-05-22 05:35:11] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16707789827123486376.txt' '-o' '/tmp/graph16707789827123486376.bin' '-w' '/tmp/graph16707789827123486376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16707789827123486376.bin' '-l' '-1' '-v' '-w' '/tmp/graph16707789827123486376.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:35:11] [INFO ] Decomposing Gal with order
[2024-05-22 05:35:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:35:11] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 05:35:11] [INFO ] Flatten gal took : 12 ms
[2024-05-22 05:35:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 05:35:11] [INFO ] Time to serialize gal into /tmp/CTLFireability1443321297860429831.gal : 3 ms
[2024-05-22 05:35:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5616406362344093645.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1443321297860429831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5616406362344093645.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.7246e+20,7.17211,226268,13858,4375,419944,23953,687,1.06569e+06,393,151140,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 400 transition count 349
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 400 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 400 transition count 344
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 397 transition count 341
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 397 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 397 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 396 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 396 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 396 transition count 336
Applied a total of 37 rules in 28 ms. Remains 396 /410 variables (removed 14) and now considering 336/359 (removed 23) transitions.
// Phase 1: matrix 336 rows 396 cols
[2024-05-22 05:35:41] [INFO ] Computed 62 invariants in 4 ms
[2024-05-22 05:35:42] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 05:35:42] [INFO ] Invariant cache hit.
[2024-05-22 05:35:42] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-05-22 05:35:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 1/396 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 336/732 variables, 396/458 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:35:49] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:35:49] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:35:50] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:35:50] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:35:50] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:35:50] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:35:50] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:35:50] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
[2024-05-22 05:35:51] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-22 05:35:51] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:35:51] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:35:51] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:35:51] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:35:52] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:35:52] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:35:52] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 16/474 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:36:00] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:36:03] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/732 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:36:06] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:36:06] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-22 05:36:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-22 05:36:07] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/732 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 732/732 variables, and 480 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 1/396 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 22/84 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:36:15] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:36:15] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:36:15] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:36:15] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:36:15] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:36:15] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:36:15] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-22 05:36:16] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:36:16] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:36:16] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:36:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 05:36:16] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 12/96 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-05-22 05:36:18] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:36:18] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-22 05:36:18] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:36:18] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:36:18] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-22 05:36:18] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:36:18] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:36:19] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:36:19] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-22 05:36:19] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-22 05:36:20] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 336/732 variables, 396/503 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/732 variables, 335/838 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 732/732 variables, and 838 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 45/45 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 396/410 places, 336/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60705 ms. Remains : 396/410 places, 336/359 transitions.
[2024-05-22 05:36:42] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:36:42] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:36:42] [INFO ] Input system was already deterministic with 336 transitions.
[2024-05-22 05:36:42] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:36:42] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:36:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4432860473855005653.gal : 2 ms
[2024-05-22 05:36:42] [INFO ] Time to serialize properties into /tmp/CTLFireability3367787730328710267.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4432860473855005653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3367787730328710267.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:37:12] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:37:12] [INFO ] Applying decomposition
[2024-05-22 05:37:12] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10680589494108102340.txt' '-o' '/tmp/graph10680589494108102340.bin' '-w' '/tmp/graph10680589494108102340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10680589494108102340.bin' '-l' '-1' '-v' '-w' '/tmp/graph10680589494108102340.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:37:12] [INFO ] Decomposing Gal with order
[2024-05-22 05:37:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:37:12] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 05:37:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:37:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 05:37:12] [INFO ] Time to serialize gal into /tmp/CTLFireability7995008036051676268.gal : 3 ms
[2024-05-22 05:37:12] [INFO ] Time to serialize properties into /tmp/CTLFireability18245474104078049047.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7995008036051676268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18245474104078049047.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 399 transition count 348
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 399 transition count 348
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 27 place count 399 transition count 343
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 397 transition count 341
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 397 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 397 transition count 340
Applied a total of 32 rules in 28 ms. Remains 397 /410 variables (removed 13) and now considering 340/359 (removed 19) transitions.
// Phase 1: matrix 340 rows 397 cols
[2024-05-22 05:37:42] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 05:37:43] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 05:37:43] [INFO ] Invariant cache hit.
[2024-05-22 05:37:43] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2024-05-22 05:37:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 1/397 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 339 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (OVERLAPS) 340/737 variables, 397/459 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:37:51] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:37:52] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:37:52] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:37:52] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-05-22 05:37:52] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:37:52] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:37:52] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:37:52] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:37:52] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:37:52] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:37:53] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/737 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 05:37:54] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/737 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 05:37:58] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:37:58] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:37:59] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-22 05:37:59] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-22 05:37:59] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2024-05-22 05:37:59] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-22 05:38:00] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-05-22 05:38:00] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-05-22 05:38:00] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:38:00] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:38:00] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:38:00] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
[2024-05-22 05:38:00] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:38:01] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:38:03] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:38:03] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:38:03] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/737 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 05:38:06] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:38:06] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:38:06] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 737/737 variables, and 500 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 1/397 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 41/103 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 05:38:16] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:38:16] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:38:16] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:38:16] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:38:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:38:16] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:38:18] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 05:38:19] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-22 05:38:20] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 340/737 variables, 397/509 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 339/848 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 737/737 variables, and 848 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 50/50 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 397/410 places, 340/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60853 ms. Remains : 397/410 places, 340/359 transitions.
[2024-05-22 05:38:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:38:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:38:43] [INFO ] Input system was already deterministic with 340 transitions.
[2024-05-22 05:38:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:38:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:38:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11565993841386612982.gal : 1 ms
[2024-05-22 05:38:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3225838282596868583.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11565993841386612982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3225838282596868583.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:39:13] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:39:13] [INFO ] Applying decomposition
[2024-05-22 05:39:13] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9640014898960564582.txt' '-o' '/tmp/graph9640014898960564582.bin' '-w' '/tmp/graph9640014898960564582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9640014898960564582.bin' '-l' '-1' '-v' '-w' '/tmp/graph9640014898960564582.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:39:13] [INFO ] Decomposing Gal with order
[2024-05-22 05:39:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:39:13] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 05:39:13] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:39:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 05:39:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1078459576523871065.gal : 3 ms
[2024-05-22 05:39:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12526810618068528887.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1078459576523871065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12526810618068528887.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 401 transition count 339
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 387 transition count 339
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 387 transition count 327
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 375 transition count 327
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 63 place count 365 transition count 317
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 365 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 365 transition count 312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 78 place count 365 transition count 311
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 364 transition count 311
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 361 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 361 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 90 place count 361 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 360 transition count 302
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 94 place count 359 transition count 302
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 234 place count 289 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 287 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 286 transition count 230
Applied a total of 237 rules in 52 ms. Remains 286 /410 variables (removed 124) and now considering 230/359 (removed 129) transitions.
// Phase 1: matrix 230 rows 286 cols
[2024-05-22 05:39:43] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 05:39:44] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 05:39:44] [INFO ] Invariant cache hit.
[2024-05-22 05:39:44] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-22 05:39:44] [INFO ] Redundant transitions in 1 ms returned []
Running 227 sub problems to find dead transitions.
[2024-05-22 05:39:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 1/284 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 227 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/285 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 230/515 variables, 285/343 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:39:51] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (OVERLAPS) 1/516 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/516 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:39:57] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:39:57] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/516 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 15 (OVERLAPS) 0/516 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 347 constraints, problems are : Problem set: 0 solved, 227 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 1/284 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 1/285 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 10 (OVERLAPS) 230/515 variables, 285/346 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 227/573 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 05:40:18] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:40:18] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:40:18] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-22 05:40:21] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/516 variables, and 577 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/286 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 7/7 constraints]
After SMT, in 50165ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 50167ms
Starting structural reductions in SI_CTL mode, iteration 1 : 286/410 places, 230/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50678 ms. Remains : 286/410 places, 230/359 transitions.
[2024-05-22 05:40:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:40:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:40:34] [INFO ] Input system was already deterministic with 230 transitions.
[2024-05-22 05:40:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:40:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:40:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11648989568206365143.gal : 2 ms
[2024-05-22 05:40:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1124879171415983852.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11648989568206365143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1124879171415983852.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (1258 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality1124879171415983852.prop.
BEST_FIRST walk for 40004 steps (236 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 80
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :80 after 116
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :116 after 424
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :424 after 7836
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7836 after 40888
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :40888 after 739392
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :739392 after 5.45631e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.45631e+06 after 1.62726e+07
Interrupted probabilistic random walk after 1703249 steps, run timeout after 3001 ms. (steps per millisecond=567 ) properties seen :0 out of 1
Probabilistic random walk after 1703249 steps, saw 231745 distinct states, run finished after 3001 ms. (steps per millisecond=567 ) properties seen :0
[2024-05-22 05:40:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/68 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/216 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/222 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 178/406 variables, 228/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/426 variables, 11/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/427 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 49/476 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/476 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/476 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 40/516 variables, 40/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/516 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/516 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/68 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/216 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/222 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/228 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 178/406 variables, 228/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/426 variables, 11/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/427 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/427 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/476 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/476 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/476 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 40/516 variables, 40/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/516 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/516 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 518ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 230/230 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 286 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 284 transition count 226
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 280 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 278 transition count 224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 278 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 277 transition count 223
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 277 transition count 223
Applied a total of 21 rules in 32 ms. Remains 277 /286 variables (removed 9) and now considering 223/230 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 277/286 places, 223/230 transitions.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.62726e+07 after 3.84013e+07
RANDOM walk for 4000000 steps (182547 resets) in 11166 ms. (358 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (35369 resets) in 4565 ms. (876 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.84013e+07 after 1.40167e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.40167e+08 after 1.63283e+08
Interrupted probabilistic random walk after 6983399 steps, run timeout after 12001 ms. (steps per millisecond=581 ) properties seen :0 out of 1
Probabilistic random walk after 6983399 steps, saw 958097 distinct states, run finished after 12001 ms. (steps per millisecond=581 ) properties seen :0
// Phase 1: matrix 223 rows 277 cols
[2024-05-22 05:40:54] [INFO ] Computed 60 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/214 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/223 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/225 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/417 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/419 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/461 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/461 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/461 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/500 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/214 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/223 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/225 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/417 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:40:55] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/419 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/419 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/461 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/461 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/461 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/500 variables, 39/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 492ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 277/277 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 05:40:55] [INFO ] Invariant cache hit.
[2024-05-22 05:40:55] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 05:40:55] [INFO ] Invariant cache hit.
[2024-05-22 05:40:55] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-22 05:40:55] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-22 05:40:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 1/275 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/276 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 223/499 variables, 276/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:41:01] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.63283e+08 after 1.02621e+09
[2024-05-22 05:41:02] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-22 05:41:02] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:41:02] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:41:04] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:41:06] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-22 05:41:06] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (OVERLAPS) 1/500 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:41:10] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/500 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:41:14] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/500 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/500 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:41:19] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/500 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/500 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 20 (OVERLAPS) 0/500 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 347 constraints, problems are : Problem set: 0 solved, 220 unsolved in 29232 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/275 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (OVERLAPS) 223/499 variables, 276/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.02621e+09 after 8.64984e+09
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 220/566 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 59366ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 59368ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59761 ms. Remains : 277/277 places, 223/223 transitions.
RANDOM walk for 400000 steps (18226 resets) in 2809 ms. (142 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-22 05:41:55] [INFO ] Invariant cache hit.
[2024-05-22 05:41:56] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 05:41:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2024-05-22 05:41:56] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:41:56] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 05:41:56] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (182722 resets) in 11586 ms. (345 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (35340 resets) in 4914 ms. (813 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 6909849 steps, run timeout after 12001 ms. (steps per millisecond=575 ) properties seen :0 out of 1
Probabilistic random walk after 6909849 steps, saw 948547 distinct states, run finished after 12001 ms. (steps per millisecond=575 ) properties seen :0
[2024-05-22 05:42:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/214 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/223 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/225 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/417 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/419 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/419 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/461 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/461 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/461 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 39/500 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/66 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/214 variables, 23/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/223 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/225 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/417 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/419 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/419 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/419 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/461 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/461 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/461 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/500 variables, 39/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/500 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/500 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 338 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 446ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 277/277 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-22 05:42:12] [INFO ] Invariant cache hit.
[2024-05-22 05:42:13] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 05:42:13] [INFO ] Invariant cache hit.
[2024-05-22 05:42:13] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-05-22 05:42:13] [INFO ] Redundant transitions in 0 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-22 05:42:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 1/275 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/276 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 223/499 variables, 276/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:42:18] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 262144
[2024-05-22 05:42:19] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-22 05:42:19] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:42:20] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
SDD size :8.64984e+09 after 3.97039e+10
At refinement iteration 9 (INCLUDED_ONLY) 0/499 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:42:22] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/499 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:42:24] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:42:24] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/499 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (OVERLAPS) 1/500 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:42:28] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/500 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/500 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:42:32] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/500 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/500 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-22 05:42:37] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/500 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/500 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 20 (OVERLAPS) 0/500 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 347 constraints, problems are : Problem set: 0 solved, 220 unsolved in 29354 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/275 variables, 25/54 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 1/276 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (OVERLAPS) 223/499 variables, 276/346 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/499 variables, 220/566 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 59476ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 59478ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59907 ms. Remains : 277/277 places, 223/223 transitions.
RANDOM walk for 400000 steps (18396 resets) in 1149 ms. (347 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-22 05:43:13] [INFO ] Invariant cache hit.
[2024-05-22 05:43:13] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 05:43:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:43:13] [INFO ] After 77ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:43:13] [INFO ] After 96ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 05:43:13] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (1841 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (351 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1715695 steps, run timeout after 3001 ms. (steps per millisecond=571 ) properties seen :0 out of 1
Probabilistic random walk after 1715695 steps, saw 237568 distinct states, run finished after 3001 ms. (steps per millisecond=571 ) properties seen :0
[2024-05-22 05:43:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 51/207 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/225 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/417 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/419 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 42/461 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/461 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 39/500 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/500 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 500/500 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/207 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/225 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 179/404 variables, 225/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:43:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/417 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/419 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 42/461 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/461 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/461 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 39/500 variables, 39/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/500 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 500/500 variables, and 339 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 223/223 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 222
Applied a total of 1 rules in 8 ms. Remains 276 /277 variables (removed 1) and now considering 222/223 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 276/277 places, 222/223 transitions.
RANDOM walk for 40000 steps (1890 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (370 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1723039 steps, run timeout after 3001 ms. (steps per millisecond=574 ) properties seen :0 out of 1
Probabilistic random walk after 1723039 steps, saw 238457 distinct states, run finished after 3001 ms. (steps per millisecond=574 ) properties seen :0
// Phase 1: matrix 222 rows 276 cols
[2024-05-22 05:43:20] [INFO ] Computed 60 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/415 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/417 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 42/459 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/459 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/459 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 39/498 variables, 39/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/498 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/192 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 178/402 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/415 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/417 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 42/459 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/459 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 39/498 variables, 39/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/498 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 404ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 276/276 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 222/222 transitions.
Applied a total of 0 rules in 4 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-22 05:43:20] [INFO ] Invariant cache hit.
[2024-05-22 05:43:20] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 05:43:20] [INFO ] Invariant cache hit.
[2024-05-22 05:43:20] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-05-22 05:43:20] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2024-05-22 05:43:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/275 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 222/497 variables, 275/335 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 05:43:24] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:43:24] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:43:25] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-22 05:43:26] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/498 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 05:43:29] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-22 05:43:29] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:43:29] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:43:30] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/498 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/498 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 344 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14424 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 2/275 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-22 05:43:37] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 222/497 variables, 275/344 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 219/563 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 219 unsolved
SMT process timed out in 44575ms, After SMT, problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 44578ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45025 ms. Remains : 276/276 places, 222/222 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 222
Applied a total of 1 rules in 9 ms. Remains 276 /276 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 276 cols
[2024-05-22 05:44:05] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 05:44:05] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 05:44:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:44:05] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:44:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 05:44:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 05:44:05] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:44:05] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:44:05] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 274 ms.
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 277 transition count 223
Applied a total of 1 rules in 10 ms. Remains 277 /277 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 223 rows 277 cols
[2024-05-22 05:44:05] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 05:44:05] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 05:44:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 05:44:05] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 05:44:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 05:44:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 05:44:06] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 05:44:06] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:44:06] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 05:44:06] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:44:06] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:44:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9938886334389230872.gal : 1 ms
[2024-05-22 05:44:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6878533983884158914.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9938886334389230872.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6878533983884158914.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6878533983884158914.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 44
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :44 after 160
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :160 after 2572
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2572 after 5248
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5248 after 82204
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :82204 after 570572
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :570572 after 6.28196e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.28196e+06 after 1.15037e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.15037e+07 after 4.26519e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.39152e+07 after 7.0929e+07
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7.0929e+07 after 9.53885e+07
Detected timeout of ITS tools.
[2024-05-22 05:44:21] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:44:21] [INFO ] Applying decomposition
[2024-05-22 05:44:21] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2677541013596983196.txt' '-o' '/tmp/graph2677541013596983196.bin' '-w' '/tmp/graph2677541013596983196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2677541013596983196.bin' '-l' '-1' '-v' '-w' '/tmp/graph2677541013596983196.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:44:21] [INFO ] Decomposing Gal with order
[2024-05-22 05:44:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:44:21] [INFO ] Removed a total of 74 redundant transitions.
[2024-05-22 05:44:21] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:44:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 1 ms.
[2024-05-22 05:44:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15755010009072805727.gal : 3 ms
[2024-05-22 05:44:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13676579659803220959.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15755010009072805727.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13676579659803220959.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13676579659803220959.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 150
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :150 after 6006
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6006 after 80406
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :226740 after 4.68456e+10
Reachability property DES-PT-40b-CTLFireability-2023-12 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.8834e+10,3.13259,77240,3803,637,145129,1751,389,200666,367,4261,0
Total reachable state count : 98834025232

Verifying 1 reachability properties.
Reachability property DES-PT-40b-CTLFireability-2023-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40b-CTLFireability-2023-12,2.79627e+09,3.14047,77504,918,295,145129,1751,397,200666,374,4261,0
Over-approximation ignoring read arcs solved 0 properties in 18598 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 05:44:24] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:44:24] [INFO ] Applying decomposition
[2024-05-22 05:44:24] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6664976313641470303.txt' '-o' '/tmp/graph6664976313641470303.bin' '-w' '/tmp/graph6664976313641470303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6664976313641470303.bin' '-l' '-1' '-v' '-w' '/tmp/graph6664976313641470303.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:44:24] [INFO ] Decomposing Gal with order
[2024-05-22 05:44:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:44:24] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 05:44:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:44:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 1 ms.
[2024-05-22 05:44:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7198250008310956622.gal : 1 ms
[2024-05-22 05:44:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5738445808426352472.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7198250008310956622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5738445808426352472.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5738445808426352472.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 1272
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1272 after 306300
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :306300 after 1.13058e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.13058e+10 after 2.16051e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.16051e+10 after 3.80839e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.80839e+10 after 6.89726e+10
Reachability property DES-PT-40b-CTLFireability-2023-12 is true.
FORMULA DES-PT-40b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.52163e+14,1.08983,46380,3336,1866,103644,12995,398,87239,395,57955,0
Total reachable state count : 152162902516750

Verifying 1 reachability properties.
Reachability property DES-PT-40b-CTLFireability-2023-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40b-CTLFireability-2023-12,1.66077e+12,1.09356,46644,652,384,103644,12995,406,87239,402,57955,0
[2024-05-22 05:44:25] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:44:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:44:25] [INFO ] Time to serialize gal into /tmp/CTLFireability4747222088158651133.gal : 2 ms
[2024-05-22 05:44:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9865489458135211887.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4747222088158651133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9865489458135211887.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 0 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Graph (complete) has 922 edges and 410 vertex of which 402 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 401 transition count 338
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 386 transition count 338
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 31 place count 386 transition count 329
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 377 transition count 329
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 58 place count 368 transition count 320
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 368 transition count 320
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 72 place count 368 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 366 transition count 313
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 366 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 366 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 366 transition count 310
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 365 transition count 310
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 220 place count 295 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 221 place count 295 transition count 239
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 293 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 224 place count 292 transition count 237
Applied a total of 224 rules in 43 ms. Remains 292 /410 variables (removed 118) and now considering 237/359 (removed 122) transitions.
// Phase 1: matrix 237 rows 292 cols
[2024-05-22 05:44:55] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 05:44:56] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 05:44:56] [INFO ] Invariant cache hit.
[2024-05-22 05:44:56] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-05-22 05:44:56] [INFO ] Redundant transitions in 1 ms returned []
Running 234 sub problems to find dead transitions.
[2024-05-22 05:44:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 1/290 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 2/292 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 237/529 variables, 292/350 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-22 05:45:03] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:45:04] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-22 05:45:07] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:45:07] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:45:08] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-22 05:45:12] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/529 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-22 05:45:17] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:45:17] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/529 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-22 05:45:20] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-22 05:45:23] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/529 variables, and 360 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (OVERLAPS) 1/290 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 2/292 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 237/529 variables, 292/360 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 234/594 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-22 05:45:44] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-22 05:45:45] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 596 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 12/12 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in SI_CTL mode, iteration 1 : 292/410 places, 237/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60588 ms. Remains : 292/410 places, 237/359 transitions.
[2024-05-22 05:45:56] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:45:56] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:45:56] [INFO ] Input system was already deterministic with 237 transitions.
[2024-05-22 05:45:56] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:45:56] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:45:56] [INFO ] Time to serialize gal into /tmp/CTLFireability10415866511934731189.gal : 2 ms
[2024-05-22 05:45:56] [INFO ] Time to serialize properties into /tmp/CTLFireability3416116254736601746.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10415866511934731189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3416116254736601746.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:46:26] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:46:26] [INFO ] Applying decomposition
[2024-05-22 05:46:26] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1564398800240751458.txt' '-o' '/tmp/graph1564398800240751458.bin' '-w' '/tmp/graph1564398800240751458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1564398800240751458.bin' '-l' '-1' '-v' '-w' '/tmp/graph1564398800240751458.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:46:26] [INFO ] Decomposing Gal with order
[2024-05-22 05:46:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:46:26] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 05:46:26] [INFO ] Flatten gal took : 12 ms
[2024-05-22 05:46:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 05:46:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8403328964574791795.gal : 5 ms
[2024-05-22 05:46:26] [INFO ] Time to serialize properties into /tmp/CTLFireability11322756193139562732.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8403328964574791795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11322756193139562732.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72071e+15,2.65653,90704,6884,5780,201297,27358,350,172098,372,128803,0


Converting to forward existential form...Done !
original formula: AG(((EG(E(EF(((u14.p102==1)&&(u14.p283==1))) U A((i12.i1.u5.p221==1) U ((u14.p118==1)&&(u14.p283==1))))) * EG(EF(((u15.p44==0)||(u15.p290...221
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(EG(E(E(TRUE U ((u14.p102==1)&&(u14.p283==1))) U !((E(!(((u14.p118==1)&&(u14.p283==1))) U...445
Reverse transition relation is NOT exact ! Due to transitions t75, t137, t188, t192, t195, u14.t3, u14.t57, u15.t139, u50.t2, u50.t197, i0.t11, i0.u3.t14, ...804
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 399 transition count 348
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 399 transition count 348
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 27 place count 399 transition count 343
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 396 transition count 340
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 396 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 396 transition count 338
Applied a total of 35 rules in 12 ms. Remains 396 /410 variables (removed 14) and now considering 338/359 (removed 21) transitions.
// Phase 1: matrix 338 rows 396 cols
[2024-05-22 05:46:56] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 05:46:56] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 05:46:56] [INFO ] Invariant cache hit.
[2024-05-22 05:46:57] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2024-05-22 05:46:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/396 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-05-22 05:47:03] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:47:03] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:47:03] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:47:04] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:47:04] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 338/734 variables, 396/463 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:47:11] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:47:12] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:47:12] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:47:12] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-22 05:47:12] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:47:12] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:47:12] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:47:12] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:47:12] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:47:13] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 20/483 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-05-22 05:47:14] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:47:15] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-22 05:47:15] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:47:15] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:47:15] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-22 05:47:15] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:47:15] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:47:15] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:47:15] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:47:15] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:47:17] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 11/494 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-05-22 05:47:19] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:47:19] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:47:21] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 734/734 variables, and 497 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (OVERLAPS) 1/396 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-05-22 05:47:30] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:47:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:47:30] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:47:30] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-22 05:47:30] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (OVERLAPS) 338/734 variables, 396/502 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 337/839 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-05-22 05:47:53] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-22 05:47:54] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-22 05:47:54] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:47:55] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 734/734 variables, and 843 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 48/48 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 396/410 places, 338/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60757 ms. Remains : 396/410 places, 338/359 transitions.
[2024-05-22 05:47:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:47:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:47:57] [INFO ] Input system was already deterministic with 338 transitions.
[2024-05-22 05:47:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:47:57] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:47:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5407411770096898485.gal : 1 ms
[2024-05-22 05:47:57] [INFO ] Time to serialize properties into /tmp/CTLFireability8143088584300528796.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5407411770096898485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8143088584300528796.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:48:27] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:48:27] [INFO ] Applying decomposition
[2024-05-22 05:48:27] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18241223713643603035.txt' '-o' '/tmp/graph18241223713643603035.bin' '-w' '/tmp/graph18241223713643603035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18241223713643603035.bin' '-l' '-1' '-v' '-w' '/tmp/graph18241223713643603035.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:48:27] [INFO ] Decomposing Gal with order
[2024-05-22 05:48:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:48:27] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 05:48:27] [INFO ] Flatten gal took : 12 ms
[2024-05-22 05:48:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 05:48:27] [INFO ] Time to serialize gal into /tmp/CTLFireability15897262139786477916.gal : 2 ms
[2024-05-22 05:48:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13981585441805721119.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15897262139786477916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13981585441805721119.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 410/410 places, 359/359 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 402 transition count 351
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 402 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 402 transition count 349
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 398 transition count 345
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 398 transition count 345
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 398 transition count 342
Applied a total of 29 rules in 19 ms. Remains 398 /410 variables (removed 12) and now considering 342/359 (removed 17) transitions.
// Phase 1: matrix 342 rows 398 cols
[2024-05-22 05:48:57] [INFO ] Computed 62 invariants in 7 ms
[2024-05-22 05:48:57] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 05:48:57] [INFO ] Invariant cache hit.
[2024-05-22 05:48:58] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-05-22 05:48:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 341 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (OVERLAPS) 342/740 variables, 398/460 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:49:05] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:49:05] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:49:06] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:49:08] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:49:10] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:49:10] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:49:10] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:49:10] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:49:11] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:49:11] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:49:14] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 7/471 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:49:15] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:49:15] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:49:15] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:49:15] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 4/475 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:49:20] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:49:20] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-22 05:49:20] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:49:20] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:49:20] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:49:20] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:49:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/740 variables, 7/482 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:49:25] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/740 variables, and 483 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:49:30] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:49:31] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:49:31] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:49:31] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:49:31] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:49:31] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:49:31] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-22 05:49:31] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-22 05:49:32] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:49:32] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:49:32] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:49:32] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-22 05:49:32] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-22 05:49:32] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-22 05:49:33] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:49:34] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:49:34] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-22 05:49:34] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-22 05:49:34] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-22 05:49:34] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-22 05:49:34] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:49:37] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:49:37] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:49:42] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 10 (OVERLAPS) 342/740 variables, 398/507 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/740 variables, 341/848 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/740 variables, and 848 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 47/47 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 398/410 places, 342/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60686 ms. Remains : 398/410 places, 342/359 transitions.
[2024-05-22 05:49:58] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:49:58] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:49:58] [INFO ] Input system was already deterministic with 342 transitions.
[2024-05-22 05:49:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:49:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:49:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17638426304827467332.gal : 2 ms
[2024-05-22 05:49:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1867718329946703203.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17638426304827467332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1867718329946703203.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:50:28] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:50:28] [INFO ] Applying decomposition
[2024-05-22 05:50:28] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph53272787081698069.txt' '-o' '/tmp/graph53272787081698069.bin' '-w' '/tmp/graph53272787081698069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph53272787081698069.bin' '-l' '-1' '-v' '-w' '/tmp/graph53272787081698069.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:50:28] [INFO ] Decomposing Gal with order
[2024-05-22 05:50:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:50:28] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 05:50:28] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:50:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2024-05-22 05:50:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13900652811807011933.gal : 2 ms
[2024-05-22 05:50:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14264068852375351178.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13900652811807011933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14264068852375351178.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:50:58] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:50:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:50:58] [INFO ] Applying decomposition
[2024-05-22 05:50:58] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10381217433118945866.txt' '-o' '/tmp/graph10381217433118945866.bin' '-w' '/tmp/graph10381217433118945866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10381217433118945866.bin' '-l' '-1' '-v' '-w' '/tmp/graph10381217433118945866.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:50:58] [INFO ] Decomposing Gal with order
[2024-05-22 05:50:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:50:58] [INFO ] Removed a total of 25 redundant transitions.
[2024-05-22 05:50:58] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:50:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2024-05-22 05:50:58] [INFO ] Time to serialize gal into /tmp/CTLFireability2283122190093590986.gal : 2 ms
[2024-05-22 05:50:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2672420602420335007.ctl : 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2283122190093590986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2672420602420335007.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.03643e+21,4.10825,133548,11637,3806,307970,28309,740,225236,427,171023,0


Converting to forward existential form...Done !
original formula: AX(AG((((u37.p95==0)||(u37.p283==0))&&(((i1.i1.u35.p277==0)||(u9.p135==0))||(u9.p189==0)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((((u37.p95==0)||(u37.p283==0))&&(((i1.i1.u35.p277==0)||(u9.p135==0))||(u9.p189==0)))))...164
(forward)formula 0,0,6.71908,133548,1,0,307970,30086,1596,225236,999,174873,474424
FORMULA DES-PT-40b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: ((EG(((i0.i2.u15.p213==1) + EG((((u37.p111==0)||(u37.p283==0))&&((u38.p39==0)||(u38.p290==0)))))) + AF((!(A((i7.u53.p338==1) U ((u37.p102...516
=> equivalent forward existential formula: [FwdG(FwdU(EY(((Init * !((EG(((i0.i2.u15.p213==1) + EG((((u37.p111==0)||(u37.p283==0))&&((u38.p39==0)||(u38.p290...693
Reverse transition relation is NOT exact ! Due to transitions t0, t59, t91, t122, t124, t133, t317, t318, u37.t80, u38.t77, i0.i2.u14.t120, i1.i0.u11.t129,...825
ITS-tools command line returned an error code 137
[2024-05-22 06:04:53] [INFO ] Applying decomposition
[2024-05-22 06:04:53] [INFO ] Flatten gal took : 10 ms
[2024-05-22 06:04:53] [INFO ] Decomposing Gal with order
[2024-05-22 06:04:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:04:53] [INFO ] Removed a total of 170 redundant transitions.
[2024-05-22 06:04:53] [INFO ] Flatten gal took : 18 ms
[2024-05-22 06:04:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 591 labels/synchronizations in 9 ms.
[2024-05-22 06:04:53] [INFO ] Time to serialize gal into /tmp/CTLFireability51712070937282787.gal : 2 ms
[2024-05-22 06:04:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5674271621354207742.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability51712070937282787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5674271621354207742.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="DES-PT-40b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DES-PT-40b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189900722"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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