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-171636265100156.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-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265100156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 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 255K 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-04-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716480346017

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-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 16:05:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 16:05:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:05:49] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-05-23 16:05:49] [INFO ] Transformed 196 places.
[2024-05-23 16:05:49] [INFO ] Transformed 448 transitions.
[2024-05-23 16:05:49] [INFO ] Found NUPN structural information;
[2024-05-23 16:05:49] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 504 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 190 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 190 transition count 424
Applied a total of 12 rules in 123 ms. Remains 190 /196 variables (removed 6) and now considering 424/448 (removed 24) transitions.
[2024-05-23 16:05:49] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
// Phase 1: matrix 260 rows 190 cols
[2024-05-23 16:05:49] [INFO ] Computed 13 invariants in 37 ms
[2024-05-23 16:05:50] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-23 16:05:50] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-05-23 16:05:50] [INFO ] Invariant cache hit.
[2024-05-23 16:05:50] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 16:05:51] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-23 16:05:51] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-05-23 16:05:51] [INFO ] Invariant cache hit.
[2024-05-23 16:05:51] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-23 16:05:55] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 26 ms to minimize.
[2024-05-23 16:05:55] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 4 ms to minimize.
[2024-05-23 16:05:56] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 4 ms to minimize.
[2024-05-23 16:05:56] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2024-05-23 16:05:56] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:05:57] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 4 ms to minimize.
[2024-05-23 16:05:57] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:05:57] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
[2024-05-23 16:05:57] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:05:57] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:05:57] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 16:05:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2024-05-23 16:05:58] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:05:58] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 3 ms to minimize.
[2024-05-23 16:05:58] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2024-05-23 16:05:58] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:05:58] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:05:59] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:05:59] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 3 ms to minimize.
[2024-05-23 16:05:59] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-23 16:06:00] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:06:00] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:06:00] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:06:01] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:06:01] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 3 ms to minimize.
[2024-05-23 16:06:02] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 3 ms to minimize.
[2024-05-23 16:06:02] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 3 ms to minimize.
[2024-05-23 16:06:02] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-05-23 16:06:04] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 2 ms to minimize.
[2024-05-23 16:06:05] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 4 ms to minimize.
[2024-05-23 16:06:05] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:06:05] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 2 ms to minimize.
[2024-05-23 16:06:06] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 4 ms to minimize.
[2024-05-23 16:06:06] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 4 ms to minimize.
[2024-05-23 16:06:06] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 3 ms to minimize.
[2024-05-23 16:06:06] [INFO ] Deduced a trap composed of 60 places in 192 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-23 16:06:11] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 4 ms to minimize.
[2024-05-23 16:06:11] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 3 ms to minimize.
[2024-05-23 16:06:11] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 3 ms to minimize.
[2024-05-23 16:06:11] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 5 ms to minimize.
[2024-05-23 16:06:11] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 3 ms to minimize.
[2024-05-23 16:06:14] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-23 16:06:16] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:06:17] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:06:17] [INFO ] Deduced a trap composed of 71 places in 145 ms of which 3 ms to minimize.
[2024-05-23 16:06:17] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:06:18] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:06:18] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:06:18] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:06:18] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:06:18] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
[2024-05-23 16:06:18] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 4 ms to minimize.
[2024-05-23 16:06:19] [INFO ] Deduced a trap composed of 43 places in 203 ms of which 3 ms to minimize.
[2024-05-23 16:06:19] [INFO ] Deduced a trap composed of 47 places in 194 ms of which 3 ms to minimize.
[2024-05-23 16:06:19] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:06:19] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 4 ms to minimize.
[2024-05-23 16:06:20] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 15 ms to minimize.
[2024-05-23 16:06:20] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:06:20] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 3 ms to minimize.
[2024-05-23 16:06:20] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 2 ms to minimize.
[2024-05-23 16:06:21] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 4 ms to minimize.
[2024-05-23 16:06:21] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/450 variables, and 75 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/190 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-23 16:06:23] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:06:23] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 5 ms to minimize.
[2024-05-23 16:06:23] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:06:25] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 3 ms to minimize.
[2024-05-23 16:06:25] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 3 ms to minimize.
[2024-05-23 16:06:26] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-23 16:06:28] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:06:30] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 3 ms to minimize.
[2024-05-23 16:06:31] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 3 ms to minimize.
[2024-05-23 16:06:32] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:06:32] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:06:32] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:06:33] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:06:33] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:06:33] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-23 16:06:36] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 2 ms to minimize.
[2024-05-23 16:06:36] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:06:36] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 3 ms to minimize.
[2024-05-23 16:06:36] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 3 ms to minimize.
[2024-05-23 16:06:36] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:06:37] [INFO ] Deduced a trap composed of 54 places in 183 ms of which 4 ms to minimize.
[2024-05-23 16:06:37] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:06:37] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:06:37] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 3 ms to minimize.
[2024-05-23 16:06:37] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 3 ms to minimize.
[2024-05-23 16:06:39] [INFO ] Deduced a trap composed of 57 places in 195 ms of which 3 ms to minimize.
[2024-05-23 16:06:40] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:06:40] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:06:40] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 260/450 variables, 190/294 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 94/388 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 420/808 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 808 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 190/190 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 91/91 constraints]
After SMT, in 60581ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 60634ms
Starting structural reductions in LTL mode, iteration 1 : 190/196 places, 424/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62179 ms. Remains : 190/196 places, 424/448 transitions.
Support contains 46 out of 190 places after structural reductions.
[2024-05-23 16:06:52] [INFO ] Flatten gal took : 128 ms
[2024-05-23 16:06:52] [INFO ] Flatten gal took : 63 ms
[2024-05-23 16:06:52] [INFO ] Input system was already deterministic with 424 transitions.
RANDOM walk for 40000 steps (8 resets) in 3728 ms. (10 steps per ms) remains 18/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
[2024-05-23 16:06:53] [INFO ] Flow matrix only has 260 transitions (discarded 164 similar events)
[2024-05-23 16:06:53] [INFO ] Invariant cache hit.
[2024-05-23 16:06:53] [INFO ] State equation strengthened by 94 read => feed constraints.
Problem AtomicPropp6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 2 (OVERLAPS) 157/188 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 3/12 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/190 variables, 1/13 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-23 16:06:54] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 4 ms to minimize.
[2024-05-23 16:06:54] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:06:55] [INFO ] Deduced a trap composed of 64 places in 226 ms of which 3 ms to minimize.
[2024-05-23 16:06:55] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:06:55] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 5/18 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 260/450 variables, 190/208 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/450 variables, 94/302 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-23 16:06:55] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:06:55] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 2/304 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/304 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/450 variables, 0/304 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 304 constraints, problems are : Problem set: 5 solved, 12 unsolved in 2410 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 190/190 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 5 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 163/187 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 2/11 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 2/13 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-23 16:06:56] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 16:06:56] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 2/15 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/190 variables, 2/17 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 5/22 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-23 16:06:57] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:06:57] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:06:57] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:06:57] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 4 ms to minimize.
[2024-05-23 16:06:57] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 5/27 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/27 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 260/450 variables, 190/217 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 94/311 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 12/323 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-23 16:06:58] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 1/324 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-23 16:06:58] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:06:59] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/326 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-23 16:06:59] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-05-23 16:06:59] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:06:59] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:07:00] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 4/330 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/330 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-05-23 16:07:00] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/450 variables, 1/331 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/331 constraints. Problems are: Problem set: 5 solved, 12 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 450/450 variables, and 331 constraints, problems are : Problem set: 5 solved, 12 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 190/190 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 12/17 constraints, Known Traps: 22/22 constraints]
After SMT, in 7450ms problems are : Problem set: 5 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 190 transition count 421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 187 transition count 421
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 6 place count 187 transition count 372
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 104 place count 138 transition count 372
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 135 transition count 360
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 135 transition count 360
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 132 place count 124 transition count 349
Applied a total of 132 rules in 116 ms. Remains 124 /190 variables (removed 66) and now considering 349/424 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 124/190 places, 349/424 transitions.
RANDOM walk for 40000 steps (8 resets) in 608 ms. (65 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 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 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 547820 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :9 out of 11
Probabilistic random walk after 547820 steps, saw 111976 distinct states, run finished after 3006 ms. (steps per millisecond=182 ) properties seen :9
[2024-05-23 16:07:05] [INFO ] Flow matrix only has 185 transitions (discarded 164 similar events)
// Phase 1: matrix 185 rows 124 cols
[2024-05-23 16:07:05] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 16:07:05] [INFO ] State equation strengthened by 85 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 99/162 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 22/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/190 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/235 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/239 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 70/309 variables, 49/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/309 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:07:05] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 99/162 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 22/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/190 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 7/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 45/235 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/239 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:07:05] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:07:06] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-23 16:07:06] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 70/309 variables, 49/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/309 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/309 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 124/124 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 1027ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 565 ms.
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 349/349 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 124 transition count 345
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 120 transition count 345
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 117 transition count 333
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 117 transition count 333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 116 transition count 332
Applied a total of 16 rules in 74 ms. Remains 116 /124 variables (removed 8) and now considering 332/349 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 116/124 places, 332/349 transitions.
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 579761 steps, run visited all 2 properties in 2621 ms. (steps per millisecond=221 )
Probabilistic random walk after 579761 steps, saw 117258 distinct states, run finished after 2627 ms. (steps per millisecond=220 ) properties seen :2
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F(p0)))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 32 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-23 16:07:10] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-23 16:07:10] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 16:07:10] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-23 16:07:10] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:07:10] [INFO ] Invariant cache hit.
[2024-05-23 16:07:10] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:07:11] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:07:11] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:07:11] [INFO ] Invariant cache hit.
[2024-05-23 16:07:11] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:07:14] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:07:14] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:07:14] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:07:15] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 4 ms to minimize.
[2024-05-23 16:07:15] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 4 ms to minimize.
[2024-05-23 16:07:15] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:07:15] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:07:15] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-05-23 16:07:16] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 3 ms to minimize.
[2024-05-23 16:07:16] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:07:16] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 3 ms to minimize.
[2024-05-23 16:07:16] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:07:16] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:07:16] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:07:17] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:07:17] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:07:17] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:07:17] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 3 ms to minimize.
[2024-05-23 16:07:17] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:07:17] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:07:18] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:07:18] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:07:18] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 16:07:19] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:07:19] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
[2024-05-23 16:07:19] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:07:19] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 2 ms to minimize.
[2024-05-23 16:07:19] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 3 ms to minimize.
[2024-05-23 16:07:20] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 3 ms to minimize.
[2024-05-23 16:07:20] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:07:20] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:07:20] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:07:20] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:07:20] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2024-05-23 16:07:21] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-23 16:07:21] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:07:23] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:07:23] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:07:24] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:07:24] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:07:28] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:07:28] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:07:29] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:07:29] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 3 ms to minimize.
[2024-05-23 16:07:30] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:07:30] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 3 ms to minimize.
[2024-05-23 16:07:30] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 3 ms to minimize.
[2024-05-23 16:07:30] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:07:31] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:07:31] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:07:31] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:07:31] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:07:32] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 3 ms to minimize.
[2024-05-23 16:07:32] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:07:33] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:07:33] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:07:34] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:07:40] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 3 ms to minimize.
[2024-05-23 16:07:41] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
SMT process timed out in 30286ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30299ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31283 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-00
Product exploration explored 100000 steps with 474 reset in 533 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-00 finished in 32283 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||F((p1&&(p2 U p3)))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 14 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-23 16:07:42] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:07:42] [INFO ] Invariant cache hit.
[2024-05-23 16:07:42] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-23 16:07:42] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:07:42] [INFO ] Invariant cache hit.
[2024-05-23 16:07:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:07:43] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:07:43] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:07:43] [INFO ] Invariant cache hit.
[2024-05-23 16:07:43] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:07:47] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:07:47] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 3 ms to minimize.
[2024-05-23 16:07:47] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:07:47] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 4 ms to minimize.
[2024-05-23 16:07:47] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:07:48] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 2 ms to minimize.
[2024-05-23 16:07:48] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:07:48] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-05-23 16:07:48] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:07:48] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 3 ms to minimize.
[2024-05-23 16:07:48] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
[2024-05-23 16:07:49] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 3 ms to minimize.
[2024-05-23 16:07:49] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:07:49] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 3 ms to minimize.
[2024-05-23 16:07:49] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 3 ms to minimize.
[2024-05-23 16:07:49] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:07:49] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-05-23 16:07:50] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
[2024-05-23 16:07:50] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 2 ms to minimize.
[2024-05-23 16:07:50] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:07:50] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 16:07:51] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 16:07:51] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:07:51] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 4 ms to minimize.
[2024-05-23 16:07:51] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 3 ms to minimize.
[2024-05-23 16:07:51] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:07:52] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-23 16:07:52] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 4 ms to minimize.
[2024-05-23 16:07:52] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 4 ms to minimize.
[2024-05-23 16:07:52] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 3 ms to minimize.
[2024-05-23 16:07:52] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 4 ms to minimize.
[2024-05-23 16:07:53] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 4 ms to minimize.
[2024-05-23 16:07:53] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:07:53] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 3 ms to minimize.
[2024-05-23 16:07:53] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-05-23 16:07:53] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:07:56] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:07:56] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 2 ms to minimize.
[2024-05-23 16:07:57] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 3 ms to minimize.
[2024-05-23 16:07:57] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:08:00] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 2 ms to minimize.
[2024-05-23 16:08:01] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 3 ms to minimize.
[2024-05-23 16:08:02] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:08:02] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:08:02] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 4 ms to minimize.
[2024-05-23 16:08:03] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:08:03] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:08:03] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:08:03] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:08:04] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:08:04] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:08:04] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-23 16:08:04] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-05-23 16:08:05] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 2 ms to minimize.
[2024-05-23 16:08:05] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:08:06] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:08:07] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 70 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:08:15] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 3 ms to minimize.
[2024-05-23 16:08:15] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:08:15] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-05-23 16:08:15] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 3 ms to minimize.
[2024-05-23 16:08:15] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:08:16] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:08:16] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 3 ms to minimize.
[2024-05-23 16:08:16] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-05-23 16:08:16] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 2 ms to minimize.
[2024-05-23 16:08:19] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-23 16:08:19] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:08:20] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-23 16:08:22] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 236/420 variables, 184/267 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 76/343 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 396/739 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:08:35] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 3 ms to minimize.
[2024-05-23 16:08:35] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:08:35] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 4 ms to minimize.
[2024-05-23 16:08:35] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:08:35] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:08:36] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 2 ms to minimize.
[2024-05-23 16:08:36] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 3 ms to minimize.
[2024-05-23 16:08:36] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 3 ms to minimize.
[2024-05-23 16:08:36] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:08:37] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 3 ms to minimize.
[2024-05-23 16:08:39] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:08:40] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 4 ms to minimize.
[2024-05-23 16:08:40] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:08:40] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 3 ms to minimize.
[2024-05-23 16:08:41] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:08:42] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:08:43] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:08:43] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:08:43] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:08:43] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 3 ms to minimize.
SMT process timed out in 60359ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60368ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61351 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-01
Product exploration explored 100000 steps with 1192 reset in 420 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-01 finished in 62256 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(G(p0))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 13 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-23 16:08:44] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:08:44] [INFO ] Invariant cache hit.
[2024-05-23 16:08:44] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-23 16:08:44] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:08:44] [INFO ] Invariant cache hit.
[2024-05-23 16:08:45] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:08:45] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:08:45] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:08:45] [INFO ] Invariant cache hit.
[2024-05-23 16:08:45] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:08:49] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 3 ms to minimize.
[2024-05-23 16:08:49] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-23 16:08:49] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:08:49] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 3 ms to minimize.
[2024-05-23 16:08:50] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:08:50] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:08:50] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
[2024-05-23 16:08:50] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-23 16:08:50] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 3 ms to minimize.
[2024-05-23 16:08:50] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:08:51] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:08:51] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:08:51] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:08:51] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:08:51] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:08:51] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 3 ms to minimize.
[2024-05-23 16:08:52] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:08:52] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-23 16:08:52] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:08:52] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:08:53] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:08:53] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:08:53] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 16:08:53] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:08:53] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:08:54] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:08:54] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:08:54] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:08:54] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 3 ms to minimize.
[2024-05-23 16:08:54] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:08:54] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:08:54] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:08:54] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 3 ms to minimize.
[2024-05-23 16:08:55] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:08:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-23 16:08:55] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-23 16:08:57] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:08:57] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:08:57] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:08:57] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:08:59] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:09:00] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:09:00] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:09:01] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:09:01] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:09:01] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:09:01] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:09:01] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:09:02] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:09:02] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:09:02] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:09:02] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-23 16:09:02] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:09:03] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:09:03] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:09:03] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:09:04] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:09:10] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 4 ms to minimize.
[2024-05-23 16:09:11] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2024-05-23 16:09:11] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:09:13] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:09:13] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 2 ms to minimize.
[2024-05-23 16:09:14] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 3 ms to minimize.
[2024-05-23 16:09:14] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:09:15] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 3 ms to minimize.
[2024-05-23 16:09:15] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 2 ms to minimize.
[2024-05-23 16:09:15] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2024-05-23 16:09:15] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 81 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 68/81 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:09:17] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:09:17] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:09:18] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:09:18] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:09:19] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:09:19] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 3 ms to minimize.
[2024-05-23 16:09:19] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 3 ms to minimize.
[2024-05-23 16:09:19] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:09:19] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:09:20] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 3 ms to minimize.
[2024-05-23 16:09:20] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:09:20] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:09:21] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:09:21] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/279 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/355 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/751 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:09:30] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:09:30] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:09:30] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:09:33] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:09:33] [INFO ] Deduced a trap composed of 62 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:09:34] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:09:34] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:09:35] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-23 16:09:36] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:09:38] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:09:38] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 11/762 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 762 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 93/93 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61203 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 198 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1022050 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :0 out of 1
Probabilistic random walk after 1022050 steps, saw 220969 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
[2024-05-23 16:09:49] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:09:49] [INFO ] Invariant cache hit.
[2024-05-23 16:09:49] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
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) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 90/420 variables, 78/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 48/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:09:50] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-23 16:09:50] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:09:50] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:09:50] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/330 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 90/420 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 48/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 825ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 180 transition count 344
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 116 transition count 332
Applied a total of 136 rules in 27 ms. Remains 116 /184 variables (removed 68) and now considering 332/400 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 116/184 places, 332/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1447 ms. (steps per millisecond=400 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1448 ms. (steps per millisecond=400 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-23 16:09:52] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:09:52] [INFO ] Invariant cache hit.
[2024-05-23 16:09:52] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-23 16:09:52] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:09:52] [INFO ] Invariant cache hit.
[2024-05-23 16:09:52] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:09:53] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:09:53] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:09:53] [INFO ] Invariant cache hit.
[2024-05-23 16:09:53] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:09:55] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:09:55] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:09:56] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 4 ms to minimize.
[2024-05-23 16:09:56] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 3 ms to minimize.
[2024-05-23 16:09:56] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:09:56] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:09:57] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-05-23 16:09:57] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:09:57] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 3 ms to minimize.
[2024-05-23 16:09:57] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:09:57] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 3 ms to minimize.
[2024-05-23 16:09:57] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:09:58] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:09:58] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 3 ms to minimize.
[2024-05-23 16:09:58] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 3 ms to minimize.
[2024-05-23 16:09:58] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 3 ms to minimize.
[2024-05-23 16:09:58] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:09:58] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:09:59] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:09:59] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:09:59] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:09:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-23 16:09:59] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 16:10:00] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:10:00] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:10:00] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:10:00] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:10:00] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:10:00] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 3 ms to minimize.
[2024-05-23 16:10:01] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 3 ms to minimize.
[2024-05-23 16:10:01] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:10:01] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:10:01] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:10:01] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:10:01] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-23 16:10:02] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:10:04] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:10:04] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
[2024-05-23 16:10:05] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:10:05] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:10:08] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:10:09] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:10:10] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:10:10] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:10:10] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 4 ms to minimize.
[2024-05-23 16:10:11] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 3 ms to minimize.
[2024-05-23 16:10:11] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 4 ms to minimize.
[2024-05-23 16:10:11] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:10:11] [INFO ] Deduced a trap composed of 36 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:10:12] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 17 ms to minimize.
[2024-05-23 16:10:12] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:10:12] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2024-05-23 16:10:12] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 3 ms to minimize.
[2024-05-23 16:10:14] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:10:14] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:10:14] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:10:15] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:10:22] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:10:22] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:10:23] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:10:25] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:10:25] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:10:25] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:10:25] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 3 ms to minimize.
[2024-05-23 16:10:25] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:10:26] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 10 ms to minimize.
[2024-05-23 16:10:26] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:10:26] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:10:26] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:10:26] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-05-23 16:10:28] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 3 ms to minimize.
[2024-05-23 16:10:28] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2024-05-23 16:10:29] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 3 ms to minimize.
[2024-05-23 16:10:29] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:10:29] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 3 ms to minimize.
[2024-05-23 16:10:29] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:10:29] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:10:31] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:10:41] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 2 ms to minimize.
[2024-05-23 16:10:42] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 3 ms to minimize.
[2024-05-23 16:10:45] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 3 ms to minimize.
[2024-05-23 16:10:45] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 3 ms to minimize.
[2024-05-23 16:10:46] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:10:47] [INFO ] Deduced a trap composed of 55 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:10:48] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-05-23 16:10:48] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:10:50] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 3 ms to minimize.
[2024-05-23 16:10:50] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:10:50] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:10:51] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2024-05-23 16:10:51] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Finished structural reductions in LTL mode , in 1 iterations and 60717 ms. Remains : 184/184 places, 400/400 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 981000 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :0 out of 1
Probabilistic random walk after 981000 steps, saw 212382 distinct states, run finished after 3005 ms. (steps per millisecond=326 ) properties seen :0
[2024-05-23 16:10:56] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:10:56] [INFO ] Invariant cache hit.
[2024-05-23 16:10:56] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
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) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 90/420 variables, 78/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/420 variables, 48/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/420 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/90 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 130/224 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/252 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/326 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/330 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:10:57] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:10:57] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:10:57] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 3 ms to minimize.
[2024-05-23 16:10:57] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/330 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 90/420 variables, 78/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 48/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/420 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 396
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 180 transition count 396
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 180 transition count 344
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 116 transition count 332
Applied a total of 136 rules in 40 ms. Remains 116 /184 variables (removed 68) and now considering 332/400 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 116/184 places, 332/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1732 ms. (steps per millisecond=334 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1732 ms. (steps per millisecond=334 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Product exploration explored 100000 steps with 0 reset in 236 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 400
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 4 place count 184 transition count 464
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 52 place count 184 transition count 464
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 184 transition count 464
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 180 transition count 460
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 180 transition count 460
Deduced a syphon composed of 64 places in 1 ms
Applied a total of 76 rules in 57 ms. Remains 180 /184 variables (removed 4) and now considering 460/400 (removed -60) transitions.
[2024-05-23 16:11:01] [INFO ] Redundant transitions in 48 ms returned []
Running 456 sub problems to find dead transitions.
[2024-05-23 16:11:01] [INFO ] Flow matrix only has 264 transitions (discarded 196 similar events)
// Phase 1: matrix 264 rows 180 cols
[2024-05-23 16:11:01] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 16:11:01] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 456 unsolved
[2024-05-23 16:11:05] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:11:05] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-23 16:11:05] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-23 16:11:05] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-23 16:11:05] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-23 16:11:05] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-23 16:11:06] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-23 16:11:06] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-23 16:11:06] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-23 16:11:06] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-23 16:11:06] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:11:06] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 4 ms to minimize.
[2024-05-23 16:11:06] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-23 16:11:06] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 3 ms to minimize.
[2024-05-23 16:11:07] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:11:07] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:11:07] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:11:07] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 3 ms to minimize.
[2024-05-23 16:11:07] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:11:08] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/33 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:11:08] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 3 ms to minimize.
[2024-05-23 16:11:08] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 3 ms to minimize.
[2024-05-23 16:11:08] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:11:08] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 16:11:09] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 2 ms to minimize.
[2024-05-23 16:11:09] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 3 ms to minimize.
[2024-05-23 16:11:09] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 2 ms to minimize.
[2024-05-23 16:11:10] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:11:11] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 4 ms to minimize.
[2024-05-23 16:11:11] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:11:11] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2024-05-23 16:11:12] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 12/45 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:11:17] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 3 ms to minimize.
[2024-05-23 16:11:17] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-05-23 16:11:17] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 3/48 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:11:20] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:11:20] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 2/50 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:11:23] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-23 16:11:23] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 2/52 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:11:29] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 1/53 constraints. Problems are: Problem set: 128 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/444 variables, and 53 constraints, problems are : Problem set: 128 solved, 328 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 128 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 40/41 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/41 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 64/180 variables, 8/49 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/53 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:11:36] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 2 ms to minimize.
[2024-05-23 16:11:36] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:11:36] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 3 ms to minimize.
[2024-05-23 16:11:36] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 4/57 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:11:40] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 3 ms to minimize.
[2024-05-23 16:11:40] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 3 ms to minimize.
[2024-05-23 16:11:40] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 3 ms to minimize.
[2024-05-23 16:11:40] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:11:41] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 2 ms to minimize.
[2024-05-23 16:11:41] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:11:41] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:11:41] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-23 16:11:42] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:11:42] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 10/67 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:11:44] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:11:44] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 3 ms to minimize.
[2024-05-23 16:11:44] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 3 ms to minimize.
[2024-05-23 16:11:45] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:11:45] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 5/72 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:11:48] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:11:48] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 2/74 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:11:51] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/75 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/75 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 11 (OVERLAPS) 264/444 variables, 180/255 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 119/374 constraints. Problems are: Problem set: 128 solved, 328 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 328/702 constraints. Problems are: Problem set: 128 solved, 328 unsolved
[2024-05-23 16:12:01] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 703 constraints, problems are : Problem set: 128 solved, 328 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 328/456 constraints, Known Traps: 63/63 constraints]
After SMT, in 60244ms problems are : Problem set: 128 solved, 328 unsolved
Search for dead transitions found 128 dead transitions in 60254ms
Found 128 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 128 transitions
Dead transitions reduction (with SMT) removed 128 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 180/184 places, 332/400 transitions.
Graph (complete) has 856 edges and 180 vertex of which 116 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.8 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 35 ms. Remains 116 /180 variables (removed 64) and now considering 332/332 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/184 places, 332/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60409 ms. Remains : 116/184 places, 332/400 transitions.
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-23 16:12:01] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-23 16:12:01] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 16:12:01] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-23 16:12:01] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:12:01] [INFO ] Invariant cache hit.
[2024-05-23 16:12:02] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:12:02] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:12:02] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:12:02] [INFO ] Invariant cache hit.
[2024-05-23 16:12:02] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:12:05] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-23 16:12:05] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 3 ms to minimize.
[2024-05-23 16:12:05] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 3 ms to minimize.
[2024-05-23 16:12:06] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 4 ms to minimize.
[2024-05-23 16:12:06] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:12:06] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:12:06] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-23 16:12:06] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 4 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 2 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:12:07] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 2 ms to minimize.
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 2 ms to minimize.
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 3 ms to minimize.
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:12:08] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:12:09] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:12:10] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 4 ms to minimize.
[2024-05-23 16:12:10] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:12:10] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-05-23 16:12:10] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 2 ms to minimize.
[2024-05-23 16:12:10] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 4 ms to minimize.
[2024-05-23 16:12:10] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:12:11] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:12:11] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 3 ms to minimize.
[2024-05-23 16:12:11] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:12:11] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 4 ms to minimize.
[2024-05-23 16:12:11] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-05-23 16:12:11] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:12:13] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:12:14] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:12:14] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 3 ms to minimize.
[2024-05-23 16:12:14] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:12:17] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:12:17] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:12:18] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:12:18] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 3 ms to minimize.
[2024-05-23 16:12:19] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 3 ms to minimize.
[2024-05-23 16:12:19] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 3 ms to minimize.
[2024-05-23 16:12:19] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 3 ms to minimize.
[2024-05-23 16:12:20] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:12:20] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 4 ms to minimize.
[2024-05-23 16:12:20] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:12:21] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:12:21] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 3 ms to minimize.
[2024-05-23 16:12:21] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:12:22] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:12:22] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:12:22] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:12:24] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:12:30] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 4 ms to minimize.
[2024-05-23 16:12:31] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:12:31] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:12:33] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:12:33] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:12:34] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:12:34] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:12:34] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
[2024-05-23 16:12:34] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:12:34] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:12:34] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 2 ms to minimize.
[2024-05-23 16:12:35] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-23 16:12:35] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-05-23 16:12:37] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:12:37] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:12:37] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 2 ms to minimize.
[2024-05-23 16:12:37] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 3 ms to minimize.
[2024-05-23 16:12:38] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 3 ms to minimize.
[2024-05-23 16:12:38] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-23 16:12:38] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:12:39] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:12:51] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:12:52] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 4 ms to minimize.
[2024-05-23 16:12:54] [INFO ] Deduced a trap composed of 62 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:12:55] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 3 ms to minimize.
[2024-05-23 16:12:56] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:12:57] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:12:58] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 3 ms to minimize.
[2024-05-23 16:12:58] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-23 16:13:00] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 3 ms to minimize.
[2024-05-23 16:13:00] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:13:00] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:13:01] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 3 ms to minimize.
[2024-05-23 16:13:01] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Finished structural reductions in LTL mode , in 1 iterations and 61192 ms. Remains : 184/184 places, 400/400 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-02 finished in 258317 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(G(p0))&&F(p1))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 8 place count 186 transition count 370
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 108 place count 136 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 131 transition count 350
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 131 transition count 350
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 119 transition count 338
Applied a total of 142 rules in 51 ms. Remains 119 /190 variables (removed 71) and now considering 338/424 (removed 86) transitions.
[2024-05-23 16:13:03] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
// Phase 1: matrix 174 rows 119 cols
[2024-05-23 16:13:03] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 16:13:03] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-23 16:13:03] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
[2024-05-23 16:13:03] [INFO ] Invariant cache hit.
[2024-05-23 16:13:03] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-23 16:13:03] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-23 16:13:03] [INFO ] Redundant transitions in 8 ms returned []
Running 334 sub problems to find dead transitions.
[2024-05-23 16:13:03] [INFO ] Flow matrix only has 174 transitions (discarded 164 similar events)
[2024-05-23 16:13:03] [INFO ] Invariant cache hit.
[2024-05-23 16:13:03] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 3 ms to minimize.
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:13:06] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:13:07] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:13:07] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 16:13:07] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:13:07] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-05-23 16:13:07] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:13:07] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:13:07] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:13:08] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-23 16:13:08] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:13:08] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2024-05-23 16:13:08] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:13:08] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:09] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:13:09] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:13:10] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:13:10] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:14] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 3 ms to minimize.
[2024-05-23 16:13:14] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:13:14] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-05-23 16:13:14] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:13:14] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
[2024-05-23 16:13:15] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:13:15] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:17] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:13:17] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:13:17] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:13:18] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:13:18] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:20] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 3 ms to minimize.
[2024-05-23 16:13:20] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-05-23 16:13:21] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:24] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 3 ms to minimize.
[2024-05-23 16:13:25] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:27] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:13:27] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:13:27] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:13:27] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:13:27] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:13:28] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 2 ms to minimize.
[2024-05-23 16:13:28] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-23 16:13:28] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 2 ms to minimize.
[2024-05-23 16:13:28] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:13:28] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:13:28] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:13:28] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:13:29] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:13:29] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:30] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 3 ms to minimize.
[2024-05-23 16:13:30] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:13:30] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:13:31] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:13:31] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:13:31] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:13:31] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:13:31] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:13:31] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:13:32] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2024-05-23 16:13:32] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:13:32] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/293 variables, and 80 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/79 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:35] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:37] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 174/293 variables, 119/201 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 79/280 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 334/614 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:43] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:13:44] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:13:45] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:13:45] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:13:45] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 5/619 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:51] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-23 16:13:59] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 621 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 76/76 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in SI_LTL mode, iteration 1 : 119/190 places, 338/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60877 ms. Remains : 119/190 places, 338/424 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 129 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-06 finished in 61161 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((p0||(!p1 U (X(!p2)||G(!p1))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 6 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-23 16:14:04] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-23 16:14:04] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 16:14:04] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-23 16:14:04] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:14:04] [INFO ] Invariant cache hit.
[2024-05-23 16:14:04] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:14:04] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:14:04] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:14:04] [INFO ] Invariant cache hit.
[2024-05-23 16:14:04] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:14:06] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-23 16:14:06] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:14:06] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-23 16:14:07] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:14:07] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:14:07] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:14:07] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:14:07] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:14:07] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:14:07] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:14:07] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:14:08] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-05-23 16:14:08] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-23 16:14:08] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-23 16:14:08] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:14:08] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:14:08] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:14:08] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:14:08] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:14:08] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:14:09] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 16:14:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 16:14:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 16:14:09] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:14:09] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:14:09] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:14:09] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:14:10] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:14:10] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:14:10] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:14:10] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:14:10] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:14:10] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:14:10] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:14:10] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 16:14:11] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-23 16:14:12] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:14:12] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:14:12] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:14:13] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:14:15] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:14:15] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:14:16] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:14:16] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:14:16] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:14:16] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:14:16] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:14:16] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-05-23 16:14:17] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:14:17] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-05-23 16:14:17] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:14:17] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-23 16:14:17] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:14:18] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:14:18] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:14:18] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:14:19] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:14:23] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:14:23] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:14:24] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:14:27] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 3 ms to minimize.
[2024-05-23 16:14:27] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:14:28] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 3 ms to minimize.
[2024-05-23 16:14:28] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-05-23 16:14:28] [INFO ] Deduced a trap composed of 56 places in 167 ms of which 3 ms to minimize.
[2024-05-23 16:14:28] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 3 ms to minimize.
[2024-05-23 16:14:29] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:14:29] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-05-23 16:14:29] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (OVERLAPS) 236/420 variables, 184/266 constraints. Problems are: Problem set: 0 solved, 396 unsolved
SMT process timed out in 30108ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30114ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30724 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, p2, (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), (AND p2 p1)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-07
Product exploration explored 100000 steps with 19012 reset in 169 ms.
Product exploration explored 100000 steps with 19079 reset in 190 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 p2 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 7 factoid took 260 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
RANDOM walk for 40000 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
[2024-05-23 16:14:36] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:14:36] [INFO ] Invariant cache hit.
[2024-05-23 16:14:36] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:14:36] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/322 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 18/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/336 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 37/373 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/375 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 45/420 variables, 39/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/420 variables, 31/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 274 constraints, problems are : Problem set: 0 solved, 2 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/322 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 14/336 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 37/373 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/375 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:14:37] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/375 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 45/420 variables, 39/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 31/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1094ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 2 properties in 10 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 401 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 201 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Support contains 4 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-23 16:14:37] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:14:37] [INFO ] Invariant cache hit.
[2024-05-23 16:14:38] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-23 16:14:38] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:14:38] [INFO ] Invariant cache hit.
[2024-05-23 16:14:38] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:14:38] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:14:38] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:14:38] [INFO ] Invariant cache hit.
[2024-05-23 16:14:38] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:14:41] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:14:41] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:14:41] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:14:42] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:14:42] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:14:42] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
[2024-05-23 16:14:42] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:14:42] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 3 ms to minimize.
[2024-05-23 16:14:42] [INFO ] Deduced a trap composed of 67 places in 176 ms of which 4 ms to minimize.
[2024-05-23 16:14:42] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 2 ms to minimize.
[2024-05-23 16:14:43] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:14:43] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:14:43] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-23 16:14:43] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:14:43] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:14:43] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 2 ms to minimize.
[2024-05-23 16:14:44] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:14:44] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-23 16:14:44] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:14:44] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:14:44] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-23 16:14:45] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:14:45] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-23 16:14:45] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:14:45] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-05-23 16:14:45] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:14:45] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:14:46] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:14:46] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 3 ms to minimize.
[2024-05-23 16:14:46] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 4 ms to minimize.
[2024-05-23 16:14:46] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:14:46] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 3 ms to minimize.
[2024-05-23 16:14:47] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 2 ms to minimize.
[2024-05-23 16:14:47] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:14:47] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 16:14:47] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-23 16:14:49] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 3 ms to minimize.
[2024-05-23 16:14:49] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 3 ms to minimize.
[2024-05-23 16:14:50] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 4 ms to minimize.
[2024-05-23 16:14:50] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:14:54] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:14:54] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:14:55] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 2 ms to minimize.
[2024-05-23 16:14:55] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:14:56] [INFO ] Deduced a trap composed of 55 places in 204 ms of which 3 ms to minimize.
[2024-05-23 16:14:56] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 3 ms to minimize.
[2024-05-23 16:14:56] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 3 ms to minimize.
[2024-05-23 16:14:57] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:14:57] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 2 ms to minimize.
[2024-05-23 16:14:57] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 2 ms to minimize.
[2024-05-23 16:14:57] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-05-23 16:14:58] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 3 ms to minimize.
[2024-05-23 16:14:58] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 2 ms to minimize.
[2024-05-23 16:14:59] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 3 ms to minimize.
[2024-05-23 16:14:59] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2024-05-23 16:14:59] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:15:00] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:15:05] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:15:05] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:15:06] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:15:08] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 2 ms to minimize.
[2024-05-23 16:15:08] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 1 ms to minimize.
SMT process timed out in 30139ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30144ms
Finished structural reductions in LTL mode , in 1 iterations and 30933 ms. Remains : 184/184 places, 400/400 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 p2 (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
RANDOM walk for 40000 steps (8 resets) in 405 ms. (98 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2024-05-23 16:15:09] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:15:09] [INFO ] Invariant cache hit.
[2024-05-23 16:15:09] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:15:09] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/322 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 18/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/336 variables, 6/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 37/373 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/375 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 45/420 variables, 39/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/420 variables, 31/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 274 constraints, problems are : Problem set: 0 solved, 2 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/122 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 13/135 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 177/312 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 24/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/322 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 14/336 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/336 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 37/373 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/375 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 16:15:10] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/375 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 45/420 variables, 39/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 31/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/420 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 277 constraints, problems are : Problem set: 0 solved, 2 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 931ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 3814 steps, including 118 resets, run visited all 2 properties in 69 ms. (steps per millisecond=55 )
Parikh walk visited 2 properties in 69 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F p1), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 158 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Stuttering acceptance computed with spot in 160 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Product exploration explored 100000 steps with 18987 reset in 176 ms.
Product exploration explored 100000 steps with 19014 reset in 190 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[true, p2, (AND p2 p1), (AND p2 p1), (AND p2 p1)]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 184 transition count 400
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 4 place count 184 transition count 462
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 51 place count 184 transition count 462
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 67 place count 184 transition count 462
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 180 transition count 458
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 180 transition count 458
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 75 rules in 31 ms. Remains 180 /184 variables (removed 4) and now considering 458/400 (removed -58) transitions.
[2024-05-23 16:15:12] [INFO ] Redundant transitions in 5 ms returned []
Running 454 sub problems to find dead transitions.
[2024-05-23 16:15:12] [INFO ] Flow matrix only has 263 transitions (discarded 195 similar events)
// Phase 1: matrix 263 rows 180 cols
[2024-05-23 16:15:12] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 16:15:12] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 454 unsolved
[2024-05-23 16:15:14] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:15:14] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-23 16:15:14] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-23 16:15:14] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-23 16:15:14] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:15:15] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:15:16] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:15:16] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:15:16] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:15:16] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/33 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-23 16:15:16] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:15:17] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-23 16:15:17] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:15:17] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:15:17] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:15:17] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:15:17] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:15:18] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:15:18] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 2 ms to minimize.
[2024-05-23 16:15:18] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:15:18] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:15:18] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:15:18] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-23 16:15:18] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:15:18] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:15:19] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:15:19] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:15:19] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:15:19] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:15:19] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 20/53 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-23 16:15:22] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:15:22] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:15:22] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:15:22] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:15:22] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:15:23] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:15:23] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:15:23] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 3 ms to minimize.
[2024-05-23 16:15:24] [INFO ] Deduced a trap composed of 45 places in 186 ms of which 3 ms to minimize.
[2024-05-23 16:15:24] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 10/63 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-23 16:15:26] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:15:26] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:15:26] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
[2024-05-23 16:15:27] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2024-05-23 16:15:27] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:15:27] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:15:27] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:15:28] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 8/71 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-23 16:15:31] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 1/72 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-23 16:15:36] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:15:36] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:15:37] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:15:37] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 4/76 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-23 16:15:40] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 3 ms to minimize.
[2024-05-23 16:15:40] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 3 ms to minimize.
[2024-05-23 16:15:40] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 7 ms to minimize.
[2024-05-23 16:15:40] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 3 ms to minimize.
[2024-05-23 16:15:41] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 5/81 constraints. Problems are: Problem set: 125 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/443 variables, and 81 constraints, problems are : Problem set: 125 solved, 329 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/180 constraints, ReadFeed: 0/118 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 125 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 68/69 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/69 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 63/180 variables, 8/77 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 4/81 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-23 16:15:47] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:15:47] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:15:47] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 3 ms to minimize.
[2024-05-23 16:15:47] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:15:48] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 2 ms to minimize.
[2024-05-23 16:15:48] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:15:48] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 3 ms to minimize.
[2024-05-23 16:15:48] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-23 16:15:49] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2024-05-23 16:15:49] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:15:49] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 11/92 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-23 16:15:51] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:15:51] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-05-23 16:15:51] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:15:51] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:15:52] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-05-23 16:15:52] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-05-23 16:15:52] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2024-05-23 16:15:52] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:15:52] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:15:52] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:15:53] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:15:53] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 4 ms to minimize.
[2024-05-23 16:15:53] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 1 ms to minimize.
[2024-05-23 16:15:53] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:15:54] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-05-23 16:15:54] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 3 ms to minimize.
[2024-05-23 16:15:54] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:15:55] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 18/110 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-23 16:15:57] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 3 ms to minimize.
[2024-05-23 16:15:57] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:15:58] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:15:58] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-05-23 16:15:58] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 5/115 constraints. Problems are: Problem set: 125 solved, 329 unsolved
[2024-05-23 16:16:02] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 3 ms to minimize.
[2024-05-23 16:16:03] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-05-23 16:16:03] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 2 ms to minimize.
[2024-05-23 16:16:04] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 4/119 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/119 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 10 (OVERLAPS) 263/443 variables, 180/299 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 118/417 constraints. Problems are: Problem set: 125 solved, 329 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/443 variables, 329/746 constraints. Problems are: Problem set: 125 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 746 constraints, problems are : Problem set: 125 solved, 329 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 329/454 constraints, Known Traps: 106/106 constraints]
After SMT, in 60171ms problems are : Problem set: 125 solved, 329 unsolved
Search for dead transitions found 125 dead transitions in 60178ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 180/184 places, 333/400 transitions.
Graph (complete) has 857 edges and 180 vertex of which 117 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.2 ms
Discarding 63 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 117 /180 variables (removed 63) and now considering 333/333 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 117/184 places, 333/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60248 ms. Remains : 117/184 places, 333/400 transitions.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-23 16:16:12] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-23 16:16:12] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 16:16:12] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-23 16:16:12] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:16:12] [INFO ] Invariant cache hit.
[2024-05-23 16:16:12] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:16:13] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:16:13] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:16:13] [INFO ] Invariant cache hit.
[2024-05-23 16:16:13] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:16:15] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:16:16] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:16:16] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2024-05-23 16:16:16] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 3 ms to minimize.
[2024-05-23 16:16:16] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 3 ms to minimize.
[2024-05-23 16:16:17] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 2 ms to minimize.
[2024-05-23 16:16:17] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2024-05-23 16:16:17] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-23 16:16:17] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 2 ms to minimize.
[2024-05-23 16:16:17] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:16:17] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:16:17] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:16:17] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-23 16:16:17] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:16:18] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:16:18] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:16:18] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:16:18] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-05-23 16:16:18] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 3 ms to minimize.
[2024-05-23 16:16:18] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:16:19] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-05-23 16:16:19] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:16:19] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-23 16:16:20] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 4 ms to minimize.
[2024-05-23 16:16:20] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:16:20] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:16:20] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-23 16:16:20] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:16:21] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 3 ms to minimize.
[2024-05-23 16:16:21] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 4 ms to minimize.
[2024-05-23 16:16:21] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
[2024-05-23 16:16:21] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:16:21] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:16:21] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-23 16:16:22] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 16:16:22] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:16:24] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 3 ms to minimize.
[2024-05-23 16:16:24] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:16:25] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 3 ms to minimize.
[2024-05-23 16:16:25] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:16:28] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 2 ms to minimize.
[2024-05-23 16:16:28] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 2 ms to minimize.
[2024-05-23 16:16:29] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:16:29] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:16:30] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 4 ms to minimize.
[2024-05-23 16:16:30] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 4 ms to minimize.
[2024-05-23 16:16:30] [INFO ] Deduced a trap composed of 47 places in 202 ms of which 3 ms to minimize.
[2024-05-23 16:16:30] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 3 ms to minimize.
[2024-05-23 16:16:31] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:16:31] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:16:31] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 3 ms to minimize.
[2024-05-23 16:16:32] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:16:32] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 2 ms to minimize.
[2024-05-23 16:16:33] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 1 ms to minimize.
[2024-05-23 16:16:33] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 3 ms to minimize.
[2024-05-23 16:16:33] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:16:35] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:16:41] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 3 ms to minimize.
[2024-05-23 16:16:42] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 3 ms to minimize.
[2024-05-23 16:16:42] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 3 ms to minimize.
(s169 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.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 1.0)
(s169 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/420 variables, and 73 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/184 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:16:45] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:16:45] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:16:45] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:16:45] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:16:45] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2024-05-23 16:16:46] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 2 ms to minimize.
[2024-05-23 16:16:46] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 3 ms to minimize.
[2024-05-23 16:16:46] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 2 ms to minimize.
[2024-05-23 16:16:46] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 2 ms to minimize.
[2024-05-23 16:16:46] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 3 ms to minimize.
[2024-05-23 16:16:48] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:16:48] [INFO ] Deduced a trap composed of 43 places in 154 ms of which 3 ms to minimize.
[2024-05-23 16:16:49] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 3 ms to minimize.
[2024-05-23 16:16:49] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:16:49] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:16:49] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 3 ms to minimize.
[2024-05-23 16:16:50] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-05-23 16:16:51] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 236/420 variables, 184/275 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 76/351 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 396/747 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:17:01] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:17:02] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 3 ms to minimize.
[2024-05-23 16:17:05] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:17:05] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:17:06] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-05-23 16:17:06] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 4 ms to minimize.
[2024-05-23 16:17:07] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:17:08] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:17:09] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:17:09] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:17:09] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:17:10] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:17:10] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 13/760 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 760 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 91/91 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Finished structural reductions in LTL mode , in 1 iterations and 61142 ms. Remains : 184/184 places, 400/400 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-07 finished in 189243 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)))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 186 transition count 369
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 135 transition count 369
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 129 transition count 345
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 117 transition count 333
Applied a total of 146 rules in 23 ms. Remains 117 /190 variables (removed 73) and now considering 333/424 (removed 91) transitions.
[2024-05-23 16:17:13] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2024-05-23 16:17:13] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 16:17:13] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-23 16:17:13] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-23 16:17:13] [INFO ] Invariant cache hit.
[2024-05-23 16:17:13] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:17:13] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-23 16:17:13] [INFO ] Redundant transitions in 2 ms returned []
Running 329 sub problems to find dead transitions.
[2024-05-23 16:17:13] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-23 16:17:13] [INFO ] Invariant cache hit.
[2024-05-23 16:17:13] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:17:15] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:17:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 16:17:15] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:17:15] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:17:15] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:17:15] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-23 16:17:15] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-23 16:17:16] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:17:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-23 16:17:16] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:17:16] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:17:16] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-23 16:17:16] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:17:16] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:17:16] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:17:17] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:17:17] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:17:17] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:17:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-23 16:17:17] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:17:17] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-23 16:17:18] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:17:18] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:17:18] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:17:18] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:17:18] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:17:18] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-23 16:17:18] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:17:19] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:17:19] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:17:19] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:17:19] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 1 ms to minimize.
[2024-05-23 16:17:19] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:17:19] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:17:19] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:17:19] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:17:22] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:17:22] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:17:23] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:17:23] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:17:24] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:17:24] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:17:25] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:17:25] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:17:25] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-23 16:17:25] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:17:25] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-23 16:17:25] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-23 16:17:25] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:17:26] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:17:28] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:17:28] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:17:28] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:17:28] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:17:28] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:17:28] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:17:28] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 2 ms to minimize.
[2024-05-23 16:17:29] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:17:30] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:17:30] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (OVERLAPS) 169/286 variables, 117/190 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 76/266 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:17:36] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:17:36] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:17:36] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:17:36] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-23 16:17:36] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:17:41] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:17:41] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:17:44] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:17:44] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
SMT process timed out in 30154ms, After SMT, problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 30158ms
Starting structural reductions in SI_LTL mode, iteration 1 : 117/190 places, 333/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30722 ms. Remains : 117/190 places, 333/424 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 127 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-10 finished in 30912 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' '!(((p0 U X(p1)) U (p2||F(p3))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 185 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 185 transition count 404
Applied a total of 10 rules in 5 ms. Remains 185 /190 variables (removed 5) and now considering 404/424 (removed 20) transitions.
[2024-05-23 16:17:44] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-05-23 16:17:44] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 16:17:44] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-23 16:17:44] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-23 16:17:44] [INFO ] Invariant cache hit.
[2024-05-23 16:17:44] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-23 16:17:44] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-23 16:17:44] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-23 16:17:44] [INFO ] Invariant cache hit.
[2024-05-23 16:17:44] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:17:47] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:17:47] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:17:47] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:17:47] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:17:47] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:17:47] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:17:48] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:17:48] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:17:48] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:17:48] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:17:48] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:17:48] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:17:48] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:17:48] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:17:48] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:17:49] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:17:49] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:17:49] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:17:49] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:17:49] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:17:49] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:17:49] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:17:50] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 3 ms to minimize.
[2024-05-23 16:17:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 16:17:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 16:17:50] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:17:50] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:17:50] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:17:51] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
[2024-05-23 16:17:51] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 3 ms to minimize.
[2024-05-23 16:17:51] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:17:51] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 3 ms to minimize.
[2024-05-23 16:17:51] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:17:51] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:17:51] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 2 ms to minimize.
[2024-05-23 16:17:51] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
[2024-05-23 16:17:52] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:17:52] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:17:52] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:17:52] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:17:55] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-23 16:17:55] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
[2024-05-23 16:17:55] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:17:55] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:17:55] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:17:57] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:17:57] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:17:57] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:17:58] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:17:58] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:18:00] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:18:01] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 3 ms to minimize.
[2024-05-23 16:18:01] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:02] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:18:02] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:18:02] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:18:03] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:18:03] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-23 16:18:04] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:18:04] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:18:04] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:07] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:18:07] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:18:09] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:18:09] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:18:09] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:10] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:18:10] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:18:10] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:18:10] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:18:11] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:18:11] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:18:12] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:18:12] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:18:12] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:18:12] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:18:12] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:18:12] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:18:13] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:18:13] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:18:13] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:18:13] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:18:13] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:18:13] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:18:13] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 400 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 185/425 variables, and 98 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/185 constraints, ReadFeed: 0/79 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 85/98 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:16] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:18:17] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:18:17] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:18:17] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:18:18] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:18:18] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 1 ms to minimize.
[2024-05-23 16:18:18] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:18:19] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:19] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 1 ms to minimize.
[2024-05-23 16:18:19] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:18:19] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:18:21] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:18:22] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:18:22] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:18:22] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 7/113 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:25] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:18:26] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:26] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:18:26] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2024-05-23 16:18:27] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:18:27] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:18:27] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (OVERLAPS) 240/425 variables, 185/305 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 79/384 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 400/784 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:39] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:18:39] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:18:39] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:18:39] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:18:39] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:18:39] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:18:42] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:18:44] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:18:44] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:18:44] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 794 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 185/185 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 117/117 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 404/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60777 ms. Remains : 185/190 places, 404/424 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 124 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 1 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-11 finished in 61097 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' '!((p0 U X(G(p1))))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 185 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 185 transition count 404
Applied a total of 10 rules in 4 ms. Remains 185 /190 variables (removed 5) and now considering 404/424 (removed 20) transitions.
[2024-05-23 16:18:45] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
// Phase 1: matrix 240 rows 185 cols
[2024-05-23 16:18:45] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 16:18:45] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-23 16:18:45] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-23 16:18:45] [INFO ] Invariant cache hit.
[2024-05-23 16:18:45] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-23 16:18:46] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-23 16:18:46] [INFO ] Flow matrix only has 240 transitions (discarded 164 similar events)
[2024-05-23 16:18:46] [INFO ] Invariant cache hit.
[2024-05-23 16:18:46] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:48] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:18:48] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:18:48] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:18:48] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2024-05-23 16:18:49] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:18:49] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:18:49] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:18:49] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:18:49] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:18:49] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:18:49] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:18:49] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 1 ms to minimize.
[2024-05-23 16:18:49] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:18:49] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:18:50] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:18:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 16:18:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 16:18:50] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:18:50] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:18:50] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:51] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:18:51] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:18:51] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:18:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 16:18:51] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:18:52] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 16:18:52] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-05-23 16:18:53] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-23 16:18:53] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2024-05-23 16:18:54] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:18:54] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:18:54] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:18:54] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:18:54] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:18:54] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:18:54] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:18:54] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-23 16:18:54] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:18:55] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:18:55] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:18:57] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:18:58] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:18:58] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:18:58] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:18:59] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:18:59] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:18:59] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-05-23 16:19:00] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:19:00] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:19:00] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:19:00] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:19:00] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:19:00] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:19:01] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:19:01] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:19:02] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:19:02] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:19:02] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:19:02] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:19:03] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:19:04] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-05-23 16:19:04] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:19:04] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:19:05] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:19:05] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-23 16:19:10] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:19:12] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 9 (OVERLAPS) 240/425 variables, 185/265 constraints. Problems are: Problem set: 0 solved, 400 unsolved
SMT process timed out in 30123ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30128ms
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 404/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30787 ms. Remains : 185/190 places, 404/424 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-12 finished in 30898 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)))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 186 transition count 369
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 135 transition count 369
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 129 transition count 345
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 146 place count 117 transition count 333
Applied a total of 146 rules in 27 ms. Remains 117 /190 variables (removed 73) and now considering 333/424 (removed 91) transitions.
[2024-05-23 16:19:16] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2024-05-23 16:19:16] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 16:19:16] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-23 16:19:16] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-23 16:19:16] [INFO ] Invariant cache hit.
[2024-05-23 16:19:16] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:19:16] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-05-23 16:19:16] [INFO ] Redundant transitions in 2 ms returned []
Running 329 sub problems to find dead transitions.
[2024-05-23 16:19:16] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2024-05-23 16:19:16] [INFO ] Invariant cache hit.
[2024-05-23 16:19:16] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:18] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:19:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-23 16:19:18] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-23 16:19:18] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-23 16:19:18] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-23 16:19:18] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:19:18] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:19:18] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:19:19] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:20] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:19:20] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:19:20] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:19:20] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:19:20] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:19:20] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:19:20] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:19:21] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:19:21] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:19:21] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:19:21] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:19:21] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-23 16:19:21] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:19:21] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:19:21] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:19:21] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:19:21] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:19:22] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:19:22] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:24] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:19:24] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:19:24] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:19:24] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:19:25] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:19:25] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:19:25] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-23 16:19:25] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:19:25] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:27] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:28] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:31] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:19:31] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:32] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:19:33] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:34] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-23 16:19:34] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:19:34] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:19:34] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:19:35] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 11 (OVERLAPS) 169/286 variables, 117/189 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 76/265 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 14 (OVERLAPS) 0/286 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 265 constraints, problems are : Problem set: 0 solved, 329 unsolved in 29874 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:48] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:19:48] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:50] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:19:50] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:52] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-23 16:19:52] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-23 16:19:52] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-23 16:19:52] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:53] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-23 16:19:54] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:19:54] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:19:54] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-23 16:19:54] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-23 16:19:54] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:55] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-05-23 16:19:56] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:19:58] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:19:59] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:20:01] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-05-23 16:20:01] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 11 (OVERLAPS) 169/286 variables, 117/209 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 76/285 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 329/614 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-23 16:20:10] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-23 16:20:12] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/286 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/286 variables, and 616 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 81/81 constraints]
After SMT, in 59985ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 59989ms
Starting structural reductions in SI_LTL mode, iteration 1 : 117/190 places, 333/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60562 ms. Remains : 117/190 places, 333/424 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 129 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA EisenbergMcGuire-PT-04-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-13 finished in 60752 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) U p1)||X(X(G(p1)))||G(p2)))'
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 184 transition count 400
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 184 transition count 400
Applied a total of 12 rules in 4 ms. Remains 184 /190 variables (removed 6) and now considering 400/424 (removed 24) transitions.
[2024-05-23 16:20:17] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-23 16:20:17] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 16:20:17] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-23 16:20:17] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:20:17] [INFO ] Invariant cache hit.
[2024-05-23 16:20:17] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:20:17] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:20:17] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:20:17] [INFO ] Invariant cache hit.
[2024-05-23 16:20:17] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:20:19] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-05-23 16:20:20] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:20:20] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-23 16:20:20] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 3 ms to minimize.
[2024-05-23 16:20:20] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:20:20] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:20:20] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:20:20] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:20:20] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:20:21] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:20:21] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:20:21] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:20:21] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-23 16:20:21] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:20:21] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:20:21] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:20:21] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:20:21] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:20:21] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:20:22] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:20:22] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:20:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 16:20:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 16:20:22] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:20:23] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2024-05-23 16:20:23] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:20:23] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:20:23] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:20:23] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:20:23] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:20:23] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:20:23] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:20:24] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:20:24] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 3 ms to minimize.
[2024-05-23 16:20:24] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-23 16:20:24] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-23 16:20:26] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:20:26] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:20:26] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:20:26] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:20:29] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:20:29] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:20:29] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:20:30] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:20:30] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:20:30] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:20:30] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 3 ms to minimize.
[2024-05-23 16:20:30] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:20:31] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:20:31] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:20:31] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:20:31] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-05-23 16:20:31] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-05-23 16:20:32] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:20:32] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:20:32] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:20:33] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:20:38] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:20:38] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:20:38] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:20:41] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:20:41] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:20:41] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:20:42] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:20:42] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 3 ms to minimize.
[2024-05-23 16:20:42] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:20:42] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:20:42] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:20:43] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (OVERLAPS) 236/420 variables, 184/266 constraints. Problems are: Problem set: 0 solved, 396 unsolved
SMT process timed out in 30115ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30120ms
Starting structural reductions in LTL mode, iteration 1 : 184/190 places, 400/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30760 ms. Remains : 184/190 places, 400/424 transitions.
Stuttering acceptance computed with spot in 495 ms :[(AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 3471 reset in 157 ms.
Product exploration explored 100000 steps with 3586 reset in 181 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 p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 129 ms. Reduced automaton from 11 states, 28 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 319 ms. (125 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 622 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 721 ms. (55 steps per ms) remains 6/6 properties
[2024-05-23 16:20:50] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:20:50] [INFO ] Invariant cache hit.
[2024-05-23 16:20:50] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:20:50] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:20:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 183/322 variables, 139/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/336 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 5/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 37/373 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/375 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 45/420 variables, 39/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 31/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/420 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 275 constraints, problems are : Problem set: 0 solved, 6 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:20:51] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:20:51] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:20:51] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 183/322 variables, 139/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 40/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/336 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 37/373 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:20:51] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:20:51] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:20:51] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/373 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/373 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/375 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/375 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:20:52] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 45/420 variables, 39/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 31/288 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:20:52] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:20:52] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-23 16:20:52] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:20:52] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/420 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/420 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 292 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2227 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 3014ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1278 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 181 transition count 397
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 6 place count 181 transition count 347
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 106 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 119 transition count 335
Applied a total of 130 rules in 20 ms. Remains 119 /184 variables (removed 65) and now considering 335/400 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 119/184 places, 335/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 937 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 58818 steps, run visited all 6 properties in 682 ms. (steps per millisecond=86 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 682 ms. (steps per millisecond=86 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 23 factoid took 438 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-23 16:20:56] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:20:56] [INFO ] Invariant cache hit.
[2024-05-23 16:20:57] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-23 16:20:57] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:20:57] [INFO ] Invariant cache hit.
[2024-05-23 16:20:57] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:20:57] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:20:57] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:20:57] [INFO ] Invariant cache hit.
[2024-05-23 16:20:57] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:20:59] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-23 16:20:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:21:00] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-23 16:21:00] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:21:00] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:21:00] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:21:00] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:21:00] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:21:00] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:21:00] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:21:01] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:21:01] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:21:01] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:21:01] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:21:01] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:21:01] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:21:01] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:21:01] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:21:01] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:21:02] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:21:02] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 16:21:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 16:21:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 16:21:02] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 3 ms to minimize.
[2024-05-23 16:21:03] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 3 ms to minimize.
[2024-05-23 16:21:03] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:21:03] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:21:03] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 3 ms to minimize.
[2024-05-23 16:21:03] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:21:03] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 3 ms to minimize.
[2024-05-23 16:21:03] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:21:03] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 3 ms to minimize.
[2024-05-23 16:21:03] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:21:04] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:21:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-23 16:21:04] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-23 16:21:06] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:21:06] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:21:06] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:21:06] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:21:08] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:21:09] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:21:09] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:21:10] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:21:10] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-23 16:21:10] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:21:10] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 3 ms to minimize.
[2024-05-23 16:21:10] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:21:11] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:21:11] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:21:11] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:21:11] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-23 16:21:11] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:21:12] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:21:12] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:21:12] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:21:13] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:21:18] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 3 ms to minimize.
[2024-05-23 16:21:18] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 3 ms to minimize.
[2024-05-23 16:21:18] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:21:21] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:21:21] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 1 ms to minimize.
[2024-05-23 16:21:22] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:21:22] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:21:22] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:21:22] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:21:22] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:21:23] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 1 ms to minimize.
[2024-05-23 16:21:23] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (OVERLAPS) 236/420 variables, 184/266 constraints. Problems are: Problem set: 0 solved, 396 unsolved
SMT process timed out in 30115ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30120ms
Finished structural reductions in LTL mode , in 1 iterations and 30748 ms. Remains : 184/184 places, 400/400 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 (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 127 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1212 ms. (32 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
[2024-05-23 16:21:28] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:21:28] [INFO ] Invariant cache hit.
[2024-05-23 16:21:29] [INFO ] State equation strengthened by 76 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, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:21:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 183/322 variables, 139/150 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 40/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/336 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/336 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 37/373 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/373 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/375 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 45/420 variables, 39/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 31/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/420 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 274 constraints, problems are : Problem set: 0 solved, 6 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 116/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/134 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/139 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:21:29] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 183/322 variables, 139/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/336 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/336 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:21:30] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/336 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/336 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 37/373 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:21:30] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:21:30] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/373 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/373 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2/375 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/375 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:21:30] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:21:30] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/375 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/375 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 45/420 variables, 39/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/420 variables, 31/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/420 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/420 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 286 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1559 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints]
After SMT, in 2237ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1584 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 400/400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 181 transition count 397
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 6 place count 181 transition count 347
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 106 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 130 place count 119 transition count 335
Applied a total of 130 rules in 17 ms. Remains 119 /184 variables (removed 65) and now considering 335/400 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 119/184 places, 335/400 transitions.
RANDOM walk for 40000 steps (8 resets) in 710 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 58818 steps, run visited all 6 properties in 670 ms. (steps per millisecond=87 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 671 ms. (steps per millisecond=87 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2 p0))), (F p0)]
Knowledge based reduction with 8 factoid took 471 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1843 reset in 148 ms.
Product exploration explored 100000 steps with 1850 reset in 168 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 184 transition count 400
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 3 place count 184 transition count 462
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 50 place count 184 transition count 462
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 65 place count 184 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 181 transition count 459
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 181 transition count 459
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 71 rules in 35 ms. Remains 181 /184 variables (removed 3) and now considering 459/400 (removed -59) transitions.
[2024-05-23 16:21:36] [INFO ] Redundant transitions in 3 ms returned []
Running 455 sub problems to find dead transitions.
[2024-05-23 16:21:36] [INFO ] Flow matrix only has 264 transitions (discarded 195 similar events)
// Phase 1: matrix 264 rows 181 cols
[2024-05-23 16:21:36] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 16:21:36] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-05-23 16:21:38] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-05-23 16:21:39] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:21:40] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:21:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 16:21:40] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-23 16:21:40] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:21:40] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:21:40] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:21:40] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/33 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-23 16:21:41] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:21:41] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:21:41] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:21:41] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:21:41] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:21:41] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:21:42] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-23 16:21:42] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 1 ms to minimize.
[2024-05-23 16:21:42] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:21:42] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
[2024-05-23 16:21:42] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:21:43] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:21:43] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:21:43] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 2 ms to minimize.
[2024-05-23 16:21:43] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:21:43] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:21:43] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:21:44] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:21:44] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:21:44] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 20/53 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-23 16:21:47] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:21:47] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:21:47] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:21:47] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 4/57 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-23 16:21:49] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:21:50] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/59 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/59 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 264/445 variables, 181/240 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 118/358 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-23 16:21:57] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:21:57] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:21:57] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:21:58] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 4/362 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/362 constraints. Problems are: Problem set: 124 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/445 variables, and 362 constraints, problems are : Problem set: 124 solved, 331 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 124 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 50/51 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/51 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 3 (OVERLAPS) 62/181 variables, 8/59 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 4/63 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-23 16:22:09] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:22:10] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/65 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-23 16:22:12] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:22:12] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:22:12] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:22:12] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:22:12] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:22:13] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 6/71 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/71 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 8 (OVERLAPS) 264/445 variables, 181/252 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 118/370 constraints. Problems are: Problem set: 124 solved, 331 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 331/701 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-23 16:22:20] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:22:20] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:22:20] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:22:20] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 4/705 constraints. Problems are: Problem set: 124 solved, 331 unsolved
[2024-05-23 16:22:29] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:22:29] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-23 16:22:32] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:22:32] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 4/709 constraints. Problems are: Problem set: 124 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 709 constraints, problems are : Problem set: 124 solved, 331 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 331/455 constraints, Known Traps: 66/66 constraints]
After SMT, in 60152ms problems are : Problem set: 124 solved, 331 unsolved
Search for dead transitions found 124 dead transitions in 60157ms
Found 124 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 124 transitions
Dead transitions reduction (with SMT) removed 124 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 181/184 places, 335/400 transitions.
Graph (complete) has 859 edges and 181 vertex of which 119 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.2 ms
Discarding 62 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 119 /181 variables (removed 62) and now considering 335/335 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 119/184 places, 335/400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60211 ms. Remains : 119/184 places, 335/400 transitions.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-23 16:22:36] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
// Phase 1: matrix 236 rows 184 cols
[2024-05-23 16:22:36] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 16:22:36] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-23 16:22:36] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:22:36] [INFO ] Invariant cache hit.
[2024-05-23 16:22:36] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:22:37] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-23 16:22:37] [INFO ] Flow matrix only has 236 transitions (discarded 164 similar events)
[2024-05-23 16:22:37] [INFO ] Invariant cache hit.
[2024-05-23 16:22:37] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:22:39] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:22:39] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:22:39] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:22:39] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:22:40] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:22:41] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:22:41] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:22:41] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:22:41] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:22:41] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:22:41] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 16:22:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 16:22:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 16:22:42] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:22:42] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:22:42] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:22:42] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:22:42] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:22:43] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:22:43] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:22:43] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:22:43] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 3 ms to minimize.
[2024-05-23 16:22:43] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:22:43] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-23 16:22:43] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-23 16:22:43] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-23 16:22:45] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:22:45] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:22:45] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:22:46] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:22:48] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:22:48] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:22:49] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:22:49] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:22:49] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 3 ms to minimize.
[2024-05-23 16:22:49] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:22:50] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:22:50] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:22:50] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:22:50] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:22:50] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:22:50] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:22:51] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:22:51] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:22:51] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:22:52] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:22:52] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:22:57] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 3 ms to minimize.
[2024-05-23 16:22:57] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:22:57] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-23 16:23:00] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 3 ms to minimize.
[2024-05-23 16:23:00] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:23:01] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:23:01] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:23:01] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:23:01] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:23:02] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:23:02] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:23:02] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 9 (OVERLAPS) 236/420 variables, 184/266 constraints. Problems are: Problem set: 0 solved, 396 unsolved
SMT process timed out in 30109ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30113ms
Finished structural reductions in LTL mode , in 1 iterations and 30766 ms. Remains : 184/184 places, 400/400 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-15 finished in 170262 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(G(p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-04-LTLFireability-02
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 190 transition count 420
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 186 transition count 420
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 186 transition count 368
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 134 transition count 368
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 118 place count 128 transition count 344
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 148 place count 116 transition count 332
Applied a total of 148 rules in 23 ms. Remains 116 /190 variables (removed 74) and now considering 332/424 (removed 92) transitions.
[2024-05-23 16:23:07] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2024-05-23 16:23:07] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 16:23:07] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-23 16:23:07] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-23 16:23:07] [INFO ] Invariant cache hit.
[2024-05-23 16:23:07] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:23:08] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-23 16:23:08] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-23 16:23:08] [INFO ] Invariant cache hit.
[2024-05-23 16:23:08] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:09] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:23:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-23 16:23:09] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
[2024-05-23 16:23:09] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-23 16:23:09] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:23:09] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:23:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 16:23:10] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:23:10] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:23:10] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:23:10] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:23:10] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:23:11] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-05-23 16:23:11] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:23:11] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:23:11] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:23:11] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-23 16:23:11] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:23:11] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:23:11] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:11] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:23:12] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:23:12] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:23:12] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-23 16:23:12] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:23:12] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:23:12] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:23:12] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:23:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 16:23:13] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-23 16:23:13] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:15] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-23 16:23:15] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:23:15] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:23:15] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:17] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-23 16:23:17] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:23:17] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:23:17] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:23:17] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:18] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:23:19] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-23 16:23:19] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:21] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:23:21] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-23 16:23:22] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:23] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-23 16:23:23] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-23 16:23:23] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:23:23] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-23 16:23:23] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-23 16:23:23] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:23:23] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:25] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:23:25] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:28] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:23:28] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:23:28] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:23:28] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (OVERLAPS) 168/284 variables, 116/188 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 76/264 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:34] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:23:34] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:38] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:23:38] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-23 16:23:38] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
SMT process timed out in 30142ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 30146ms
Starting structural reductions in LI_LTL mode, iteration 1 : 116/190 places, 332/424 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 30675 ms. Remains : 116/190 places, 332/424 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 146 ms.
Product exploration explored 100000 steps with 0 reset in 156 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 92 ms. (430 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
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1593 ms. (steps per millisecond=363 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1593 ms. (steps per millisecond=363 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-23 16:23:40] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-23 16:23:40] [INFO ] Invariant cache hit.
[2024-05-23 16:23:40] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-23 16:23:40] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-23 16:23:40] [INFO ] Invariant cache hit.
[2024-05-23 16:23:41] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:23:41] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-23 16:23:41] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-23 16:23:41] [INFO ] Invariant cache hit.
[2024-05-23 16:23:41] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:42] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:23:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-23 16:23:43] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:23:43] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
[2024-05-23 16:23:43] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:23:43] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:23:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 16:23:43] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:23:43] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:23:43] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-23 16:23:44] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:23:44] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:23:44] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 5 ms to minimize.
[2024-05-23 16:23:44] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-23 16:23:44] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:23:44] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:23:44] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-23 16:23:44] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:23:44] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:23:44] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:45] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:23:45] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:23:45] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:23:45] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-23 16:23:45] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:23:46] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:23:46] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:23:46] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:23:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 16:23:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:23:46] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:48] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:23:48] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:23:49] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:23:49] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:50] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
[2024-05-23 16:23:50] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:23:50] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:23:51] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:23:51] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:52] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:23:52] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:23:53] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:55] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:23:55] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:23:55] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:56] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-23 16:23:57] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:23:57] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-23 16:23:57] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-23 16:23:57] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-23 16:23:57] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:23:57] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:23:59] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:23:59] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:01] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:24:02] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:24:02] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:24:02] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (OVERLAPS) 168/284 variables, 116/188 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 76/264 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:08] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:24:08] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/284 variables, and 266 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 61/74 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:12] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:24:12] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:14] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:16] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:24:16] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:18] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:24:18] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:24:18] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 168/284 variables, 116/198 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 76/274 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 328/602 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:25] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:31] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:24:31] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:24:32] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:37] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:24:37] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 608 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 75/75 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in LTL mode , in 1 iterations and 60692 ms. Remains : 116/116 places, 332/332 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 579726 steps, run visited all 1 properties in 1516 ms. (steps per millisecond=382 )
Probabilistic random walk after 579726 steps, saw 117256 distinct states, run finished after 1517 ms. (steps per millisecond=382 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 153 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-23 16:24:44] [INFO ] Redundant transitions in 1 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-23 16:24:44] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-23 16:24:44] [INFO ] Invariant cache hit.
[2024-05-23 16:24:44] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:45] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:24:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 16:24:46] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-23 16:24:46] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-23 16:24:46] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:24:46] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:24:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 16:24:46] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:24:46] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:24:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:24:47] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:24:47] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:24:47] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:24:47] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-23 16:24:47] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:24:47] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:24:47] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-23 16:24:47] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:24:47] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:24:48] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:48] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-23 16:24:48] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-23 16:24:48] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-23 16:24:48] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:24:48] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:24:49] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:24:49] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:24:49] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:24:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 16:24:49] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:24:49] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:51] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-23 16:24:51] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:24:51] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:24:51] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:53] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-05-23 16:24:53] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:24:53] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:24:53] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-23 16:24:53] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:55] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:24:55] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:24:55] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:58] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:24:58] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:24:58] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:24:59] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:24:59] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-23 16:24:59] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:24:59] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-23 16:24:59] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-23 16:24:59] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:25:00] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:01] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:25:02] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:04] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:25:04] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:25:05] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:25:05] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (OVERLAPS) 168/284 variables, 116/188 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 76/264 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:11] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:25:11] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/284 variables, and 266 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 61/74 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:16] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:25:16] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:17] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:19] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-23 16:25:19] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:21] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:25:21] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:25:21] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 168/284 variables, 116/198 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 76/274 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 328/602 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:28] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:34] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:25:35] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:25:36] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 3/606 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:41] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:25:42] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 284/284 variables, and 608 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 75/75 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60136 ms. Remains : 116/116 places, 332/332 transitions.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-23 16:25:44] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-23 16:25:44] [INFO ] Invariant cache hit.
[2024-05-23 16:25:44] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-23 16:25:44] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-23 16:25:44] [INFO ] Invariant cache hit.
[2024-05-23 16:25:44] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:25:45] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-23 16:25:45] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2024-05-23 16:25:45] [INFO ] Invariant cache hit.
[2024-05-23 16:25:45] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:46] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:25:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-23 16:25:46] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:25:46] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-05-23 16:25:47] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:25:47] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:25:47] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 16:25:47] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:25:47] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:25:47] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:25:48] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:25:48] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:25:48] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:25:48] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:25:48] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:25:48] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:25:48] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-23 16:25:48] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:25:49] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
[2024-05-23 16:25:49] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:49] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:25:49] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:25:50] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-23 16:25:50] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-23 16:25:50] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:25:50] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:25:50] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-23 16:25:50] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2024-05-23 16:25:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 16:25:51] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 2 ms to minimize.
[2024-05-23 16:25:51] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:53] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-23 16:25:53] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:25:54] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:25:54] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:55] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-23 16:25:56] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:25:56] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:25:56] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-05-23 16:25:56] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:25:58] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-23 16:25:58] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-23 16:25:58] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:26:01] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:26:02] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-23 16:26:02] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:26:03] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:26:03] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-23 16:26:03] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-23 16:26:03] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:26:03] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:26:04] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:26:04] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:26:06] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:26:06] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-23 16:26:10] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:26:10] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-05-23 16:26:10] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:26:10] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (OVERLAPS) 168/284 variables, 116/188 constraints. Problems are: Problem set: 0 solved, 328 unsolved
SMT process timed out in 30094ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 30099ms
Finished structural reductions in LTL mode , in 1 iterations and 30701 ms. Remains : 116/116 places, 332/332 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-02 finished in 187877 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((p0||(!p1 U (X(!p2)||G(!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(p0) U p1)||X(X(G(p1)))||G(p2)))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-04-LTLFireability-15
Stuttering acceptance computed with spot in 521 ms :[(AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 190 transition count 421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 187 transition count 421
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 6 place count 187 transition count 371
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 106 place count 137 transition count 371
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 131 transition count 347
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 142 place count 119 transition count 335
Applied a total of 142 rules in 56 ms. Remains 119 /190 variables (removed 71) and now considering 335/424 (removed 89) transitions.
[2024-05-23 16:26:16] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
// Phase 1: matrix 171 rows 119 cols
[2024-05-23 16:26:16] [INFO ] Computed 13 invariants in 0 ms
[2024-05-23 16:26:16] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-23 16:26:16] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:26:16] [INFO ] Invariant cache hit.
[2024-05-23 16:26:16] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:26:16] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-05-23 16:26:16] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:26:16] [INFO ] Invariant cache hit.
[2024-05-23 16:26:16] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:19] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:26:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-23 16:26:19] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:26:19] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:26:19] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:26:19] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:26:19] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:26:19] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:26:20] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:26:20] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:26:20] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:26:20] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:26:20] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:26:20] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:26:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 16:26:20] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:26:20] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:26:20] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:26:21] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:26:21] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:22] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:26:22] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:26:22] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-23 16:26:22] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:26:22] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-05-23 16:26:23] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:26:23] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:26:23] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:26] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:26:26] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2024-05-23 16:26:26] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:28] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:26:28] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:30] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:26:30] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:34] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-23 16:26:34] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:26:34] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:35] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:26:35] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:26:35] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-23 16:26:36] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:26:36] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:26:37] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:38] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:26:39] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:43] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2024-05-23 16:26:43] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:26:43] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:26:43] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:26:43] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:26:43] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:26:43] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:45] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/290 variables, and 67 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:48] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:50] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-05-23 16:26:50] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:52] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:26:52] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:26:53] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 171/290 variables, 119/192 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 76/268 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 331/599 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:26:59] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:27:00] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:27:00] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:27:01] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:27:01] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:06] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:27:08] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:27:08] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:27:08] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 4/608 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:16] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-23 16:27:16] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:27:16] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:27:16] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-05-23 16:27:16] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 613 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 74/74 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LI_LTL mode, iteration 1 : 119/190 places, 335/424 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60878 ms. Remains : 119/190 places, 335/424 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 5360 reset in 149 ms.
Product exploration explored 100000 steps with 5342 reset in 278 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 p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 138 ms. Reduced automaton from 11 states, 28 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 464 ms. (86 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 454 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 6/6 properties
[2024-05-23 16:27:18] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:27:18] [INFO ] Invariant cache hit.
[2024-05-23 16:27:18] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/91 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:27:19] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 135/226 variables, 91/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 40/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/240 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 20/260 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/262 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/262 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 28/290 variables, 22/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/290 variables, 30/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/290 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 209 constraints, problems are : Problem set: 0 solved, 6 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/91 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:27:19] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-23 16:27:19] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:27:19] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 135/226 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/240 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 20/260 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:27:20] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/260 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/262 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/262 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:27:20] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:27:20] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/262 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:27:20] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/262 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:27:20] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/262 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:27:20] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:27:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/262 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/262 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 28/290 variables, 22/195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/290 variables, 30/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:27:21] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:27:21] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/290 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/290 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 0/290 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 227 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2075 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 2732ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 946 ms.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 10 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 119/119 places, 335/335 transitions.
RANDOM walk for 40000 steps (8 resets) in 658 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 459 ms. (86 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 58818 steps, run visited all 6 properties in 669 ms. (steps per millisecond=87 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 670 ms. (steps per millisecond=87 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p0)]
Knowledge based reduction with 23 factoid took 455 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-05-23 16:27:24] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:27:24] [INFO ] Invariant cache hit.
[2024-05-23 16:27:25] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-23 16:27:25] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:27:25] [INFO ] Invariant cache hit.
[2024-05-23 16:27:25] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:27:25] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-05-23 16:27:25] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:27:25] [INFO ] Invariant cache hit.
[2024-05-23 16:27:25] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:27] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:27:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 16:27:28] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:27:28] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-23 16:27:28] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-05-23 16:27:28] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-23 16:27:28] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:27:28] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:27:29] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:27:29] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:27:29] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 2 ms to minimize.
[2024-05-23 16:27:29] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-23 16:27:29] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:27:29] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:27:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 16:27:29] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:27:29] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-23 16:27:29] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:27:30] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-23 16:27:30] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:31] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-23 16:27:31] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:27:31] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:27:31] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-23 16:27:31] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:27:32] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-23 16:27:32] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:27:32] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:36] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:27:36] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:27:36] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:38] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:27:38] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:40] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:27:40] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:43] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 2 ms to minimize.
[2024-05-23 16:27:44] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-23 16:27:44] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:45] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-23 16:27:45] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:27:45] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-23 16:27:45] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-23 16:27:46] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-05-23 16:27:47] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:48] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-23 16:27:48] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:52] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:27:52] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:27:52] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:27:52] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-23 16:27:52] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2024-05-23 16:27:53] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-23 16:27:53] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:54] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/290 variables, and 67 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:57] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:27:59] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:27:59] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:01] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:28:01] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:28:01] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 171/290 variables, 119/192 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 76/268 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 331/599 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:09] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 3 ms to minimize.
[2024-05-23 16:28:10] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-05-23 16:28:10] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-23 16:28:11] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:28:11] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:16] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:28:18] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:28:19] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:28:19] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 4/608 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:25] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:28:25] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 610 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 71/71 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Finished structural reductions in LTL mode , in 1 iterations and 60811 ms. Remains : 119/119 places, 335/335 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 (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 153 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1351 ms. (29 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 6/6 properties
[2024-05-23 16:28:27] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:28:27] [INFO ] Invariant cache hit.
[2024-05-23 16:28:27] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 5/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/91 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:28:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 135/226 variables, 91/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 40/142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:28:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 14/240 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 20/260 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/262 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/262 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 28/290 variables, 22/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/290 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/290 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/290 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 210 constraints, problems are : Problem set: 0 solved, 6 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/81 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/86 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/91 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:28:28] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 135/226 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 14/240 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 20/260 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:28:28] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:28:28] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/260 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/262 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/262 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 16:28:29] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/262 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/262 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 28/290 variables, 22/190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/290 variables, 30/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/290 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/290 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 220 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1337 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 2074ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 456 ms.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 5 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 119/119 places, 335/335 transitions.
RANDOM walk for 40000 steps (8 resets) in 1544 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 58818 steps, run visited all 6 properties in 678 ms. (steps per millisecond=86 )
Probabilistic random walk after 58818 steps, saw 14352 distinct states, run finished after 678 ms. (steps per millisecond=86 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2 p0))), (F p0)]
Knowledge based reduction with 8 factoid took 721 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2822 reset in 245 ms.
Product exploration explored 100000 steps with 2814 reset in 268 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 11 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-05-23 16:28:34] [INFO ] Redundant transitions in 2 ms returned []
Running 331 sub problems to find dead transitions.
[2024-05-23 16:28:34] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:28:34] [INFO ] Invariant cache hit.
[2024-05-23 16:28:34] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:36] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-23 16:28:36] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-23 16:28:36] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-23 16:28:37] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:28:37] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 2 ms to minimize.
[2024-05-23 16:28:37] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:28:37] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:28:37] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-23 16:28:38] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:28:38] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 2 ms to minimize.
[2024-05-23 16:28:38] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:28:38] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:28:38] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:28:38] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:28:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 16:28:38] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:28:38] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:28:39] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:28:39] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:28:39] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:40] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 3 ms to minimize.
[2024-05-23 16:28:40] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:28:40] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:28:40] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-23 16:28:41] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:28:41] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:28:41] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:28:41] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:45] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:28:45] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:28:45] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:47] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:28:48] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:50] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:28:50] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:54] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:28:54] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:28:54] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:55] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:28:55] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:28:55] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-23 16:28:56] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-23 16:28:56] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:28:57] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:28:58] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-23 16:28:58] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:01] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-05-23 16:29:01] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-23 16:29:01] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 3 ms to minimize.
[2024-05-23 16:29:01] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:29:01] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:29:01] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:29:02] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:03] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/290 variables, and 67 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:06] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:09] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:29:09] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:12] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:29:12] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:29:12] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 171/290 variables, 119/192 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 76/268 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 331/599 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:17] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:29:18] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-23 16:29:19] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:29:19] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:29:20] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:25] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:29:27] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:29:27] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:29:27] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 4/608 constraints. Problems are: Problem set: 0 solved, 331 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/290 variables, and 608 constraints, problems are : Problem set: 0 solved, 331 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 119/119 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 69/69 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60256 ms. Remains : 119/119 places, 335/335 transitions.
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 335/335 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 335/335 (removed 0) transitions.
[2024-05-23 16:29:34] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:29:34] [INFO ] Invariant cache hit.
[2024-05-23 16:29:34] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-23 16:29:34] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:29:34] [INFO ] Invariant cache hit.
[2024-05-23 16:29:35] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-23 16:29:35] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-05-23 16:29:35] [INFO ] Flow matrix only has 171 transitions (discarded 164 similar events)
[2024-05-23 16:29:35] [INFO ] Invariant cache hit.
[2024-05-23 16:29:35] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:37] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-23 16:29:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 16:29:37] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:29:37] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 16:29:38] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:29:39] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-23 16:29:39] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-23 16:29:39] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:29:39] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:40] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:29:40] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:29:40] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-23 16:29:40] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-23 16:29:41] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-23 16:29:41] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:29:41] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-23 16:29:41] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:45] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-23 16:29:45] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-05-23 16:29:45] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:47] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-23 16:29:48] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:49] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-23 16:29:49] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:52] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 3 ms to minimize.
[2024-05-23 16:29:52] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-23 16:29:52] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:53] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-23 16:29:53] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 2 ms to minimize.
[2024-05-23 16:29:53] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-23 16:29:54] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:29:54] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-23 16:29:55] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:29:56] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-05-23 16:29:56] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:30:00] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:30:00] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-23 16:30:00] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 3 ms to minimize.
[2024-05-23 16:30:00] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:30:01] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:30:01] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-23 16:30:01] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 331 unsolved
[2024-05-23 16:30:02] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 331 unsolved
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 30174ms
Finished structural reductions in LTL mode , in 1 iterations and 30698 ms. Remains : 119/119 places, 335/335 transitions.
Treatment of property EisenbergMcGuire-PT-04-LTLFireability-15 finished in 230095 ms.
[2024-05-23 16:30:05] [INFO ] Flatten gal took : 32 ms
[2024-05-23 16:30:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-23 16:30:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 190 places, 424 transitions and 1856 arcs took 10 ms.
Total runtime 1456932 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 190
TRANSITIONS: 424
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.024s, Sys 0.000s]


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


----------------------------------------------------------------------
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: 8905
MODEL NAME: /home/mcc/execution/414/model
190 places, 424 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.
Building monolithic NSF...
FORMULA EisenbergMcGuire-PT-04-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716482003953

--------------------
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-04"
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-04, 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-171636265100156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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