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.r157-smll-171636265200188.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 greatspnxred
Input is EisenbergMcGuire-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265200188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 EisenbergMcGuire-PT-08-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716512343568

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 00:59:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 00:59:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:59:07] [INFO ] Load time of PNML (sax parser for PT used): 832 ms
[2024-05-24 00:59:07] [INFO ] Transformed 712 places.
[2024-05-24 00:59:07] [INFO ] Transformed 2816 transitions.
[2024-05-24 00:59:07] [INFO ] Found NUPN structural information;
[2024-05-24 00:59:07] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 1410 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 61 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 663 transition count 2424
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 663 transition count 2424
Applied a total of 98 rules in 276 ms. Remains 663 /712 variables (removed 49) and now considering 2424/2816 (removed 392) transitions.
[2024-05-24 00:59:08] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
// Phase 1: matrix 976 rows 663 cols
[2024-05-24 00:59:08] [INFO ] Computed 25 invariants in 53 ms
[2024-05-24 00:59:09] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2024-05-24 00:59:09] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-05-24 00:59:09] [INFO ] Invariant cache hit.
[2024-05-24 00:59:10] [INFO ] State equation strengthened by 333 read => feed constraints.
[2024-05-24 00:59:13] [INFO ] Implicit Places using invariants and state equation in 4010 ms returned []
Implicit Place search using SMT with State Equation took 5483 ms to find 0 implicit places.
Running 2416 sub problems to find dead transitions.
[2024-05-24 00:59:13] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-05-24 00:59:13] [INFO ] Invariant cache hit.
[2024-05-24 00:59:14] [INFO ] State equation strengthened by 333 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2416 unsolved
SMT process timed out in 32491ms, After SMT, problems are : Problem set: 0 solved, 2416 unsolved
Search for dead transitions found 0 dead transitions in 32583ms
Starting structural reductions in LTL mode, iteration 1 : 663/712 places, 2424/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38435 ms. Remains : 663/712 places, 2424/2816 transitions.
Support contains 38 out of 663 places after structural reductions.
[2024-05-24 00:59:47] [INFO ] Flatten gal took : 498 ms
[2024-05-24 00:59:47] [INFO ] Flatten gal took : 312 ms
[2024-05-24 00:59:48] [INFO ] Input system was already deterministic with 2424 transitions.
Support contains 35 out of 663 places (down from 38) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (8 resets) in 4426 ms. (9 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 14/14 properties
[2024-05-24 00:59:50] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2024-05-24 00:59:50] [INFO ] Invariant cache hit.
[2024-05-24 00:59:50] [INFO ] State equation strengthened by 333 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 517/548 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 25/573 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 64/637 variables, 8/23 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 26/663 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 976/1639 variables, 663/688 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1639 variables, 333/1021 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1639 variables, 0/1021 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/1639 variables, 0/1021 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1639/1639 variables, and 1021 constraints, problems are : Problem set: 1 solved, 13 unsolved in 3449 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 663/663 constraints, ReadFeed: 333/333 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 519/548 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 25/573 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 64/637 variables, 8/23 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-24 00:59:55] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 34 ms to minimize.
[2024-05-24 00:59:55] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 3 ms to minimize.
[2024-05-24 00:59:55] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-24 00:59:55] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 3 ms to minimize.
[2024-05-24 00:59:55] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2024-05-24 00:59:56] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 4 ms to minimize.
[2024-05-24 00:59:56] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-24 00:59:56] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 8/31 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 26/663 variables, 2/33 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-24 00:59:56] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-05-24 00:59:57] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-24 00:59:57] [INFO ] Deduced a trap composed of 125 places in 449 ms of which 7 ms to minimize.
[2024-05-24 00:59:58] [INFO ] Deduced a trap composed of 99 places in 461 ms of which 7 ms to minimize.
[2024-05-24 00:59:58] [INFO ] Deduced a trap composed of 62 places in 690 ms of which 7 ms to minimize.
[2024-05-24 00:59:59] [INFO ] Deduced a trap composed of 96 places in 589 ms of which 7 ms to minimize.
SMT process timed out in 9093ms, After SMT, problems are : Problem set: 1 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 655 transition count 2218
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 457 transition count 2218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 415 place count 454 transition count 2194
Iterating global reduction 2 with 3 rules applied. Total rules applied 418 place count 454 transition count 2194
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 530 place count 398 transition count 2138
Applied a total of 530 rules in 362 ms. Remains 398 /663 variables (removed 265) and now considering 2138/2424 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 398/663 places, 2138/2424 transitions.
RANDOM walk for 40000 steps (8 resets) in 1050 ms. (38 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 168723 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :1 out of 13
Probabilistic random walk after 168723 steps, saw 98761 distinct states, run finished after 3009 ms. (steps per millisecond=56 ) properties seen :1
[2024-05-24 01:00:03] [INFO ] Flow matrix only has 690 transitions (discarded 1448 similar events)
// Phase 1: matrix 690 rows 398 cols
[2024-05-24 01:00:03] [INFO ] Computed 25 invariants in 6 ms
[2024-05-24 01:00:03] [INFO ] State equation strengthened by 312 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 303/332 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 10/342 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 46/388 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 10/398 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 690/1088 variables, 398/423 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1088 variables, 312/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1088 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/1088 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 735 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1675 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 398/398 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 303/332 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 10/342 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 46/388 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2024-05-24 01:00:06] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 3 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 2 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 2 ms to minimize.
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 10/398 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-24 01:00:07] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-05-24 01:00:08] [INFO ] Deduced a trap composed of 76 places in 396 ms of which 4 ms to minimize.
[2024-05-24 01:00:08] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:00:08] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 690/1088 variables, 398/437 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1088 variables, 312/749 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1088 variables, 12/761 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1088 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/1088 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 761 constraints, problems are : Problem set: 0 solved, 12 unsolved in 6156 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 398/398 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 14/14 constraints]
After SMT, in 7887ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 1 properties in 9453 ms.
Support contains 28 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 2138/2138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 397 transition count 2130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 397 transition count 2130
Applied a total of 2 rules in 129 ms. Remains 397 /398 variables (removed 1) and now considering 2130/2138 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 397/398 places, 2130/2138 transitions.
RANDOM walk for 40000 steps (8 resets) in 339 ms. (117 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 181215 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 11
Probabilistic random walk after 181215 steps, saw 106304 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-24 01:00:24] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
// Phase 1: matrix 682 rows 397 cols
[2024-05-24 01:00:24] [INFO ] Computed 25 invariants in 5 ms
[2024-05-24 01:00:24] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 303/331 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 10/341 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 46/387 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 10/397 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 682/1079 variables, 397/422 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1079 variables, 305/727 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1079 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/1079 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 727 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1980 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 397/397 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 303/331 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 10/341 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 46/387 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 2 ms to minimize.
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 01:00:27] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 01:00:28] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 3 ms to minimize.
[2024-05-24 01:00:28] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-24 01:00:28] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 2 ms to minimize.
[2024-05-24 01:00:28] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-24 01:00:28] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 2 ms to minimize.
[2024-05-24 01:00:29] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 10/397 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 01:00:29] [INFO ] Deduced a trap composed of 98 places in 318 ms of which 4 ms to minimize.
[2024-05-24 01:00:30] [INFO ] Deduced a trap composed of 98 places in 380 ms of which 5 ms to minimize.
[2024-05-24 01:00:30] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-24 01:00:30] [INFO ] Deduced a trap composed of 21 places in 297 ms of which 4 ms to minimize.
[2024-05-24 01:00:30] [INFO ] Deduced a trap composed of 41 places in 491 ms of which 48 ms to minimize.
[2024-05-24 01:00:31] [INFO ] Deduced a trap composed of 95 places in 302 ms of which 3 ms to minimize.
[2024-05-24 01:00:31] [INFO ] Deduced a trap composed of 91 places in 414 ms of which 4 ms to minimize.
[2024-05-24 01:00:32] [INFO ] Deduced a trap composed of 77 places in 537 ms of which 5 ms to minimize.
[2024-05-24 01:00:32] [INFO ] Deduced a trap composed of 74 places in 453 ms of which 5 ms to minimize.
[2024-05-24 01:00:33] [INFO ] Deduced a trap composed of 90 places in 520 ms of which 4 ms to minimize.
[2024-05-24 01:00:33] [INFO ] Deduced a trap composed of 83 places in 492 ms of which 4 ms to minimize.
[2024-05-24 01:00:34] [INFO ] Deduced a trap composed of 81 places in 438 ms of which 4 ms to minimize.
[2024-05-24 01:00:34] [INFO ] Deduced a trap composed of 60 places in 418 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 01:00:35] [INFO ] Deduced a trap composed of 80 places in 477 ms of which 4 ms to minimize.
[2024-05-24 01:00:35] [INFO ] Deduced a trap composed of 91 places in 359 ms of which 4 ms to minimize.
[2024-05-24 01:00:36] [INFO ] Deduced a trap composed of 83 places in 444 ms of which 4 ms to minimize.
[2024-05-24 01:00:36] [INFO ] Deduced a trap composed of 75 places in 413 ms of which 4 ms to minimize.
[2024-05-24 01:00:37] [INFO ] Deduced a trap composed of 129 places in 472 ms of which 4 ms to minimize.
[2024-05-24 01:00:37] [INFO ] Deduced a trap composed of 84 places in 486 ms of which 6 ms to minimize.
[2024-05-24 01:00:38] [INFO ] Deduced a trap composed of 77 places in 454 ms of which 4 ms to minimize.
[2024-05-24 01:00:38] [INFO ] Deduced a trap composed of 104 places in 404 ms of which 4 ms to minimize.
[2024-05-24 01:00:38] [INFO ] Deduced a trap composed of 79 places in 434 ms of which 4 ms to minimize.
[2024-05-24 01:00:39] [INFO ] Deduced a trap composed of 81 places in 410 ms of which 4 ms to minimize.
[2024-05-24 01:00:39] [INFO ] Deduced a trap composed of 68 places in 405 ms of which 4 ms to minimize.
[2024-05-24 01:00:40] [INFO ] Deduced a trap composed of 76 places in 458 ms of which 4 ms to minimize.
[2024-05-24 01:00:40] [INFO ] Deduced a trap composed of 78 places in 440 ms of which 5 ms to minimize.
[2024-05-24 01:00:41] [INFO ] Deduced a trap composed of 75 places in 696 ms of which 8 ms to minimize.
[2024-05-24 01:00:42] [INFO ] Deduced a trap composed of 87 places in 613 ms of which 36 ms to minimize.
[2024-05-24 01:00:42] [INFO ] Deduced a trap composed of 31 places in 594 ms of which 19 ms to minimize.
[2024-05-24 01:00:43] [INFO ] Deduced a trap composed of 27 places in 596 ms of which 19 ms to minimize.
[2024-05-24 01:00:43] [INFO ] Deduced a trap composed of 108 places in 356 ms of which 4 ms to minimize.
[2024-05-24 01:00:44] [INFO ] Deduced a trap composed of 76 places in 381 ms of which 4 ms to minimize.
[2024-05-24 01:00:44] [INFO ] Deduced a trap composed of 53 places in 370 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 01:00:44] [INFO ] Deduced a trap composed of 103 places in 351 ms of which 4 ms to minimize.
[2024-05-24 01:00:45] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:00:45] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:00:45] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-24 01:00:45] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 2 ms to minimize.
[2024-05-24 01:00:45] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 2 ms to minimize.
[2024-05-24 01:00:46] [INFO ] Deduced a trap composed of 74 places in 403 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 01:00:46] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 682/1079 variables, 397/473 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1079 variables, 305/778 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1079 variables, 11/789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 01:00:47] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1079 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1079 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 01:00:49] [INFO ] Deduced a trap composed of 78 places in 285 ms of which 4 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/1079 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1079 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 0/1079 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 791 constraints, problems are : Problem set: 0 solved, 11 unsolved in 24425 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 397/397 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 53/53 constraints]
After SMT, in 26452ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 29814 ms.
Support contains 28 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 2130/2130 transitions.
Applied a total of 0 rules in 129 ms. Remains 397 /397 variables (removed 0) and now considering 2130/2130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 397/397 places, 2130/2130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 2130/2130 transitions.
Applied a total of 0 rules in 143 ms. Remains 397 /397 variables (removed 0) and now considering 2130/2130 (removed 0) transitions.
[2024-05-24 01:01:21] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
[2024-05-24 01:01:21] [INFO ] Invariant cache hit.
[2024-05-24 01:01:22] [INFO ] Implicit Places using invariants in 678 ms returned []
[2024-05-24 01:01:22] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
[2024-05-24 01:01:22] [INFO ] Invariant cache hit.
[2024-05-24 01:01:22] [INFO ] State equation strengthened by 305 read => feed constraints.
[2024-05-24 01:01:24] [INFO ] Implicit Places using invariants and state equation in 2470 ms returned []
Implicit Place search using SMT with State Equation took 3168 ms to find 0 implicit places.
[2024-05-24 01:01:24] [INFO ] Redundant transitions in 147 ms returned []
Running 2122 sub problems to find dead transitions.
[2024-05-24 01:01:24] [INFO ] Flow matrix only has 682 transitions (discarded 1448 similar events)
[2024-05-24 01:01:24] [INFO ] Invariant cache hit.
[2024-05-24 01:01:24] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2122 unsolved
[2024-05-24 01:01:50] [INFO ] Deduced a trap composed of 3 places in 451 ms of which 5 ms to minimize.
[2024-05-24 01:01:50] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 2 ms to minimize.
[2024-05-24 01:01:51] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-05-24 01:01:51] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-05-24 01:01:51] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-24 01:01:51] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 01:01:51] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 4 ms to minimize.
[2024-05-24 01:01:53] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-05-24 01:01:54] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 3 ms to minimize.
[2024-05-24 01:01:54] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 4 ms to minimize.
[2024-05-24 01:01:55] [INFO ] Deduced a trap composed of 45 places in 376 ms of which 4 ms to minimize.
[2024-05-24 01:01:55] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 3 ms to minimize.
[2024-05-24 01:01:55] [INFO ] Deduced a trap composed of 58 places in 261 ms of which 3 ms to minimize.
[2024-05-24 01:01:56] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 3 ms to minimize.
[2024-05-24 01:01:56] [INFO ] Deduced a trap composed of 79 places in 370 ms of which 5 ms to minimize.
SMT process timed out in 31645ms, After SMT, problems are : Problem set: 0 solved, 2122 unsolved
Search for dead transitions found 0 dead transitions in 31674ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35151 ms. Remains : 397/397 places, 2130/2130 transitions.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&(p1 U p2)))))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 658 transition count 2384
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 658 transition count 2384
Applied a total of 10 rules in 112 ms. Remains 658 /663 variables (removed 5) and now considering 2384/2424 (removed 40) transitions.
[2024-05-24 01:01:56] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
// Phase 1: matrix 936 rows 658 cols
[2024-05-24 01:01:56] [INFO ] Computed 25 invariants in 6 ms
[2024-05-24 01:01:58] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2024-05-24 01:01:58] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2024-05-24 01:01:58] [INFO ] Invariant cache hit.
[2024-05-24 01:01:58] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-24 01:02:12] [INFO ] Implicit Places using invariants and state equation in 14267 ms returned []
Implicit Place search using SMT with State Equation took 15515 ms to find 0 implicit places.
Running 2376 sub problems to find dead transitions.
[2024-05-24 01:02:12] [INFO ] Flow matrix only has 936 transitions (discarded 1448 similar events)
[2024-05-24 01:02:12] [INFO ] Invariant cache hit.
[2024-05-24 01:02:12] [INFO ] State equation strengthened by 298 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2376 unsolved
SMT process timed out in 31647ms, After SMT, problems are : Problem set: 0 solved, 2376 unsolved
Search for dead transitions found 0 dead transitions in 31681ms
Starting structural reductions in LTL mode, iteration 1 : 658/663 places, 2384/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47324 ms. Remains : 658/663 places, 2384/2424 transitions.
Stuttering acceptance computed with spot in 498 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), true, (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-00 finished in 47960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 45 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 01:02:44] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-05-24 01:02:44] [INFO ] Computed 25 invariants in 6 ms
[2024-05-24 01:02:45] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-24 01:02:45] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:02:45] [INFO ] Invariant cache hit.
[2024-05-24 01:02:46] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:02:50] [INFO ] Implicit Places using invariants and state equation in 4503 ms returned []
Implicit Place search using SMT with State Equation took 5261 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-05-24 01:02:50] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:02:50] [INFO ] Invariant cache hit.
[2024-05-24 01:02:50] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 32352ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 32428ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37754 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-02 finished in 37937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 393 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-05-24 01:03:23] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 01:03:23] [INFO ] Computed 25 invariants in 5 ms
[2024-05-24 01:03:23] [INFO ] Implicit Places using invariants in 884 ms returned []
[2024-05-24 01:03:23] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:03:23] [INFO ] Invariant cache hit.
[2024-05-24 01:03:24] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 01:03:26] [INFO ] Implicit Places using invariants and state equation in 2424 ms returned []
Implicit Place search using SMT with State Equation took 3324 ms to find 0 implicit places.
[2024-05-24 01:03:26] [INFO ] Redundant transitions in 64 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 01:03:26] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:03:26] [INFO ] Invariant cache hit.
[2024-05-24 01:03:26] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:03:49] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 4 ms to minimize.
[2024-05-24 01:03:49] [INFO ] Deduced a trap composed of 7 places in 259 ms of which 3 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 3 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 1 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 1 ms to minimize.
[2024-05-24 01:03:50] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-24 01:03:51] [INFO ] Deduced a trap composed of 60 places in 362 ms of which 31 ms to minimize.
[2024-05-24 01:03:51] [INFO ] Deduced a trap composed of 76 places in 458 ms of which 5 ms to minimize.
[2024-05-24 01:03:52] [INFO ] Deduced a trap composed of 21 places in 391 ms of which 10 ms to minimize.
[2024-05-24 01:03:53] [INFO ] Deduced a trap composed of 70 places in 236 ms of which 3 ms to minimize.
[2024-05-24 01:03:53] [INFO ] Deduced a trap composed of 65 places in 214 ms of which 3 ms to minimize.
[2024-05-24 01:03:54] [INFO ] Deduced a trap composed of 89 places in 239 ms of which 3 ms to minimize.
[2024-05-24 01:03:54] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 3 ms to minimize.
[2024-05-24 01:03:54] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 3 ms to minimize.
[2024-05-24 01:03:54] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-05-24 01:03:55] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 2 ms to minimize.
[2024-05-24 01:03:55] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-24 01:03:55] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 2 ms to minimize.
[2024-05-24 01:03:55] [INFO ] Deduced a trap composed of 73 places in 394 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1057 variables, and 45 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:04:05] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 1 ms to minimize.
[2024-05-24 01:04:08] [INFO ] Deduced a trap composed of 49 places in 469 ms of which 13 ms to minimize.
[2024-05-24 01:04:11] [INFO ] Deduced a trap composed of 43 places in 2795 ms of which 31 ms to minimize.
[2024-05-24 01:04:13] [INFO ] Deduced a trap composed of 82 places in 392 ms of which 25 ms to minimize.
[2024-05-24 01:04:13] [INFO ] Deduced a trap composed of 60 places in 464 ms of which 5 ms to minimize.
[2024-05-24 01:04:14] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 3 ms to minimize.
[2024-05-24 01:04:14] [INFO ] Deduced a trap composed of 71 places in 254 ms of which 4 ms to minimize.
[2024-05-24 01:04:14] [INFO ] Deduced a trap composed of 56 places in 406 ms of which 26 ms to minimize.
[2024-05-24 01:04:15] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 3 ms to minimize.
[2024-05-24 01:04:15] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 1 ms to minimize.
[2024-05-24 01:04:15] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2024-05-24 01:04:16] [INFO ] Deduced a trap composed of 71 places in 402 ms of which 3 ms to minimize.
[2024-05-24 01:04:16] [INFO ] Deduced a trap composed of 75 places in 274 ms of which 4 ms to minimize.
[2024-05-24 01:04:16] [INFO ] Deduced a trap composed of 72 places in 354 ms of which 6 ms to minimize.
[2024-05-24 01:04:17] [INFO ] Deduced a trap composed of 84 places in 325 ms of which 3 ms to minimize.
[2024-05-24 01:04:17] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:04:17] [INFO ] Deduced a trap composed of 11 places in 406 ms of which 50 ms to minimize.
[2024-05-24 01:04:18] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 3 ms to minimize.
[2024-05-24 01:04:19] [INFO ] Deduced a trap composed of 42 places in 405 ms of which 4 ms to minimize.
[2024-05-24 01:04:19] [INFO ] Deduced a trap composed of 81 places in 282 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:04:21] [INFO ] Deduced a trap composed of 71 places in 248 ms of which 3 ms to minimize.
[2024-05-24 01:04:21] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 3 ms to minimize.
[2024-05-24 01:04:21] [INFO ] Deduced a trap composed of 62 places in 291 ms of which 3 ms to minimize.
[2024-05-24 01:04:22] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 3 ms to minimize.
[2024-05-24 01:04:22] [INFO ] Deduced a trap composed of 80 places in 257 ms of which 3 ms to minimize.
[2024-05-24 01:04:23] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-24 01:04:23] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:04:23] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:04:24] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 3 ms to minimize.
[2024-05-24 01:04:24] [INFO ] Deduced a trap composed of 63 places in 583 ms of which 28 ms to minimize.
[2024-05-24 01:04:25] [INFO ] Deduced a trap composed of 13 places in 339 ms of which 4 ms to minimize.
[2024-05-24 01:04:26] [INFO ] Deduced a trap composed of 76 places in 376 ms of which 3 ms to minimize.
[2024-05-24 01:04:26] [INFO ] Deduced a trap composed of 49 places in 333 ms of which 4 ms to minimize.
[2024-05-24 01:04:27] [INFO ] Deduced a trap composed of 52 places in 531 ms of which 23 ms to minimize.
[2024-05-24 01:04:27] [INFO ] Deduced a trap composed of 66 places in 444 ms of which 46 ms to minimize.
[2024-05-24 01:04:28] [INFO ] Deduced a trap composed of 59 places in 318 ms of which 4 ms to minimize.
[2024-05-24 01:04:32] [INFO ] Deduced a trap composed of 70 places in 4130 ms of which 4 ms to minimize.
SMT process timed out in 66045ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 66068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69870 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-03
Product exploration explored 100000 steps with 638 reset in 568 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-03 finished in 70613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 231 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-05-24 01:04:33] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 01:04:33] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 01:04:36] [INFO ] Implicit Places using invariants in 2963 ms returned []
[2024-05-24 01:04:36] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:04:36] [INFO ] Invariant cache hit.
[2024-05-24 01:04:36] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 01:04:44] [INFO ] Implicit Places using invariants and state equation in 7774 ms returned []
Implicit Place search using SMT with State Equation took 10748 ms to find 0 implicit places.
[2024-05-24 01:04:44] [INFO ] Redundant transitions in 206 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 01:04:44] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:04:44] [INFO ] Invariant cache hit.
[2024-05-24 01:04:44] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:05:12] [INFO ] Deduced a trap composed of 3 places in 374 ms of which 5 ms to minimize.
[2024-05-24 01:05:13] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 2 ms to minimize.
[2024-05-24 01:05:13] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 2 ms to minimize.
[2024-05-24 01:05:13] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-24 01:05:13] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-05-24 01:05:13] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 01:05:13] [INFO ] Deduced a trap composed of 60 places in 357 ms of which 39 ms to minimize.
[2024-05-24 01:05:14] [INFO ] Deduced a trap composed of 77 places in 323 ms of which 3 ms to minimize.
[2024-05-24 01:05:16] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 3 ms to minimize.
[2024-05-24 01:05:16] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 3 ms to minimize.
SMT process timed out in 32109ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 32134ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43343 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 347 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-04 finished in 43789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 423 place count 448 transition count 2160
Iterating global reduction 2 with 7 rules applied. Total rules applied 430 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 542 place count 392 transition count 2104
Applied a total of 542 rules in 155 ms. Remains 392 /663 variables (removed 271) and now considering 2104/2424 (removed 320) transitions.
[2024-05-24 01:05:17] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 01:05:17] [INFO ] Computed 25 invariants in 14 ms
[2024-05-24 01:05:17] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-24 01:05:17] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:05:17] [INFO ] Invariant cache hit.
[2024-05-24 01:05:18] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:05:20] [INFO ] Implicit Places using invariants and state equation in 2375 ms returned []
Implicit Place search using SMT with State Equation took 2942 ms to find 0 implicit places.
[2024-05-24 01:05:20] [INFO ] Redundant transitions in 63 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:05:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:05:20] [INFO ] Invariant cache hit.
[2024-05-24 01:05:20] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:05:41] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 4 ms to minimize.
[2024-05-24 01:05:41] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 3 ms to minimize.
[2024-05-24 01:05:41] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2024-05-24 01:05:41] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-05-24 01:05:42] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-05-24 01:05:42] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-24 01:05:42] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 3 ms to minimize.
[2024-05-24 01:05:42] [INFO ] Deduced a trap composed of 71 places in 204 ms of which 3 ms to minimize.
[2024-05-24 01:05:43] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 3 ms to minimize.
[2024-05-24 01:05:43] [INFO ] Deduced a trap composed of 61 places in 278 ms of which 3 ms to minimize.
[2024-05-24 01:05:43] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 4 ms to minimize.
[2024-05-24 01:05:44] [INFO ] Deduced a trap composed of 24 places in 429 ms of which 7 ms to minimize.
[2024-05-24 01:05:44] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 3 ms to minimize.
[2024-05-24 01:05:44] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 2 ms to minimize.
[2024-05-24 01:05:44] [INFO ] Deduced a trap composed of 54 places in 203 ms of which 2 ms to minimize.
[2024-05-24 01:05:45] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 2 ms to minimize.
[2024-05-24 01:05:45] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 2 ms to minimize.
[2024-05-24 01:05:45] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-24 01:05:47] [INFO ] Deduced a trap composed of 48 places in 319 ms of which 3 ms to minimize.
[2024-05-24 01:05:47] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:05:48] [INFO ] Deduced a trap composed of 76 places in 242 ms of which 3 ms to minimize.
[2024-05-24 01:05:50] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:05:50] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 4 ms to minimize.
[2024-05-24 01:05:50] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:05:51] [INFO ] Deduced a trap composed of 45 places in 305 ms of which 4 ms to minimize.
[2024-05-24 01:05:51] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 3 ms to minimize.
[2024-05-24 01:05:51] [INFO ] Deduced a trap composed of 49 places in 292 ms of which 3 ms to minimize.
SMT process timed out in 31685ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31708ms
Starting structural reductions in SI_LTL mode, iteration 1 : 392/663 places, 2104/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34880 ms. Remains : 392/663 places, 2104/2424 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 287 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-07 finished in 35231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 421 place count 450 transition count 2176
Iterating global reduction 2 with 5 rules applied. Total rules applied 426 place count 450 transition count 2176
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 394 transition count 2120
Applied a total of 538 rules in 155 ms. Remains 394 /663 variables (removed 269) and now considering 2120/2424 (removed 304) transitions.
[2024-05-24 01:05:52] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
// Phase 1: matrix 672 rows 394 cols
[2024-05-24 01:05:52] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 01:06:00] [INFO ] Implicit Places using invariants in 7652 ms returned []
[2024-05-24 01:06:00] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2024-05-24 01:06:00] [INFO ] Invariant cache hit.
[2024-05-24 01:06:00] [INFO ] State equation strengthened by 298 read => feed constraints.
[2024-05-24 01:06:03] [INFO ] Implicit Places using invariants and state equation in 3430 ms returned []
Implicit Place search using SMT with State Equation took 11102 ms to find 0 implicit places.
[2024-05-24 01:06:03] [INFO ] Redundant transitions in 59 ms returned []
Running 2112 sub problems to find dead transitions.
[2024-05-24 01:06:03] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2024-05-24 01:06:03] [INFO ] Invariant cache hit.
[2024-05-24 01:06:03] [INFO ] State equation strengthened by 298 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
[2024-05-24 01:06:30] [INFO ] Deduced a trap composed of 3 places in 505 ms of which 4 ms to minimize.
[2024-05-24 01:06:30] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 3 ms to minimize.
[2024-05-24 01:06:30] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 2 ms to minimize.
[2024-05-24 01:06:30] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:06:30] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-05-24 01:06:30] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2024-05-24 01:06:31] [INFO ] Deduced a trap composed of 43 places in 454 ms of which 19 ms to minimize.
[2024-05-24 01:06:31] [INFO ] Deduced a trap composed of 75 places in 287 ms of which 3 ms to minimize.
[2024-05-24 01:06:33] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 3 ms to minimize.
[2024-05-24 01:06:33] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 4 ms to minimize.
[2024-05-24 01:06:34] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 3 ms to minimize.
[2024-05-24 01:06:34] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 3 ms to minimize.
[2024-05-24 01:06:34] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 3 ms to minimize.
[2024-05-24 01:06:35] [INFO ] Deduced a trap composed of 69 places in 290 ms of which 3 ms to minimize.
SMT process timed out in 31698ms, After SMT, problems are : Problem set: 0 solved, 2112 unsolved
Search for dead transitions found 0 dead transitions in 31724ms
Starting structural reductions in SI_LTL mode, iteration 1 : 394/663 places, 2120/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43068 ms. Remains : 394/663 places, 2120/2424 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 395 ms.
Stack based approach found an accepted trace after 502 steps with 0 reset with depth 503 and stack size 416 in 4 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-09 finished in 43617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p1)&&p0) U X(G(p2))))'
Support contains 8 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 30 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 01:06:35] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-05-24 01:06:35] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 01:06:37] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2024-05-24 01:06:37] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:06:37] [INFO ] Invariant cache hit.
[2024-05-24 01:06:37] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:06:41] [INFO ] Implicit Places using invariants and state equation in 4217 ms returned []
Implicit Place search using SMT with State Equation took 5276 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-05-24 01:06:41] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:06:41] [INFO ] Invariant cache hit.
[2024-05-24 01:06:41] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31608ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31634ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36947 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 591 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2117 steps with 0 reset in 9 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-10 finished in 37602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||(G(!p1) U p0)))))'
Support contains 6 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 49 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 01:07:13] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:07:13] [INFO ] Invariant cache hit.
[2024-05-24 01:07:15] [INFO ] Implicit Places using invariants in 1714 ms returned []
[2024-05-24 01:07:15] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:07:15] [INFO ] Invariant cache hit.
[2024-05-24 01:07:16] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:07:22] [INFO ] Implicit Places using invariants and state equation in 7254 ms returned []
Implicit Place search using SMT with State Equation took 8992 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-05-24 01:07:22] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:07:22] [INFO ] Invariant cache hit.
[2024-05-24 01:07:22] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31796ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31822ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40875 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 833 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 292 ms.
Product exploration explored 100000 steps with 0 reset in 640 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 413 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 767 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
RANDOM walk for 40000 steps (8 resets) in 1015 ms. (39 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 111429 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 4
Probabilistic random walk after 111429 steps, saw 83291 distinct states, run finished after 3003 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-24 01:08:01] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:08:01] [INFO ] Invariant cache hit.
[2024-05-24 01:08:01] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 216/222 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/246 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/307 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:08:02] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 25/332 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:08:02] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 516/848 variables, 332/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/848 variables, 84/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/848 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 88/936 variables, 40/471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/936 variables, 22/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 276/1212 variables, 8/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1212 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 8/1220 variables, 4/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1220 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 356/1576 variables, 284/789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1576 variables, 178/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 967 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2573 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 216/222 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/246 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 61/307 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:08:04] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-05-24 01:08:04] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:08:04] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 25/332 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 516/848 variables, 332/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/848 variables, 84/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/848 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 88/936 variables, 40/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 22/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:08:05] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/936 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/936 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 276/1212 variables, 8/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1212 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 8/1220 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1220 variables, 4/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:08:06] [INFO ] Deduced a trap composed of 3 places in 589 ms of which 5 ms to minimize.
[2024-05-24 01:08:06] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2024-05-24 01:08:06] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-24 01:08:06] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2024-05-24 01:08:07] [INFO ] Deduced a trap composed of 103 places in 303 ms of which 3 ms to minimize.
[2024-05-24 01:08:07] [INFO ] Deduced a trap composed of 20 places in 317 ms of which 4 ms to minimize.
[2024-05-24 01:08:07] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1220 variables, 7/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1220 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 356/1576 variables, 284/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1576 variables, 178/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1576 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/1576 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1576/1576 variables, and 982 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 7612ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3312 ms.
Support contains 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 206 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 392/656 places, 2104/2368 transitions.
RANDOM walk for 40000 steps (8 resets) in 554 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 83556 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 4
Probabilistic random walk after 83556 steps, saw 53768 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-24 01:08:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 01:08:16] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 01:08:16] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/147 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/190 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:08:16] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10/200 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:08:16] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 384/584 variables, 200/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/584 variables, 84/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 88/672 variables, 40/339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/672 variables, 25/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/672 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 143/815 variables, 7/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/815 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/817 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/817 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 7/824 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/824 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 224/1048 variables, 152/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 175/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1287 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 132/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/147 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/190 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:08:17] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-24 01:08:17] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2024-05-24 01:08:17] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 01:08:17] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 10/200 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 384/584 variables, 200/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/584 variables, 84/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 88/672 variables, 40/343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/672 variables, 25/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/672 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 143/815 variables, 7/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/815 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/817 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/817 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 7/824 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/824 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:08:19] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-24 01:08:19] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/824 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/824 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 224/1048 variables, 152/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1048 variables, 175/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:08:20] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1048 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1048 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 0/1048 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 714 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4710 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 6043ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1698 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 75 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 75 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 01:08:23] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:08:23] [INFO ] Invariant cache hit.
[2024-05-24 01:08:24] [INFO ] Implicit Places using invariants in 741 ms returned []
[2024-05-24 01:08:24] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:08:24] [INFO ] Invariant cache hit.
[2024-05-24 01:08:25] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:08:27] [INFO ] Implicit Places using invariants and state equation in 2416 ms returned []
Implicit Place search using SMT with State Equation took 3199 ms to find 0 implicit places.
[2024-05-24 01:08:27] [INFO ] Redundant transitions in 59 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:08:27] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:08:27] [INFO ] Invariant cache hit.
[2024-05-24 01:08:27] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 25 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:09:08] [INFO ] Deduced a trap composed of 3 places in 4352 ms of which 12 ms to minimize.
[2024-05-24 01:09:09] [INFO ] Deduced a trap composed of 3 places in 450 ms of which 3 ms to minimize.
[2024-05-24 01:09:09] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 2 ms to minimize.
[2024-05-24 01:09:09] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 2 ms to minimize.
[2024-05-24 01:09:10] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 1 ms to minimize.
[2024-05-24 01:09:10] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 3 ms to minimize.
[2024-05-24 01:09:11] [INFO ] Deduced a trap composed of 43 places in 617 ms of which 5 ms to minimize.
[2024-05-24 01:09:11] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 3 ms to minimize.
[2024-05-24 01:09:13] [INFO ] Deduced a trap composed of 50 places in 405 ms of which 24 ms to minimize.
[2024-05-24 01:09:14] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 4 ms to minimize.
[2024-05-24 01:09:14] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 3 ms to minimize.
[2024-05-24 01:09:14] [INFO ] Deduced a trap composed of 66 places in 576 ms of which 43 ms to minimize.
[2024-05-24 01:09:15] [INFO ] Deduced a trap composed of 3 places in 547 ms of which 17 ms to minimize.
[2024-05-24 01:09:16] [INFO ] Deduced a trap composed of 31 places in 609 ms of which 8 ms to minimize.
[2024-05-24 01:09:16] [INFO ] Deduced a trap composed of 58 places in 412 ms of which 4 ms to minimize.
[2024-05-24 01:09:17] [INFO ] Deduced a trap composed of 31 places in 511 ms of which 41 ms to minimize.
[2024-05-24 01:09:17] [INFO ] Deduced a trap composed of 45 places in 585 ms of which 50 ms to minimize.
[2024-05-24 01:09:18] [INFO ] Deduced a trap composed of 80 places in 334 ms of which 3 ms to minimize.
[2024-05-24 01:09:18] [INFO ] Deduced a trap composed of 60 places in 275 ms of which 4 ms to minimize.
[2024-05-24 01:09:18] [INFO ] Deduced a trap composed of 79 places in 317 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:09:20] [INFO ] Deduced a trap composed of 75 places in 244 ms of which 3 ms to minimize.
[2024-05-24 01:09:20] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 3 ms to minimize.
[2024-05-24 01:09:22] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 4 ms to minimize.
[2024-05-24 01:09:22] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 3 ms to minimize.
[2024-05-24 01:09:22] [INFO ] Deduced a trap composed of 73 places in 268 ms of which 3 ms to minimize.
[2024-05-24 01:09:23] [INFO ] Deduced a trap composed of 74 places in 310 ms of which 3 ms to minimize.
[2024-05-24 01:09:23] [INFO ] Deduced a trap composed of 46 places in 307 ms of which 3 ms to minimize.
[2024-05-24 01:09:24] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 3 ms to minimize.
[2024-05-24 01:09:24] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 4 ms to minimize.
[2024-05-24 01:09:24] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-24 01:09:25] [INFO ] Deduced a trap composed of 42 places in 340 ms of which 3 ms to minimize.
[2024-05-24 01:09:25] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 4 ms to minimize.
[2024-05-24 01:09:27] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 3 ms to minimize.
[2024-05-24 01:09:27] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 59 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 34/34 constraints]
After SMT, in 61954ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61977ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65339 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1916 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 5 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 336 transition count 411
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 259 transition count 411
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 155 place count 259 transition count 394
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 197 place count 234 transition count 394
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 417 place count 124 transition count 284
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 469 place count 124 transition count 232
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 483 place count 117 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 490 place count 117 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 499 place count 117 transition count 216
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 557 place count 117 transition count 158
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 615 place count 59 transition count 158
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 623 place count 59 transition count 158
Applied a total of 623 rules in 81 ms. Remains 59 /392 variables (removed 333) and now considering 158/2104 (removed 1946) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 158 rows 59 cols
[2024-05-24 01:09:29] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 01:09:29] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-24 01:09:29] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 01:09:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 01:09:29] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 01:09:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 01:09:29] [INFO ] After 94ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 01:09:29] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-24 01:09:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-24 01:09:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-24 01:09:29] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
[2024-05-24 01:09:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
TRAPS : Iteration 1
[2024-05-24 01:09:30] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 01:09:30] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 895 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
Stuttering acceptance computed with spot in 540 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, p1]
[2024-05-24 01:09:31] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
// Phase 1: matrix 920 rows 656 cols
[2024-05-24 01:09:31] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 01:09:34] [INFO ] [Real]Absence check using 17 positive place invariants in 170 ms returned sat
[2024-05-24 01:09:35] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 48 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-08-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-11 finished in 141681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 59 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2024-05-24 01:09:35] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:09:35] [INFO ] Invariant cache hit.
[2024-05-24 01:09:36] [INFO ] Implicit Places using invariants in 854 ms returned []
[2024-05-24 01:09:36] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:09:36] [INFO ] Invariant cache hit.
[2024-05-24 01:09:37] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:09:42] [INFO ] Implicit Places using invariants and state equation in 6331 ms returned []
Implicit Place search using SMT with State Equation took 7201 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2024-05-24 01:09:42] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:09:42] [INFO ] Invariant cache hit.
[2024-05-24 01:09:42] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31686ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31718ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38989 ms. Remains : 656/663 places, 2368/2424 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 283 ms.
Product exploration explored 100000 steps with 0 reset in 414 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 372924 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 372924 steps, saw 261056 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-24 01:10:18] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2024-05-24 01:10:18] [INFO ] Invariant cache hit.
[2024-05-24 01:10:18] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/145 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:10:18] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/170 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:10:18] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 314/484 variables, 170/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 30/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/616 variables, 60/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 22/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/616 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 414/1030 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1030 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1042 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1042 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 534/1576 variables, 426/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1576 variables, 232/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1576 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 967 constraints, problems are : Problem set: 0 solved, 1 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 85/88 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/145 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/170 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 314/484 variables, 170/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 30/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/616 variables, 60/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/616 variables, 22/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/616 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 414/1030 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1030 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1042 variables, 6/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1042 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:10:20] [INFO ] Deduced a trap composed of 3 places in 596 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1042 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:10:20] [INFO ] Deduced a trap composed of 114 places in 538 ms of which 6 ms to minimize.
[2024-05-24 01:10:21] [INFO ] Deduced a trap composed of 142 places in 562 ms of which 6 ms to minimize.
[2024-05-24 01:10:21] [INFO ] Deduced a trap composed of 121 places in 603 ms of which 6 ms to minimize.
[2024-05-24 01:10:22] [INFO ] Deduced a trap composed of 129 places in 527 ms of which 5 ms to minimize.
[2024-05-24 01:10:23] [INFO ] Deduced a trap composed of 130 places in 1219 ms of which 36 ms to minimize.
[2024-05-24 01:10:24] [INFO ] Deduced a trap composed of 135 places in 592 ms of which 5 ms to minimize.
SMT process timed out in 6251ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 182 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 392/656 places, 2104/2368 transitions.
RANDOM walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 336492 steps, run timeout after 3003 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 336492 steps, saw 187519 distinct states, run finished after 3004 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-24 01:10:27] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 01:10:27] [INFO ] Computed 25 invariants in 4 ms
[2024-05-24 01:10:27] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:10:28] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:10:28] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:10:29] [INFO ] Deduced a trap composed of 8 places in 385 ms of which 5 ms to minimize.
[2024-05-24 01:10:29] [INFO ] Deduced a trap composed of 3 places in 422 ms of which 2 ms to minimize.
[2024-05-24 01:10:30] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 3 ms to minimize.
[2024-05-24 01:10:30] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 2 ms to minimize.
[2024-05-24 01:10:30] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 6 ms to minimize.
[2024-05-24 01:10:31] [INFO ] Deduced a trap composed of 3 places in 1103 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 6/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:10:32] [INFO ] Deduced a trap composed of 19 places in 296 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/712 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 336/1048 variables, 228/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 227/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4540 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 5440ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 126 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 144 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 01:10:33] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:10:33] [INFO ] Invariant cache hit.
[2024-05-24 01:10:35] [INFO ] Implicit Places using invariants in 2034 ms returned []
[2024-05-24 01:10:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:10:35] [INFO ] Invariant cache hit.
[2024-05-24 01:10:40] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:10:44] [INFO ] Implicit Places using invariants and state equation in 8495 ms returned []
Implicit Place search using SMT with State Equation took 10542 ms to find 0 implicit places.
[2024-05-24 01:10:44] [INFO ] Redundant transitions in 59 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:10:44] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:10:44] [INFO ] Invariant cache hit.
[2024-05-24 01:10:44] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 31787ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31812ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42572 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 124 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 01:11:16] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 01:11:16] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2024-05-24 01:11:16] [INFO ] After 801ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:11:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 79 ms returned sat
[2024-05-24 01:11:17] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 01:11:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 01:11:17] [INFO ] After 35ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 01:11:17] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 01:11:17] [INFO ] After 1000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1975 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 265 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0)]
Support contains 3 out of 656 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 648 transition count 2160
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 528 place count 392 transition count 2104
Applied a total of 528 rules in 139 ms. Remains 392 /656 variables (removed 264) and now considering 2104/2368 (removed 264) transitions.
[2024-05-24 01:11:18] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 01:11:18] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 01:11:20] [INFO ] Implicit Places using invariants in 1506 ms returned []
[2024-05-24 01:11:20] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:11:20] [INFO ] Invariant cache hit.
[2024-05-24 01:11:21] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:11:32] [INFO ] Implicit Places using invariants and state equation in 11975 ms returned []
Implicit Place search using SMT with State Equation took 13527 ms to find 0 implicit places.
[2024-05-24 01:11:32] [INFO ] Redundant transitions in 65 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:11:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:11:32] [INFO ] Invariant cache hit.
[2024-05-24 01:11:32] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 31851ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31886ms
Starting structural reductions in SI_LTL mode, iteration 1 : 392/656 places, 2104/2368 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45668 ms. Remains : 392/656 places, 2104/2368 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 640 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 402318 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 402318 steps, saw 220609 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
[2024-05-24 01:12:07] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:12:07] [INFO ] Invariant cache hit.
[2024-05-24 01:12:07] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:12:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:12:08] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:12:09] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 3 ms to minimize.
[2024-05-24 01:12:09] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 2 ms to minimize.
[2024-05-24 01:12:09] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-24 01:12:09] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:12:10] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1545 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2360ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 99 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 402732 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 402732 steps, saw 220878 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
[2024-05-24 01:12:13] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:12:13] [INFO ] Invariant cache hit.
[2024-05-24 01:12:13] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:12:13] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:12:13] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 3 ms to minimize.
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 2 ms to minimize.
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:12:15] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1650 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 2505ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 132 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 162 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 01:12:16] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:12:16] [INFO ] Invariant cache hit.
[2024-05-24 01:12:17] [INFO ] Implicit Places using invariants in 773 ms returned []
[2024-05-24 01:12:17] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:12:17] [INFO ] Invariant cache hit.
[2024-05-24 01:12:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:12:19] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 3343 ms to find 0 implicit places.
[2024-05-24 01:12:19] [INFO ] Redundant transitions in 56 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:12:19] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:12:19] [INFO ] Invariant cache hit.
[2024-05-24 01:12:19] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:12:43] [INFO ] Deduced a trap composed of 3 places in 736 ms of which 48 ms to minimize.
[2024-05-24 01:12:43] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 2 ms to minimize.
[2024-05-24 01:12:44] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-05-24 01:12:44] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:12:44] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-24 01:12:44] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 01:12:44] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
[2024-05-24 01:12:45] [INFO ] Deduced a trap composed of 71 places in 385 ms of which 29 ms to minimize.
[2024-05-24 01:12:45] [INFO ] Deduced a trap composed of 124 places in 269 ms of which 3 ms to minimize.
[2024-05-24 01:12:45] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 3 ms to minimize.
[2024-05-24 01:12:47] [INFO ] Deduced a trap composed of 25 places in 1257 ms of which 3 ms to minimize.
[2024-05-24 01:12:47] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 4 ms to minimize.
[2024-05-24 01:12:47] [INFO ] Deduced a trap composed of 62 places in 290 ms of which 3 ms to minimize.
[2024-05-24 01:12:48] [INFO ] Deduced a trap composed of 27 places in 322 ms of which 4 ms to minimize.
[2024-05-24 01:12:48] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 3 ms to minimize.
[2024-05-24 01:12:49] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-24 01:12:49] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-24 01:12:50] [INFO ] Deduced a trap composed of 11 places in 416 ms of which 4 ms to minimize.
[2024-05-24 01:12:50] [INFO ] Deduced a trap composed of 74 places in 336 ms of which 4 ms to minimize.
[2024-05-24 01:12:51] [INFO ] Deduced a trap composed of 61 places in 342 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 45 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:12:56] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 3 ms to minimize.
[2024-05-24 01:12:57] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 3 ms to minimize.
[2024-05-24 01:12:57] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 4 ms to minimize.
[2024-05-24 01:12:57] [INFO ] Deduced a trap composed of 43 places in 292 ms of which 4 ms to minimize.
[2024-05-24 01:12:58] [INFO ] Deduced a trap composed of 54 places in 249 ms of which 3 ms to minimize.
[2024-05-24 01:12:58] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:12:58] [INFO ] Deduced a trap composed of 48 places in 269 ms of which 3 ms to minimize.
[2024-05-24 01:13:00] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 4 ms to minimize.
[2024-05-24 01:13:00] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-05-24 01:13:01] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 01:13:01] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 3 ms to minimize.
[2024-05-24 01:13:02] [INFO ] Deduced a trap composed of 58 places in 256 ms of which 3 ms to minimize.
[2024-05-24 01:13:02] [INFO ] Deduced a trap composed of 73 places in 248 ms of which 3 ms to minimize.
[2024-05-24 01:13:03] [INFO ] Deduced a trap composed of 70 places in 292 ms of which 4 ms to minimize.
[2024-05-24 01:13:03] [INFO ] Deduced a trap composed of 46 places in 492 ms of which 46 ms to minimize.
[2024-05-24 01:13:04] [INFO ] Deduced a trap composed of 79 places in 293 ms of which 3 ms to minimize.
[2024-05-24 01:13:05] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:13:05] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:13:06] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 4 ms to minimize.
[2024-05-24 01:13:07] [INFO ] Deduced a trap composed of 76 places in 272 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:13:11] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 4 ms to minimize.
[2024-05-24 01:13:12] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 67 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 42/42 constraints]
After SMT, in 61447ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65045 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 35 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 01:13:21] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 01:13:21] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 01:13:21] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:13:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 01:13:21] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 01:13:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 01:13:21] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 01:13:21] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 01:13:21] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 281 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 255 ms.
Product exploration explored 100000 steps with 0 reset in 310 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 81 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 01:13:22] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 01:13:22] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 01:13:23] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-24 01:13:23] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:13:23] [INFO ] Invariant cache hit.
[2024-05-24 01:13:23] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:13:25] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 2954 ms to find 0 implicit places.
[2024-05-24 01:13:25] [INFO ] Redundant transitions in 54 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:13:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:13:25] [INFO ] Invariant cache hit.
[2024-05-24 01:13:25] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 25 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:14:02] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 4 ms to minimize.
[2024-05-24 01:14:02] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 2 ms to minimize.
[2024-05-24 01:14:02] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-24 01:14:03] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2024-05-24 01:14:03] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-05-24 01:14:03] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 01:14:03] [INFO ] Deduced a trap composed of 43 places in 241 ms of which 4 ms to minimize.
[2024-05-24 01:14:03] [INFO ] Deduced a trap composed of 67 places in 263 ms of which 3 ms to minimize.
[2024-05-24 01:14:05] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 3 ms to minimize.
[2024-05-24 01:14:05] [INFO ] Deduced a trap composed of 67 places in 241 ms of which 3 ms to minimize.
[2024-05-24 01:14:05] [INFO ] Deduced a trap composed of 50 places in 246 ms of which 3 ms to minimize.
[2024-05-24 01:14:06] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 3 ms to minimize.
[2024-05-24 01:14:06] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 01:14:06] [INFO ] Deduced a trap composed of 31 places in 391 ms of which 4 ms to minimize.
[2024-05-24 01:14:06] [INFO ] Deduced a trap composed of 58 places in 383 ms of which 4 ms to minimize.
[2024-05-24 01:14:07] [INFO ] Deduced a trap composed of 31 places in 530 ms of which 47 ms to minimize.
[2024-05-24 01:14:07] [INFO ] Deduced a trap composed of 45 places in 313 ms of which 3 ms to minimize.
[2024-05-24 01:14:08] [INFO ] Deduced a trap composed of 80 places in 317 ms of which 3 ms to minimize.
[2024-05-24 01:14:08] [INFO ] Deduced a trap composed of 60 places in 460 ms of which 47 ms to minimize.
[2024-05-24 01:14:08] [INFO ] Deduced a trap composed of 79 places in 345 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:14:10] [INFO ] Deduced a trap composed of 75 places in 340 ms of which 5 ms to minimize.
[2024-05-24 01:14:10] [INFO ] Deduced a trap composed of 17 places in 394 ms of which 6 ms to minimize.
[2024-05-24 01:14:12] [INFO ] Deduced a trap composed of 64 places in 354 ms of which 6 ms to minimize.
[2024-05-24 01:14:12] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:14:13] [INFO ] Deduced a trap composed of 73 places in 430 ms of which 4 ms to minimize.
[2024-05-24 01:14:13] [INFO ] Deduced a trap composed of 74 places in 419 ms of which 7 ms to minimize.
[2024-05-24 01:14:14] [INFO ] Deduced a trap composed of 46 places in 299 ms of which 4 ms to minimize.
[2024-05-24 01:14:14] [INFO ] Deduced a trap composed of 71 places in 276 ms of which 3 ms to minimize.
[2024-05-24 01:14:15] [INFO ] Deduced a trap composed of 71 places in 257 ms of which 3 ms to minimize.
[2024-05-24 01:14:15] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-24 01:14:15] [INFO ] Deduced a trap composed of 42 places in 333 ms of which 4 ms to minimize.
[2024-05-24 01:14:16] [INFO ] Deduced a trap composed of 46 places in 272 ms of which 3 ms to minimize.
[2024-05-24 01:14:20] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 3 ms to minimize.
[2024-05-24 01:14:21] [INFO ] Deduced a trap composed of 64 places in 380 ms of which 3 ms to minimize.
[2024-05-24 01:14:23] [INFO ] Deduced a trap composed of 70 places in 441 ms of which 48 ms to minimize.
[2024-05-24 01:14:25] [INFO ] Deduced a trap composed of 73 places in 1821 ms of which 4 ms to minimize.
[2024-05-24 01:14:26] [INFO ] Deduced a trap composed of 57 places in 369 ms of which 7 ms to minimize.
[2024-05-24 01:14:26] [INFO ] Deduced a trap composed of 43 places in 480 ms of which 20 ms to minimize.
[2024-05-24 01:14:26] [INFO ] Deduced a trap composed of 45 places in 262 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 64 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 39/39 constraints]
After SMT, in 61422ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 61446ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64547 ms. Remains : 392/392 places, 2104/2104 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 292411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(p2)||p1)))))'
Support contains 6 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 655 transition count 2218
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 457 transition count 2218
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 450 transition count 2162
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 450 transition count 2162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 394 transition count 2106
Applied a total of 538 rules in 163 ms. Remains 394 /663 variables (removed 269) and now considering 2106/2424 (removed 318) transitions.
[2024-05-24 01:14:27] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-05-24 01:14:27] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 01:14:28] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-24 01:14:28] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:14:28] [INFO ] Invariant cache hit.
[2024-05-24 01:14:28] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:14:30] [INFO ] Implicit Places using invariants and state equation in 2360 ms returned []
Implicit Place search using SMT with State Equation took 2973 ms to find 0 implicit places.
[2024-05-24 01:14:30] [INFO ] Redundant transitions in 63 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-05-24 01:14:30] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:14:30] [INFO ] Invariant cache hit.
[2024-05-24 01:14:30] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:14:55] [INFO ] Deduced a trap composed of 3 places in 485 ms of which 5 ms to minimize.
[2024-05-24 01:14:55] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 3 ms to minimize.
[2024-05-24 01:14:55] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 2 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 2 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 2 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 01:14:56] [INFO ] Deduced a trap composed of 60 places in 384 ms of which 8 ms to minimize.
[2024-05-24 01:14:58] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 3 ms to minimize.
[2024-05-24 01:14:58] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 3 ms to minimize.
[2024-05-24 01:14:59] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 3 ms to minimize.
[2024-05-24 01:14:59] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 3 ms to minimize.
[2024-05-24 01:14:59] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 4 ms to minimize.
[2024-05-24 01:15:00] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-24 01:15:00] [INFO ] Deduced a trap composed of 43 places in 259 ms of which 4 ms to minimize.
[2024-05-24 01:15:00] [INFO ] Deduced a trap composed of 76 places in 288 ms of which 3 ms to minimize.
[2024-05-24 01:15:01] [INFO ] Deduced a trap composed of 61 places in 251 ms of which 3 ms to minimize.
[2024-05-24 01:15:01] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 01:15:01] [INFO ] Deduced a trap composed of 29 places in 364 ms of which 4 ms to minimize.
[2024-05-24 01:15:02] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 45 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:15:07] [INFO ] Deduced a trap composed of 70 places in 288 ms of which 3 ms to minimize.
[2024-05-24 01:15:08] [INFO ] Deduced a trap composed of 30 places in 355 ms of which 4 ms to minimize.
[2024-05-24 01:15:08] [INFO ] Deduced a trap composed of 62 places in 371 ms of which 22 ms to minimize.
[2024-05-24 01:15:08] [INFO ] Deduced a trap composed of 27 places in 331 ms of which 3 ms to minimize.
[2024-05-24 01:15:09] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 3 ms to minimize.
[2024-05-24 01:15:09] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 4 ms to minimize.
[2024-05-24 01:15:09] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 01:15:10] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-24 01:15:10] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-24 01:15:10] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-24 01:15:10] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:15:10] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-24 01:15:11] [INFO ] Deduced a trap composed of 62 places in 281 ms of which 4 ms to minimize.
[2024-05-24 01:15:11] [INFO ] Deduced a trap composed of 64 places in 290 ms of which 4 ms to minimize.
[2024-05-24 01:15:12] [INFO ] Deduced a trap composed of 65 places in 267 ms of which 3 ms to minimize.
[2024-05-24 01:15:12] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 3 ms to minimize.
[2024-05-24 01:15:12] [INFO ] Deduced a trap composed of 73 places in 287 ms of which 3 ms to minimize.
[2024-05-24 01:15:12] [INFO ] Deduced a trap composed of 87 places in 288 ms of which 3 ms to minimize.
[2024-05-24 01:15:13] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 3 ms to minimize.
[2024-05-24 01:15:13] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:15:21] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 3 ms to minimize.
[2024-05-24 01:15:21] [INFO ] Deduced a trap composed of 64 places in 254 ms of which 3 ms to minimize.
[2024-05-24 01:15:21] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-24 01:15:23] [INFO ] Deduced a trap composed of 69 places in 247 ms of which 3 ms to minimize.
[2024-05-24 01:15:24] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 3 ms to minimize.
[2024-05-24 01:15:24] [INFO ] Deduced a trap composed of 80 places in 283 ms of which 4 ms to minimize.
[2024-05-24 01:15:24] [INFO ] Deduced a trap composed of 82 places in 346 ms of which 4 ms to minimize.
[2024-05-24 01:15:25] [INFO ] Deduced a trap composed of 70 places in 280 ms of which 4 ms to minimize.
[2024-05-24 01:15:25] [INFO ] Deduced a trap composed of 61 places in 271 ms of which 3 ms to minimize.
[2024-05-24 01:15:25] [INFO ] Deduced a trap composed of 71 places in 271 ms of which 3 ms to minimize.
[2024-05-24 01:15:26] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 3 ms to minimize.
[2024-05-24 01:15:26] [INFO ] Deduced a trap composed of 50 places in 268 ms of which 4 ms to minimize.
[2024-05-24 01:15:27] [INFO ] Deduced a trap composed of 83 places in 302 ms of which 3 ms to minimize.
[2024-05-24 01:15:27] [INFO ] Deduced a trap composed of 75 places in 295 ms of which 4 ms to minimize.
[2024-05-24 01:15:28] [INFO ] Deduced a trap composed of 58 places in 262 ms of which 3 ms to minimize.
[2024-05-24 01:15:28] [INFO ] Deduced a trap composed of 46 places in 303 ms of which 3 ms to minimize.
[2024-05-24 01:15:29] [INFO ] Deduced a trap composed of 48 places in 285 ms of which 3 ms to minimize.
[2024-05-24 01:15:29] [INFO ] Deduced a trap composed of 98 places in 262 ms of which 3 ms to minimize.
[2024-05-24 01:15:30] [INFO ] Deduced a trap composed of 78 places in 250 ms of which 3 ms to minimize.
[2024-05-24 01:15:30] [INFO ] Deduced a trap composed of 66 places in 296 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1052 variables, and 85 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2098 constraints, Known Traps: 60/60 constraints]
After SMT, in 61486ms problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 61510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 394/663 places, 2106/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64731 ms. Remains : 394/663 places, 2106/2424 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 317 ms.
Product exploration explored 100000 steps with 0 reset in 382 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0)), (X p2), (X (NOT (OR (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (AND p2 p0)), (X p0), (X p1), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT (OR (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (AND p2 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 130 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 468 ms. (85 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
[2024-05-24 01:15:33] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:15:33] [INFO ] Invariant cache hit.
[2024-05-24 01:15:33] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:15:34] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:15:34] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:15:35] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-05-24 01:15:35] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 2 ms to minimize.
[2024-05-24 01:15:35] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
[2024-05-24 01:15:36] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 2 ms to minimize.
[2024-05-24 01:15:36] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:15:36] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 01:15:36] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 2 ms to minimize.
[2024-05-24 01:15:36] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 717 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2664 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 3450ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1193 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 70 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 394/394 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 1013 ms. (39 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 121446 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 121446 steps, saw 76641 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-24 01:15:42] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:15:42] [INFO ] Invariant cache hit.
[2024-05-24 01:15:42] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 820 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:15:43] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:15:43] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:15:43] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 2 ms to minimize.
[2024-05-24 01:15:44] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:15:44] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2024-05-24 01:15:44] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 2 ms to minimize.
[2024-05-24 01:15:44] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-05-24 01:15:44] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 01:15:44] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 2 ms to minimize.
[2024-05-24 01:15:44] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/515 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 717 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2678 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 3515ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1245 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 70 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 69 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 01:15:46] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:15:46] [INFO ] Invariant cache hit.
[2024-05-24 01:15:47] [INFO ] Implicit Places using invariants in 727 ms returned []
[2024-05-24 01:15:47] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:15:47] [INFO ] Invariant cache hit.
[2024-05-24 01:15:48] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:15:49] [INFO ] Implicit Places using invariants and state equation in 2304 ms returned []
Implicit Place search using SMT with State Equation took 3033 ms to find 0 implicit places.
[2024-05-24 01:15:50] [INFO ] Redundant transitions in 55 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-05-24 01:15:50] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:15:50] [INFO ] Invariant cache hit.
[2024-05-24 01:15:50] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:16:12] [INFO ] Deduced a trap composed of 3 places in 741 ms of which 25 ms to minimize.
[2024-05-24 01:16:13] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 2 ms to minimize.
[2024-05-24 01:16:13] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 2 ms to minimize.
[2024-05-24 01:16:13] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:16:13] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:16:13] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-05-24 01:16:13] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 01:16:14] [INFO ] Deduced a trap composed of 60 places in 374 ms of which 37 ms to minimize.
[2024-05-24 01:16:15] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:16:16] [INFO ] Deduced a trap composed of 44 places in 263 ms of which 4 ms to minimize.
[2024-05-24 01:16:16] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 3 ms to minimize.
[2024-05-24 01:16:16] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 3 ms to minimize.
[2024-05-24 01:16:17] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 3 ms to minimize.
[2024-05-24 01:16:17] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2024-05-24 01:16:17] [INFO ] Deduced a trap composed of 43 places in 409 ms of which 5 ms to minimize.
[2024-05-24 01:16:18] [INFO ] Deduced a trap composed of 76 places in 238 ms of which 3 ms to minimize.
[2024-05-24 01:16:18] [INFO ] Deduced a trap composed of 61 places in 381 ms of which 14 ms to minimize.
[2024-05-24 01:16:18] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2024-05-24 01:16:19] [INFO ] Deduced a trap composed of 29 places in 460 ms of which 14 ms to minimize.
[2024-05-24 01:16:19] [INFO ] Deduced a trap composed of 16 places in 275 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 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 394/1052 variables, and 45 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:16:26] [INFO ] Deduced a trap composed of 70 places in 358 ms of which 4 ms to minimize.
[2024-05-24 01:16:26] [INFO ] Deduced a trap composed of 30 places in 315 ms of which 4 ms to minimize.
[2024-05-24 01:16:26] [INFO ] Deduced a trap composed of 62 places in 221 ms of which 3 ms to minimize.
[2024-05-24 01:16:26] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 3 ms to minimize.
[2024-05-24 01:16:27] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 4 ms to minimize.
[2024-05-24 01:16:27] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 3 ms to minimize.
[2024-05-24 01:16:27] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 01:16:28] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-24 01:16:28] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-24 01:16:28] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-24 01:16:29] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-24 01:16:29] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-24 01:16:29] [INFO ] Deduced a trap composed of 62 places in 284 ms of which 4 ms to minimize.
[2024-05-24 01:16:30] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 3 ms to minimize.
[2024-05-24 01:16:30] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-24 01:16:30] [INFO ] Deduced a trap composed of 62 places in 244 ms of which 3 ms to minimize.
[2024-05-24 01:16:30] [INFO ] Deduced a trap composed of 73 places in 290 ms of which 3 ms to minimize.
[2024-05-24 01:16:31] [INFO ] Deduced a trap composed of 87 places in 306 ms of which 4 ms to minimize.
[2024-05-24 01:16:31] [INFO ] Deduced a trap composed of 34 places in 271 ms of which 3 ms to minimize.
[2024-05-24 01:16:31] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:16:39] [INFO ] Deduced a trap composed of 61 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:16:39] [INFO ] Deduced a trap composed of 64 places in 257 ms of which 3 ms to minimize.
[2024-05-24 01:16:39] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-24 01:16:41] [INFO ] Deduced a trap composed of 69 places in 253 ms of which 3 ms to minimize.
[2024-05-24 01:16:42] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 3 ms to minimize.
[2024-05-24 01:16:42] [INFO ] Deduced a trap composed of 80 places in 283 ms of which 3 ms to minimize.
[2024-05-24 01:16:42] [INFO ] Deduced a trap composed of 82 places in 282 ms of which 4 ms to minimize.
[2024-05-24 01:16:43] [INFO ] Deduced a trap composed of 70 places in 284 ms of which 4 ms to minimize.
[2024-05-24 01:16:43] [INFO ] Deduced a trap composed of 61 places in 278 ms of which 4 ms to minimize.
[2024-05-24 01:16:43] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 3 ms to minimize.
[2024-05-24 01:16:44] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 3 ms to minimize.
[2024-05-24 01:16:44] [INFO ] Deduced a trap composed of 50 places in 271 ms of which 3 ms to minimize.
[2024-05-24 01:16:45] [INFO ] Deduced a trap composed of 83 places in 306 ms of which 4 ms to minimize.
[2024-05-24 01:16:45] [INFO ] Deduced a trap composed of 75 places in 308 ms of which 4 ms to minimize.
[2024-05-24 01:16:46] [INFO ] Deduced a trap composed of 58 places in 308 ms of which 4 ms to minimize.
[2024-05-24 01:16:46] [INFO ] Deduced a trap composed of 46 places in 306 ms of which 7 ms to minimize.
[2024-05-24 01:16:46] [INFO ] Deduced a trap composed of 48 places in 288 ms of which 4 ms to minimize.
[2024-05-24 01:16:47] [INFO ] Deduced a trap composed of 98 places in 273 ms of which 3 ms to minimize.
[2024-05-24 01:16:48] [INFO ] Deduced a trap composed of 78 places in 258 ms of which 3 ms to minimize.
[2024-05-24 01:16:48] [INFO ] Deduced a trap composed of 66 places in 294 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:16:51] [INFO ] Deduced a trap composed of 76 places in 239 ms of which 3 ms to minimize.
[2024-05-24 01:16:51] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 3 ms to minimize.
SMT process timed out in 61459ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 61483ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64650 ms. Remains : 394/394 places, 2106/2106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1934 edges and 394 vertex of which 64 / 394 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 338 transition count 413
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 261 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 157 place count 260 transition count 395
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 199 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 417 place count 126 transition count 286
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 471 place count 126 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 487 place count 118 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 495 place count 118 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 503 place count 118 transition count 216
Free-agglomeration rule applied 55 times.
Iterating global reduction 5 with 55 rules applied. Total rules applied 558 place count 118 transition count 161
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 613 place count 63 transition count 161
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 620 place count 63 transition count 161
Applied a total of 620 rules in 33 ms. Remains 63 /394 variables (removed 331) and now considering 161/2106 (removed 1945) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 161 rows 63 cols
[2024-05-24 01:16:51] [INFO ] Computed 17 invariants in 1 ms
[2024-05-24 01:16:51] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 01:16:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 01:16:51] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 01:16:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 01:16:51] [INFO ] After 41ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 01:16:51] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 01:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-24 01:16:51] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 01:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
TRAPS : Iteration 1
[2024-05-24 01:16:51] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 01:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
TRAPS : Iteration 2
[2024-05-24 01:16:52] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 01:16:52] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 546 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0)), (X p2), (X (NOT (OR (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (AND p2 p0)), (X p0), (X p1), (X (X (AND p1 p0))), (X (X p2)), (X (X (NOT (OR (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p1)) (NOT p0))))), (X (X (AND p2 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 17 factoid took 225 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 71 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 01:16:52] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-05-24 01:16:52] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 01:16:53] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-24 01:16:53] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:16:53] [INFO ] Invariant cache hit.
[2024-05-24 01:16:53] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:16:55] [INFO ] Implicit Places using invariants and state equation in 2274 ms returned []
Implicit Place search using SMT with State Equation took 2931 ms to find 0 implicit places.
[2024-05-24 01:16:55] [INFO ] Redundant transitions in 55 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-05-24 01:16:55] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:16:55] [INFO ] Invariant cache hit.
[2024-05-24 01:16:55] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:17:16] [INFO ] Deduced a trap composed of 3 places in 440 ms of which 4 ms to minimize.
[2024-05-24 01:17:17] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 3 ms to minimize.
[2024-05-24 01:17:17] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 2 ms to minimize.
[2024-05-24 01:17:17] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-05-24 01:17:17] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-05-24 01:17:17] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-24 01:17:17] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 01:17:18] [INFO ] Deduced a trap composed of 60 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:17:19] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 3 ms to minimize.
[2024-05-24 01:17:19] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 3 ms to minimize.
[2024-05-24 01:17:20] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 3 ms to minimize.
[2024-05-24 01:17:20] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 5 ms to minimize.
[2024-05-24 01:17:20] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 4 ms to minimize.
[2024-05-24 01:17:20] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-24 01:17:21] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 3 ms to minimize.
[2024-05-24 01:17:21] [INFO ] Deduced a trap composed of 76 places in 255 ms of which 4 ms to minimize.
[2024-05-24 01:17:21] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 3 ms to minimize.
[2024-05-24 01:17:22] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 01:17:22] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 4 ms to minimize.
[2024-05-24 01:17:22] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 45 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:17:30] [INFO ] Deduced a trap composed of 70 places in 224 ms of which 3 ms to minimize.
[2024-05-24 01:17:30] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 3 ms to minimize.
[2024-05-24 01:17:31] [INFO ] Deduced a trap composed of 62 places in 225 ms of which 3 ms to minimize.
[2024-05-24 01:17:31] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 4 ms to minimize.
[2024-05-24 01:17:31] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 3 ms to minimize.
[2024-05-24 01:17:31] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 3 ms to minimize.
[2024-05-24 01:17:32] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 01:17:33] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-24 01:17:33] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-24 01:17:33] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-24 01:17:33] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-24 01:17:33] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-24 01:17:34] [INFO ] Deduced a trap composed of 62 places in 276 ms of which 3 ms to minimize.
[2024-05-24 01:17:34] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 3 ms to minimize.
[2024-05-24 01:17:34] [INFO ] Deduced a trap composed of 65 places in 261 ms of which 3 ms to minimize.
[2024-05-24 01:17:34] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 3 ms to minimize.
[2024-05-24 01:17:35] [INFO ] Deduced a trap composed of 73 places in 288 ms of which 3 ms to minimize.
[2024-05-24 01:17:35] [INFO ] Deduced a trap composed of 87 places in 292 ms of which 3 ms to minimize.
[2024-05-24 01:17:35] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 3 ms to minimize.
[2024-05-24 01:17:35] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:17:43] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 3 ms to minimize.
[2024-05-24 01:17:43] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 3 ms to minimize.
[2024-05-24 01:17:43] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-24 01:17:45] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 3 ms to minimize.
[2024-05-24 01:17:46] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 3 ms to minimize.
[2024-05-24 01:17:46] [INFO ] Deduced a trap composed of 80 places in 280 ms of which 3 ms to minimize.
[2024-05-24 01:17:46] [INFO ] Deduced a trap composed of 82 places in 283 ms of which 4 ms to minimize.
[2024-05-24 01:17:47] [INFO ] Deduced a trap composed of 70 places in 260 ms of which 4 ms to minimize.
[2024-05-24 01:17:47] [INFO ] Deduced a trap composed of 61 places in 285 ms of which 3 ms to minimize.
[2024-05-24 01:17:47] [INFO ] Deduced a trap composed of 71 places in 285 ms of which 4 ms to minimize.
[2024-05-24 01:17:48] [INFO ] Deduced a trap composed of 63 places in 247 ms of which 4 ms to minimize.
[2024-05-24 01:17:48] [INFO ] Deduced a trap composed of 50 places in 280 ms of which 4 ms to minimize.
[2024-05-24 01:17:49] [INFO ] Deduced a trap composed of 83 places in 314 ms of which 4 ms to minimize.
[2024-05-24 01:17:49] [INFO ] Deduced a trap composed of 75 places in 329 ms of which 4 ms to minimize.
[2024-05-24 01:17:50] [INFO ] Deduced a trap composed of 58 places in 260 ms of which 4 ms to minimize.
[2024-05-24 01:17:50] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 4 ms to minimize.
[2024-05-24 01:17:51] [INFO ] Deduced a trap composed of 48 places in 312 ms of which 4 ms to minimize.
[2024-05-24 01:17:52] [INFO ] Deduced a trap composed of 98 places in 276 ms of which 3 ms to minimize.
[2024-05-24 01:17:52] [INFO ] Deduced a trap composed of 78 places in 276 ms of which 3 ms to minimize.
[2024-05-24 01:17:52] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:17:55] [INFO ] Deduced a trap composed of 76 places in 231 ms of which 4 ms to minimize.
[2024-05-24 01:17:55] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 3 ms to minimize.
[2024-05-24 01:17:56] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 3 ms to minimize.
[2024-05-24 01:17:56] [INFO ] Deduced a trap composed of 72 places in 287 ms of which 3 ms to minimize.
[2024-05-24 01:17:56] [INFO ] Deduced a trap composed of 60 places in 284 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1052 variables, and 90 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2098 constraints, Known Traps: 65/65 constraints]
After SMT, in 61337ms problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 61359ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64426 ms. Remains : 394/394 places, 2106/2106 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p1)), (X (AND p0 p2)), (X p0), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X p2)), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 128 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8 resets) in 1190 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
[2024-05-24 01:17:57] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:17:57] [INFO ] Invariant cache hit.
[2024-05-24 01:17:57] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:17:58] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-24 01:17:58] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:17:59] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:17:59] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-24 01:17:59] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-24 01:17:59] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 01:17:59] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 2 ms to minimize.
[2024-05-24 01:18:00] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 715 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2158 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 2985ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1382 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 68 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 394/394 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 1111 ms. (35 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 119259 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 4
Probabilistic random walk after 119259 steps, saw 75447 distinct states, run finished after 3010 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-24 01:18:05] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:18:05] [INFO ] Invariant cache hit.
[2024-05-24 01:18:05] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 318/472 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 52/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 110/582 variables, 50/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 30/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/762 variables, 10/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/772 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 280/1052 variables, 190/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 202/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/144 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:18:06] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-24 01:18:06] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:18:07] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 318/472 variables, 154/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 52/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/582 variables, 50/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 30/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/762 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/772 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:18:07] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2024-05-24 01:18:07] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-24 01:18:07] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 01:18:08] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 2 ms to minimize.
[2024-05-24 01:18:08] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1052 variables, 190/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 202/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 715 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2194 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 3021ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 895 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 70 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 68 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 01:18:09] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:18:09] [INFO ] Invariant cache hit.
[2024-05-24 01:18:10] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-24 01:18:10] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:18:10] [INFO ] Invariant cache hit.
[2024-05-24 01:18:10] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:18:12] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 2957 ms to find 0 implicit places.
[2024-05-24 01:18:12] [INFO ] Redundant transitions in 58 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-05-24 01:18:12] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:18:12] [INFO ] Invariant cache hit.
[2024-05-24 01:18:12] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:18:34] [INFO ] Deduced a trap composed of 3 places in 481 ms of which 4 ms to minimize.
[2024-05-24 01:18:34] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 2 ms to minimize.
[2024-05-24 01:18:35] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 2 ms to minimize.
[2024-05-24 01:18:35] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-05-24 01:18:35] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:18:35] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 01:18:35] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-24 01:18:35] [INFO ] Deduced a trap composed of 60 places in 197 ms of which 2 ms to minimize.
[2024-05-24 01:18:37] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 3 ms to minimize.
[2024-05-24 01:18:37] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 3 ms to minimize.
[2024-05-24 01:18:37] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-05-24 01:18:38] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 4 ms to minimize.
[2024-05-24 01:18:38] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:18:38] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-24 01:18:39] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 3 ms to minimize.
[2024-05-24 01:18:39] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 3 ms to minimize.
[2024-05-24 01:18:39] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 3 ms to minimize.
[2024-05-24 01:18:39] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 01:18:40] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 3 ms to minimize.
[2024-05-24 01:18:40] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 45 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:18:48] [INFO ] Deduced a trap composed of 70 places in 230 ms of which 3 ms to minimize.
[2024-05-24 01:18:48] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 4 ms to minimize.
[2024-05-24 01:18:48] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 3 ms to minimize.
[2024-05-24 01:18:49] [INFO ] Deduced a trap composed of 27 places in 354 ms of which 3 ms to minimize.
[2024-05-24 01:18:49] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 3 ms to minimize.
[2024-05-24 01:18:49] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 3 ms to minimize.
[2024-05-24 01:18:49] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 01:18:50] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-24 01:18:50] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-24 01:18:51] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-24 01:18:51] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-05-24 01:18:51] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-24 01:18:51] [INFO ] Deduced a trap composed of 62 places in 278 ms of which 3 ms to minimize.
[2024-05-24 01:18:52] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 3 ms to minimize.
[2024-05-24 01:18:52] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-05-24 01:18:52] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 3 ms to minimize.
[2024-05-24 01:18:52] [INFO ] Deduced a trap composed of 73 places in 298 ms of which 3 ms to minimize.
[2024-05-24 01:18:53] [INFO ] Deduced a trap composed of 87 places in 301 ms of which 3 ms to minimize.
[2024-05-24 01:18:53] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 3 ms to minimize.
[2024-05-24 01:18:53] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
[2024-05-24 01:19:01] [INFO ] Deduced a trap composed of 61 places in 285 ms of which 3 ms to minimize.
[2024-05-24 01:19:01] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 3 ms to minimize.
[2024-05-24 01:19:01] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2024-05-24 01:19:04] [INFO ] Deduced a trap composed of 69 places in 311 ms of which 3 ms to minimize.
[2024-05-24 01:19:04] [INFO ] Deduced a trap composed of 64 places in 349 ms of which 7 ms to minimize.
[2024-05-24 01:19:05] [INFO ] Deduced a trap composed of 80 places in 440 ms of which 21 ms to minimize.
[2024-05-24 01:19:05] [INFO ] Deduced a trap composed of 82 places in 285 ms of which 3 ms to minimize.
[2024-05-24 01:19:05] [INFO ] Deduced a trap composed of 70 places in 350 ms of which 3 ms to minimize.
[2024-05-24 01:19:06] [INFO ] Deduced a trap composed of 61 places in 287 ms of which 3 ms to minimize.
[2024-05-24 01:19:06] [INFO ] Deduced a trap composed of 71 places in 325 ms of which 4 ms to minimize.
[2024-05-24 01:19:06] [INFO ] Deduced a trap composed of 63 places in 372 ms of which 3 ms to minimize.
[2024-05-24 01:19:07] [INFO ] Deduced a trap composed of 50 places in 315 ms of which 3 ms to minimize.
[2024-05-24 01:19:08] [INFO ] Deduced a trap composed of 83 places in 501 ms of which 8 ms to minimize.
[2024-05-24 01:19:09] [INFO ] Deduced a trap composed of 75 places in 314 ms of which 4 ms to minimize.
[2024-05-24 01:19:09] [INFO ] Deduced a trap composed of 58 places in 299 ms of which 4 ms to minimize.
[2024-05-24 01:19:09] [INFO ] Deduced a trap composed of 46 places in 493 ms of which 24 ms to minimize.
[2024-05-24 01:19:10] [INFO ] Deduced a trap composed of 48 places in 512 ms of which 39 ms to minimize.
[2024-05-24 01:19:11] [INFO ] Deduced a trap composed of 98 places in 591 ms of which 48 ms to minimize.
[2024-05-24 01:19:12] [INFO ] Deduced a trap composed of 78 places in 311 ms of which 6 ms to minimize.
[2024-05-24 01:19:12] [INFO ] Deduced a trap composed of 66 places in 347 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1052 variables, and 85 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2098 constraints, Known Traps: 60/60 constraints]
After SMT, in 61491ms problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 61516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64613 ms. Remains : 394/394 places, 2106/2106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1934 edges and 394 vertex of which 64 / 394 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 338 transition count 413
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 261 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 157 place count 260 transition count 395
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 199 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 417 place count 126 transition count 286
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 471 place count 126 transition count 232
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 487 place count 118 transition count 232
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 495 place count 118 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 503 place count 118 transition count 216
Free-agglomeration rule applied 55 times.
Iterating global reduction 5 with 55 rules applied. Total rules applied 558 place count 118 transition count 161
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 613 place count 63 transition count 161
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 620 place count 63 transition count 161
Applied a total of 620 rules in 21 ms. Remains 63 /394 variables (removed 331) and now considering 161/2106 (removed 1945) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 161 rows 63 cols
[2024-05-24 01:19:14] [INFO ] Computed 17 invariants in 0 ms
[2024-05-24 01:19:14] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 01:19:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 01:19:14] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 01:19:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 01:19:14] [INFO ] After 41ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 01:19:14] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
[2024-05-24 01:19:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-24 01:19:14] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-24 01:19:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 95 ms
TRAPS : Iteration 1
[2024-05-24 01:19:14] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 01:19:14] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 518 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p1)), (X (AND p0 p2)), (X p0), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X p2)), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 282 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 313 ms.
Product exploration explored 100000 steps with 0 reset in 386 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 72 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2024-05-24 01:19:16] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2024-05-24 01:19:16] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 01:19:17] [INFO ] Implicit Places using invariants in 761 ms returned []
[2024-05-24 01:19:17] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:19:17] [INFO ] Invariant cache hit.
[2024-05-24 01:19:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:19:19] [INFO ] Implicit Places using invariants and state equation in 2434 ms returned []
Implicit Place search using SMT with State Equation took 3196 ms to find 0 implicit places.
[2024-05-24 01:19:19] [INFO ] Redundant transitions in 55 ms returned []
Running 2098 sub problems to find dead transitions.
[2024-05-24 01:19:19] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2024-05-24 01:19:19] [INFO ] Invariant cache hit.
[2024-05-24 01:19:19] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
SMT process timed out in 31364ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 31388ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34721 ms. Remains : 394/394 places, 2106/2106 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-13 finished in 323485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(p1)))||p0))))'
Support contains 5 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 135 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2024-05-24 01:19:51] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 01:19:51] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 01:19:51] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-24 01:19:51] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:19:51] [INFO ] Invariant cache hit.
[2024-05-24 01:19:52] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 01:19:54] [INFO ] Implicit Places using invariants and state equation in 2902 ms returned []
Implicit Place search using SMT with State Equation took 3612 ms to find 0 implicit places.
[2024-05-24 01:19:54] [INFO ] Redundant transitions in 80 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 01:19:54] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:19:55] [INFO ] Invariant cache hit.
[2024-05-24 01:19:55] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:20:24] [INFO ] Deduced a trap composed of 3 places in 362 ms of which 4 ms to minimize.
[2024-05-24 01:20:24] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 2 ms to minimize.
[2024-05-24 01:20:25] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-05-24 01:20:25] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2024-05-24 01:20:25] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-24 01:20:25] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 01:20:25] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 3 ms to minimize.
[2024-05-24 01:20:26] [INFO ] Deduced a trap composed of 77 places in 296 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1057 variables, and 33 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:20:30] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 3 ms to minimize.
[2024-05-24 01:20:30] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 3 ms to minimize.
[2024-05-24 01:20:30] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 3 ms to minimize.
[2024-05-24 01:20:31] [INFO ] Deduced a trap composed of 59 places in 335 ms of which 3 ms to minimize.
[2024-05-24 01:20:31] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 3 ms to minimize.
[2024-05-24 01:20:31] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 3 ms to minimize.
[2024-05-24 01:20:31] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2024-05-24 01:20:32] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-24 01:20:33] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-24 01:20:33] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 3 ms to minimize.
[2024-05-24 01:20:33] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:20:33] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2024-05-24 01:20:34] [INFO ] Deduced a trap composed of 64 places in 286 ms of which 4 ms to minimize.
[2024-05-24 01:20:34] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 3 ms to minimize.
[2024-05-24 01:20:34] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 4 ms to minimize.
[2024-05-24 01:20:35] [INFO ] Deduced a trap composed of 38 places in 553 ms of which 48 ms to minimize.
[2024-05-24 01:20:35] [INFO ] Deduced a trap composed of 64 places in 467 ms of which 8 ms to minimize.
[2024-05-24 01:20:36] [INFO ] Deduced a trap composed of 45 places in 586 ms of which 49 ms to minimize.
[2024-05-24 01:20:37] [INFO ] Deduced a trap composed of 76 places in 391 ms of which 3 ms to minimize.
[2024-05-24 01:20:37] [INFO ] Deduced a trap composed of 72 places in 378 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:20:44] [INFO ] Deduced a trap composed of 54 places in 367 ms of which 32 ms to minimize.
[2024-05-24 01:20:44] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 3 ms to minimize.
[2024-05-24 01:20:44] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:20:45] [INFO ] Deduced a trap composed of 56 places in 430 ms of which 51 ms to minimize.
[2024-05-24 01:20:45] [INFO ] Deduced a trap composed of 52 places in 266 ms of which 4 ms to minimize.
[2024-05-24 01:20:46] [INFO ] Deduced a trap composed of 74 places in 219 ms of which 3 ms to minimize.
[2024-05-24 01:20:46] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 4 ms to minimize.
[2024-05-24 01:20:46] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 3 ms to minimize.
[2024-05-24 01:20:46] [INFO ] Deduced a trap composed of 51 places in 251 ms of which 3 ms to minimize.
[2024-05-24 01:20:47] [INFO ] Deduced a trap composed of 49 places in 326 ms of which 3 ms to minimize.
[2024-05-24 01:20:47] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 3 ms to minimize.
[2024-05-24 01:20:48] [INFO ] Deduced a trap composed of 50 places in 364 ms of which 4 ms to minimize.
[2024-05-24 01:20:48] [INFO ] Deduced a trap composed of 70 places in 586 ms of which 49 ms to minimize.
[2024-05-24 01:20:49] [INFO ] Deduced a trap composed of 68 places in 510 ms of which 37 ms to minimize.
[2024-05-24 01:20:49] [INFO ] Deduced a trap composed of 61 places in 291 ms of which 3 ms to minimize.
[2024-05-24 01:20:49] [INFO ] Deduced a trap composed of 50 places in 329 ms of which 3 ms to minimize.
[2024-05-24 01:20:50] [INFO ] Deduced a trap composed of 30 places in 278 ms of which 4 ms to minimize.
[2024-05-24 01:20:50] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 3 ms to minimize.
[2024-05-24 01:20:50] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 3 ms to minimize.
[2024-05-24 01:20:51] [INFO ] Deduced a trap composed of 50 places in 236 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:20:52] [INFO ] Deduced a trap composed of 67 places in 370 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/1057 variables, and 74 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 49/49 constraints]
After SMT, in 61525ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 61549ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65402 ms. Remains : 393/663 places, 2112/2424 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 243 ms.
Product exploration explored 100000 steps with 0 reset in 305 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1072 ms. (37 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 66852 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 4
Probabilistic random walk after 66852 steps, saw 44587 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 01:21:01] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:21:01] [INFO ] Invariant cache hit.
[2024-05-24 01:21:01] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:21:02] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:21:02] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-05-24 01:21:02] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 2 ms to minimize.
[2024-05-24 01:21:03] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 2 ms to minimize.
[2024-05-24 01:21:03] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 2 ms to minimize.
[2024-05-24 01:21:03] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-05-24 01:21:03] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 20 ms to minimize.
[2024-05-24 01:21:03] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2024-05-24 01:21:03] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2764 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 3625ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2803 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 70 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 393/393 places, 2112/2112 transitions.
RANDOM walk for 40000 steps (8 resets) in 1362 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 65493 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 4
Probabilistic random walk after 65493 steps, saw 43802 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 01:21:11] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:21:11] [INFO ] Invariant cache hit.
[2024-05-24 01:21:11] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:21:12] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:21:13] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:21:13] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 2 ms to minimize.
[2024-05-24 01:21:13] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2024-05-24 01:21:13] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 2 ms to minimize.
[2024-05-24 01:21:14] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:21:14] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 01:21:14] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 01:21:14] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2739 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 3803ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3349 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 68 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 115 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 01:21:18] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:21:18] [INFO ] Invariant cache hit.
[2024-05-24 01:21:19] [INFO ] Implicit Places using invariants in 608 ms returned []
[2024-05-24 01:21:19] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:21:19] [INFO ] Invariant cache hit.
[2024-05-24 01:21:19] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 01:21:28] [INFO ] Implicit Places using invariants and state equation in 8746 ms returned []
Implicit Place search using SMT with State Equation took 9382 ms to find 0 implicit places.
[2024-05-24 01:21:28] [INFO ] Redundant transitions in 58 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 01:21:28] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:21:28] [INFO ] Invariant cache hit.
[2024-05-24 01:21:28] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:21:57] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 4 ms to minimize.
[2024-05-24 01:21:57] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2024-05-24 01:21:57] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2024-05-24 01:21:58] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 2 ms to minimize.
[2024-05-24 01:21:58] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-24 01:21:58] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 01:21:58] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 3 ms to minimize.
[2024-05-24 01:21:58] [INFO ] Deduced a trap composed of 77 places in 210 ms of which 2 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 393/1057 variables, and 33 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:22:19] [INFO ] Deduced a trap composed of 71 places in 384 ms of which 15 ms to minimize.
[2024-05-24 01:22:20] [INFO ] Deduced a trap composed of 27 places in 458 ms of which 6 ms to minimize.
[2024-05-24 01:22:20] [INFO ] Deduced a trap composed of 62 places in 328 ms of which 3 ms to minimize.
[2024-05-24 01:22:20] [INFO ] Deduced a trap composed of 59 places in 282 ms of which 3 ms to minimize.
[2024-05-24 01:22:21] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 4 ms to minimize.
[2024-05-24 01:22:21] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 3 ms to minimize.
[2024-05-24 01:22:21] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 01:22:22] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-24 01:22:22] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-24 01:22:23] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 4 ms to minimize.
[2024-05-24 01:22:23] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 2 ms to minimize.
[2024-05-24 01:22:23] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-24 01:22:24] [INFO ] Deduced a trap composed of 64 places in 321 ms of which 3 ms to minimize.
[2024-05-24 01:22:24] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 3 ms to minimize.
[2024-05-24 01:22:24] [INFO ] Deduced a trap composed of 65 places in 276 ms of which 3 ms to minimize.
[2024-05-24 01:22:25] [INFO ] Deduced a trap composed of 38 places in 326 ms of which 4 ms to minimize.
[2024-05-24 01:22:25] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 3 ms to minimize.
[2024-05-24 01:22:25] [INFO ] Deduced a trap composed of 45 places in 364 ms of which 4 ms to minimize.
[2024-05-24 01:22:26] [INFO ] Deduced a trap composed of 76 places in 385 ms of which 4 ms to minimize.
[2024-05-24 01:22:26] [INFO ] Deduced a trap composed of 72 places in 392 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 2104 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 Int declared 393/1057 variables, and 53 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 28/28 constraints]
After SMT, in 61423ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 61447ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71026 ms. Remains : 393/393 places, 2112/2112 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1936 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 337 transition count 413
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 259 transition count 413
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 157 place count 259 transition count 397
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 196 place count 236 transition count 397
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 420 place count 124 transition count 285
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 475 place count 124 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 485 place count 119 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 490 place count 119 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 497 place count 119 transition count 218
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 555 place count 119 transition count 160
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 613 place count 61 transition count 160
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 61 transition count 160
Applied a total of 621 rules in 23 ms. Remains 61 /393 variables (removed 332) and now considering 160/2112 (removed 1952) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 160 rows 61 cols
[2024-05-24 01:22:29] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 01:22:29] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 01:22:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 01:22:29] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 01:22:29] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 01:22:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 01:22:30] [INFO ] After 78ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 01:22:30] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 01:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-24 01:22:30] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 01:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2024-05-24 01:22:30] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 01:22:30] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 708 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 77 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 01:22:30] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 01:22:30] [INFO ] Computed 25 invariants in 3 ms
[2024-05-24 01:22:31] [INFO ] Implicit Places using invariants in 726 ms returned []
[2024-05-24 01:22:31] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:22:31] [INFO ] Invariant cache hit.
[2024-05-24 01:22:31] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 01:22:34] [INFO ] Implicit Places using invariants and state equation in 2839 ms returned []
Implicit Place search using SMT with State Equation took 3569 ms to find 0 implicit places.
[2024-05-24 01:22:34] [INFO ] Redundant transitions in 55 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 01:22:34] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:22:34] [INFO ] Invariant cache hit.
[2024-05-24 01:22:34] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
SMT process timed out in 31487ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 31512ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35225 ms. Remains : 393/393 places, 2112/2112 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 468 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 920 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 72585 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 4
Probabilistic random walk after 72585 steps, saw 48259 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 01:23:10] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:23:10] [INFO ] Invariant cache hit.
[2024-05-24 01:23:10] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:23:12] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:23:12] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2024-05-24 01:23:12] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
[2024-05-24 01:23:12] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-05-24 01:23:13] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 2 ms to minimize.
[2024-05-24 01:23:13] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:23:13] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 01:23:13] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-24 01:23:13] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2617 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 3731ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2845 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 78 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 393/393 places, 2112/2112 transitions.
RANDOM walk for 40000 steps (8 resets) in 1010 ms. (39 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 63909 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 4
Probabilistic random walk after 63909 steps, saw 42760 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 01:23:20] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:23:20] [INFO ] Invariant cache hit.
[2024-05-24 01:23:20] [INFO ] State equation strengthened by 291 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 110/587 variables, 50/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 27/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/767 variables, 10/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/767 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/777 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/777 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 280/1057 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1057 variables, 203/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1057 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1057/1057 variables, and 709 constraints, problems are : Problem set: 0 solved, 4 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 96/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 41/143 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 10/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 324/477 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 61/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:23:22] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/477 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 110/587 variables, 50/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 27/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 180/767 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/767 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 10/777 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/777 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 01:23:23] [INFO ] Deduced a trap composed of 7 places in 713 ms of which 2 ms to minimize.
[2024-05-24 01:23:23] [INFO ] Deduced a trap composed of 44 places in 298 ms of which 2 ms to minimize.
[2024-05-24 01:23:23] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 2 ms to minimize.
[2024-05-24 01:23:24] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 1 ms to minimize.
[2024-05-24 01:23:24] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 2 ms to minimize.
[2024-05-24 01:23:24] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2024-05-24 01:23:24] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2024-05-24 01:23:24] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/777 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/777 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 280/1057 variables, 190/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1057 variables, 203/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1057 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1057/1057 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3769 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 4657ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2930 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 71 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 393/393 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 70 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 01:23:28] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:23:28] [INFO ] Invariant cache hit.
[2024-05-24 01:23:29] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-24 01:23:29] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:23:29] [INFO ] Invariant cache hit.
[2024-05-24 01:23:29] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 01:23:31] [INFO ] Implicit Places using invariants and state equation in 2560 ms returned []
Implicit Place search using SMT with State Equation took 3218 ms to find 0 implicit places.
[2024-05-24 01:23:31] [INFO ] Redundant transitions in 59 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 01:23:31] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:23:31] [INFO ] Invariant cache hit.
[2024-05-24 01:23:31] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:23:52] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 4 ms to minimize.
[2024-05-24 01:23:53] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2024-05-24 01:23:53] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-05-24 01:23:53] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-05-24 01:23:53] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-24 01:23:53] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 01:23:53] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 3 ms to minimize.
[2024-05-24 01:23:53] [INFO ] Deduced a trap composed of 77 places in 226 ms of which 2 ms to minimize.
[2024-05-24 01:23:55] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 3 ms to minimize.
[2024-05-24 01:23:55] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 3 ms to minimize.
[2024-05-24 01:23:56] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 3 ms to minimize.
[2024-05-24 01:23:56] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 3 ms to minimize.
[2024-05-24 01:23:56] [INFO ] Deduced a trap composed of 45 places in 223 ms of which 3 ms to minimize.
[2024-05-24 01:23:56] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-24 01:23:57] [INFO ] Deduced a trap composed of 76 places in 284 ms of which 3 ms to minimize.
[2024-05-24 01:23:57] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 4 ms to minimize.
[2024-05-24 01:23:57] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-24 01:23:58] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 3 ms to minimize.
[2024-05-24 01:23:58] [INFO ] Deduced a trap composed of 68 places in 321 ms of which 3 ms to minimize.
[2024-05-24 01:23:58] [INFO ] Deduced a trap composed of 47 places in 297 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1057 variables, and 45 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-24 01:24:11] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2024-05-24 01:24:14] [INFO ] Deduced a trap composed of 62 places in 365 ms of which 11 ms to minimize.
[2024-05-24 01:24:15] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 3 ms to minimize.
[2024-05-24 01:24:20] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-24 01:24:23] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2024-05-24 01:24:27] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 2 ms to minimize.
[2024-05-24 01:24:30] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/1057 variables, and 52 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 27/27 constraints]
After SMT, in 61416ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 61440ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64798 ms. Remains : 393/393 places, 2112/2112 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1936 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 337 transition count 413
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 259 transition count 413
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 157 place count 259 transition count 397
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 196 place count 236 transition count 397
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 420 place count 124 transition count 285
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 475 place count 124 transition count 230
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 485 place count 119 transition count 230
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 490 place count 119 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 497 place count 119 transition count 218
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 555 place count 119 transition count 160
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 613 place count 61 transition count 160
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 621 place count 61 transition count 160
Applied a total of 621 rules in 29 ms. Remains 61 /393 variables (removed 332) and now considering 160/2112 (removed 1952) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 160 rows 61 cols
[2024-05-24 01:24:33] [INFO ] Computed 18 invariants in 1 ms
[2024-05-24 01:24:33] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 01:24:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 01:24:33] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 01:24:33] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 01:24:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 01:24:33] [INFO ] After 46ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 01:24:33] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-24 01:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-24 01:24:33] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-24 01:24:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 1
[2024-05-24 01:24:33] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 01:24:33] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 552 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 142 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 249 ms.
Product exploration explored 100000 steps with 0 reset in 293 ms.
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2112/2112 transitions.
Applied a total of 0 rules in 72 ms. Remains 393 /393 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-24 01:24:34] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
// Phase 1: matrix 664 rows 393 cols
[2024-05-24 01:24:34] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 01:24:36] [INFO ] Implicit Places using invariants in 1440 ms returned []
[2024-05-24 01:24:36] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:24:36] [INFO ] Invariant cache hit.
[2024-05-24 01:24:36] [INFO ] State equation strengthened by 291 read => feed constraints.
[2024-05-24 01:24:39] [INFO ] Implicit Places using invariants and state equation in 2946 ms returned []
Implicit Place search using SMT with State Equation took 4392 ms to find 0 implicit places.
[2024-05-24 01:24:39] [INFO ] Redundant transitions in 56 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-24 01:24:39] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2024-05-24 01:24:39] [INFO ] Invariant cache hit.
[2024-05-24 01:24:39] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
SMT process timed out in 31543ms, After SMT, problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 31573ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36102 ms. Remains : 393/393 places, 2112/2112 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-14 finished in 320008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-08-LTLFireability-12
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 423 place count 448 transition count 2160
Iterating global reduction 2 with 7 rules applied. Total rules applied 430 place count 448 transition count 2160
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 542 place count 392 transition count 2104
Applied a total of 542 rules in 113 ms. Remains 392 /663 variables (removed 271) and now considering 2104/2424 (removed 320) transitions.
[2024-05-24 01:25:11] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 01:25:11] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 01:25:12] [INFO ] Implicit Places using invariants in 761 ms returned []
[2024-05-24 01:25:12] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:25:12] [INFO ] Invariant cache hit.
[2024-05-24 01:25:12] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:25:15] [INFO ] Implicit Places using invariants and state equation in 2816 ms returned []
Implicit Place search using SMT with State Equation took 3579 ms to find 0 implicit places.
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:25:15] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:25:15] [INFO ] Invariant cache hit.
[2024-05-24 01:25:15] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:25:37] [INFO ] Deduced a trap composed of 3 places in 396 ms of which 4 ms to minimize.
[2024-05-24 01:25:37] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 3 ms to minimize.
[2024-05-24 01:25:37] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-24 01:25:37] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-05-24 01:25:38] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 01:25:38] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 01:25:38] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:25:38] [INFO ] Deduced a trap composed of 71 places in 246 ms of which 3 ms to minimize.
[2024-05-24 01:25:38] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 3 ms to minimize.
[2024-05-24 01:25:39] [INFO ] Deduced a trap composed of 61 places in 294 ms of which 3 ms to minimize.
[2024-05-24 01:25:39] [INFO ] Deduced a trap composed of 22 places in 300 ms of which 3 ms to minimize.
[2024-05-24 01:25:39] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 4 ms to minimize.
[2024-05-24 01:25:40] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 3 ms to minimize.
[2024-05-24 01:25:40] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 2 ms to minimize.
[2024-05-24 01:25:40] [INFO ] Deduced a trap composed of 54 places in 308 ms of which 2 ms to minimize.
[2024-05-24 01:25:41] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 2 ms to minimize.
[2024-05-24 01:25:41] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 2 ms to minimize.
[2024-05-24 01:25:41] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 1 ms to minimize.
[2024-05-24 01:25:43] [INFO ] Deduced a trap composed of 48 places in 386 ms of which 4 ms to minimize.
[2024-05-24 01:25:43] [INFO ] Deduced a trap composed of 15 places in 380 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:25:45] [INFO ] Deduced a trap composed of 76 places in 272 ms of which 3 ms to minimize.
[2024-05-24 01:25:46] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 4 ms to minimize.
SMT process timed out in 31701ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31727ms
Starting structural reductions in LI_LTL mode, iteration 1 : 392/663 places, 2104/2424 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 35424 ms. Remains : 392/663 places, 2104/2424 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 259 ms.
Product exploration explored 100000 steps with 0 reset in 429 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 404298 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 404298 steps, saw 221722 distinct states, run finished after 3002 ms. (steps per millisecond=134 ) properties seen :0
[2024-05-24 01:25:51] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:25:51] [INFO ] Invariant cache hit.
[2024-05-24 01:25:51] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:25:51] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:25:51] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:25:52] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 3 ms to minimize.
[2024-05-24 01:25:52] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 2 ms to minimize.
[2024-05-24 01:25:52] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2024-05-24 01:25:53] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2024-05-24 01:25:53] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:25:53] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2209 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2917ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 76 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 399771 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 399771 steps, saw 219350 distinct states, run finished after 3017 ms. (steps per millisecond=132 ) properties seen :0
[2024-05-24 01:25:57] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:25:57] [INFO ] Invariant cache hit.
[2024-05-24 01:25:57] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:25:57] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:25:57] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:25:59] [INFO ] Deduced a trap composed of 3 places in 355 ms of which 3 ms to minimize.
[2024-05-24 01:25:59] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:25:59] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 2 ms to minimize.
[2024-05-24 01:25:59] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 2 ms to minimize.
[2024-05-24 01:25:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:26:00] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1753 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 3037ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 69 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 69 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 01:26:00] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:26:00] [INFO ] Invariant cache hit.
[2024-05-24 01:26:01] [INFO ] Implicit Places using invariants in 694 ms returned []
[2024-05-24 01:26:01] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:26:01] [INFO ] Invariant cache hit.
[2024-05-24 01:26:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:26:03] [INFO ] Implicit Places using invariants and state equation in 2708 ms returned []
Implicit Place search using SMT with State Equation took 3403 ms to find 0 implicit places.
[2024-05-24 01:26:03] [INFO ] Redundant transitions in 58 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:26:04] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:26:04] [INFO ] Invariant cache hit.
[2024-05-24 01:26:04] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:26:27] [INFO ] Deduced a trap composed of 3 places in 388 ms of which 4 ms to minimize.
[2024-05-24 01:26:27] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 2 ms to minimize.
[2024-05-24 01:26:27] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-05-24 01:26:27] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-24 01:26:27] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 01:26:27] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 01:26:28] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 7 ms to minimize.
[2024-05-24 01:26:28] [INFO ] Deduced a trap composed of 71 places in 237 ms of which 4 ms to minimize.
[2024-05-24 01:26:28] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 3 ms to minimize.
[2024-05-24 01:26:28] [INFO ] Deduced a trap composed of 61 places in 226 ms of which 3 ms to minimize.
[2024-05-24 01:26:29] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 3 ms to minimize.
[2024-05-24 01:26:29] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 3 ms to minimize.
[2024-05-24 01:26:29] [INFO ] Deduced a trap composed of 29 places in 303 ms of which 3 ms to minimize.
[2024-05-24 01:26:30] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 2 ms to minimize.
[2024-05-24 01:26:30] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 2 ms to minimize.
[2024-05-24 01:26:30] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
[2024-05-24 01:26:30] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 1 ms to minimize.
[2024-05-24 01:26:30] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-24 01:26:32] [INFO ] Deduced a trap composed of 48 places in 305 ms of which 4 ms to minimize.
[2024-05-24 01:26:32] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:26:33] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 3 ms to minimize.
[2024-05-24 01:26:35] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 3 ms to minimize.
[2024-05-24 01:26:35] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 3 ms to minimize.
SMT process timed out in 31508ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31531ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35070 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 19 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 01:26:35] [INFO ] Computed 17 invariants in 0 ms
[2024-05-24 01:26:35] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-24 01:26:35] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:26:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 01:26:35] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 01:26:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 01:26:35] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 01:26:35] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 01:26:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
TRAPS : Iteration 1
[2024-05-24 01:26:35] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 01:26:35] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 290 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 70 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 01:26:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 01:26:36] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 01:26:36] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-24 01:26:36] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:26:36] [INFO ] Invariant cache hit.
[2024-05-24 01:26:37] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:26:39] [INFO ] Implicit Places using invariants and state equation in 2511 ms returned []
Implicit Place search using SMT with State Equation took 3160 ms to find 0 implicit places.
[2024-05-24 01:26:39] [INFO ] Redundant transitions in 54 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:26:39] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:26:39] [INFO ] Invariant cache hit.
[2024-05-24 01:26:39] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:27:00] [INFO ] Deduced a trap composed of 3 places in 437 ms of which 5 ms to minimize.
[2024-05-24 01:27:01] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 2 ms to minimize.
[2024-05-24 01:27:01] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-05-24 01:27:01] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-05-24 01:27:01] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-24 01:27:01] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 01:27:01] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 3 ms to minimize.
[2024-05-24 01:27:02] [INFO ] Deduced a trap composed of 71 places in 226 ms of which 3 ms to minimize.
[2024-05-24 01:27:02] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 3 ms to minimize.
[2024-05-24 01:27:02] [INFO ] Deduced a trap composed of 61 places in 237 ms of which 3 ms to minimize.
[2024-05-24 01:27:02] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 4 ms to minimize.
[2024-05-24 01:27:03] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-05-24 01:27:03] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 3 ms to minimize.
[2024-05-24 01:27:03] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 2 ms to minimize.
[2024-05-24 01:27:03] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 2 ms to minimize.
[2024-05-24 01:27:03] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2024-05-24 01:27:04] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2024-05-24 01:27:04] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 4 ms to minimize.
[2024-05-24 01:27:05] [INFO ] Deduced a trap composed of 48 places in 314 ms of which 4 ms to minimize.
[2024-05-24 01:27:06] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:27:07] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 3 ms to minimize.
[2024-05-24 01:27:08] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 3 ms to minimize.
[2024-05-24 01:27:08] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 3 ms to minimize.
[2024-05-24 01:27:09] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 3 ms to minimize.
[2024-05-24 01:27:09] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
[2024-05-24 01:27:09] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 3 ms to minimize.
[2024-05-24 01:27:10] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 3 ms to minimize.
[2024-05-24 01:27:10] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 4 ms to minimize.
[2024-05-24 01:27:10] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 3 ms to minimize.
SMT process timed out in 31541ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31563ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34856 ms. Remains : 392/392 places, 2104/2104 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 408735 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 408735 steps, saw 222904 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2024-05-24 01:27:14] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:27:14] [INFO ] Invariant cache hit.
[2024-05-24 01:27:14] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:27:14] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:27:14] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:27:15] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 2 ms to minimize.
[2024-05-24 01:27:16] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 5 ms to minimize.
[2024-05-24 01:27:16] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 2 ms to minimize.
[2024-05-24 01:27:16] [INFO ] Deduced a trap composed of 47 places in 245 ms of which 2 ms to minimize.
[2024-05-24 01:27:16] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:27:18] [INFO ] Deduced a trap composed of 3 places in 1615 ms of which 30 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3891 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 4813ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 98 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 93 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 392/392 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 325908 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 325908 steps, saw 181993 distinct states, run finished after 3004 ms. (steps per millisecond=108 ) properties seen :0
[2024-05-24 01:27:22] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:27:22] [INFO ] Invariant cache hit.
[2024-05-24 01:27:22] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:27:22] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:27:22] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 336/1048 variables, 228/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1048 variables, 227/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1048 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/94 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/104 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 248/352 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 132/484 variables, 60/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 215/699 variables, 11/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/701 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/701 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 11/712 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/712 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:27:23] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 2 ms to minimize.
[2024-05-24 01:27:23] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 3 ms to minimize.
[2024-05-24 01:27:23] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 2 ms to minimize.
[2024-05-24 01:27:24] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2024-05-24 01:27:24] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/712 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/712 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 336/1048 variables, 228/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 227/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 01:27:24] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 710 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 2584ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 70 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 77 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 01:27:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:27:25] [INFO ] Invariant cache hit.
[2024-05-24 01:27:25] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-24 01:27:25] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:27:25] [INFO ] Invariant cache hit.
[2024-05-24 01:27:26] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:27:28] [INFO ] Implicit Places using invariants and state equation in 2733 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
[2024-05-24 01:27:28] [INFO ] Redundant transitions in 59 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:27:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:27:28] [INFO ] Invariant cache hit.
[2024-05-24 01:27:28] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:27:55] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 4 ms to minimize.
[2024-05-24 01:27:55] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 3 ms to minimize.
[2024-05-24 01:27:55] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-24 01:27:56] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-24 01:27:56] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 01:27:56] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 01:27:56] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 2 ms to minimize.
[2024-05-24 01:27:56] [INFO ] Deduced a trap composed of 71 places in 227 ms of which 3 ms to minimize.
[2024-05-24 01:27:56] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 3 ms to minimize.
[2024-05-24 01:27:57] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 3 ms to minimize.
[2024-05-24 01:27:57] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 3 ms to minimize.
[2024-05-24 01:27:57] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 3 ms to minimize.
[2024-05-24 01:27:57] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 3 ms to minimize.
[2024-05-24 01:27:58] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 2 ms to minimize.
[2024-05-24 01:27:58] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 3 ms to minimize.
[2024-05-24 01:27:58] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-05-24 01:27:58] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2024-05-24 01:27:59] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-24 01:28:00] [INFO ] Deduced a trap composed of 48 places in 293 ms of which 4 ms to minimize.
[2024-05-24 01:28:00] [INFO ] Deduced a trap composed of 15 places in 309 ms of which 4 ms to minimize.
SMT process timed out in 32014ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 32036ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35634 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1938 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 336 transition count 410
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 258 transition count 410
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 157 place count 258 transition count 393
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 199 place count 233 transition count 393
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 421 place count 122 transition count 282
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 475 place count 122 transition count 228
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 491 place count 114 transition count 228
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 499 place count 114 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 508 place count 114 transition count 211
Free-agglomeration rule applied 57 times.
Iterating global reduction 4 with 57 rules applied. Total rules applied 565 place count 114 transition count 154
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 622 place count 57 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 630 place count 57 transition count 154
Applied a total of 630 rules in 26 ms. Remains 57 /392 variables (removed 335) and now considering 154/2104 (removed 1950) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 57 cols
[2024-05-24 01:28:00] [INFO ] Computed 17 invariants in 0 ms
[2024-05-24 01:28:00] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 01:28:00] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 01:28:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-24 01:28:00] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 01:28:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 01:28:00] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 01:28:00] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-24 01:28:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
TRAPS : Iteration 1
[2024-05-24 01:28:00] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 01:28:00] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 299 ms.
Product exploration explored 100000 steps with 0 reset in 304 ms.
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 71 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-24 01:28:01] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2024-05-24 01:28:01] [INFO ] Computed 25 invariants in 2 ms
[2024-05-24 01:28:02] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-24 01:28:02] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:28:02] [INFO ] Invariant cache hit.
[2024-05-24 01:28:02] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-24 01:28:04] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 3140 ms to find 0 implicit places.
[2024-05-24 01:28:05] [INFO ] Redundant transitions in 55 ms returned []
Running 2096 sub problems to find dead transitions.
[2024-05-24 01:28:05] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2024-05-24 01:28:05] [INFO ] Invariant cache hit.
[2024-05-24 01:28:05] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:28:26] [INFO ] Deduced a trap composed of 3 places in 392 ms of which 4 ms to minimize.
[2024-05-24 01:28:26] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 3 ms to minimize.
[2024-05-24 01:28:26] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-05-24 01:28:26] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2024-05-24 01:28:26] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 01:28:26] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-24 01:28:26] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 3 ms to minimize.
[2024-05-24 01:28:27] [INFO ] Deduced a trap composed of 71 places in 230 ms of which 3 ms to minimize.
[2024-05-24 01:28:27] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 3 ms to minimize.
[2024-05-24 01:28:27] [INFO ] Deduced a trap composed of 61 places in 233 ms of which 3 ms to minimize.
[2024-05-24 01:28:27] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 3 ms to minimize.
[2024-05-24 01:28:28] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 3 ms to minimize.
[2024-05-24 01:28:28] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 3 ms to minimize.
[2024-05-24 01:28:28] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-05-24 01:28:28] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 3 ms to minimize.
[2024-05-24 01:28:29] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 2 ms to minimize.
[2024-05-24 01:28:29] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-05-24 01:28:29] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-24 01:28:30] [INFO ] Deduced a trap composed of 48 places in 300 ms of which 3 ms to minimize.
[2024-05-24 01:28:31] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-24 01:28:32] [INFO ] Deduced a trap composed of 76 places in 202 ms of which 3 ms to minimize.
[2024-05-24 01:28:33] [INFO ] Deduced a trap composed of 45 places in 235 ms of which 4 ms to minimize.
[2024-05-24 01:28:34] [INFO ] Deduced a trap composed of 48 places in 252 ms of which 3 ms to minimize.
[2024-05-24 01:28:34] [INFO ] Deduced a trap composed of 59 places in 228 ms of which 3 ms to minimize.
[2024-05-24 01:28:34] [INFO ] Deduced a trap composed of 45 places in 226 ms of which 4 ms to minimize.
[2024-05-24 01:28:35] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 3 ms to minimize.
[2024-05-24 01:28:35] [INFO ] Deduced a trap composed of 49 places in 254 ms of which 3 ms to minimize.
[2024-05-24 01:28:35] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 3 ms to minimize.
[2024-05-24 01:28:36] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 3 ms to minimize.
[2024-05-24 01:28:36] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 3 ms to minimize.
SMT process timed out in 31440ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 31460ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 34738 ms. Remains : 392/392 places, 2104/2104 transitions.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 205491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(p2)||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(p1)))||p0))))'
[2024-05-24 01:28:37] [INFO ] Flatten gal took : 204 ms
[2024-05-24 01:28:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-24 01:28:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 663 places, 2424 transitions and 11872 arcs took 78 ms.
Total runtime 1771458 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 663
TRANSITIONS: 2424
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.085s, Sys 0.009s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.010s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4769
MODEL NAME: /home/mcc/execution/415/model
663 places, 2424 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is EisenbergMcGuire-PT-08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r157-smll-171636265200188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;