Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445700316.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S06J04T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.8M May 18 16:43 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 PolyORBLF-PT-S06J04T04-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716870394083

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:26:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 04:26:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:26:36] [INFO ] Load time of PNML (sax parser for PT used): 425 ms
[2024-05-28 04:26:36] [INFO ] Transformed 454 places.
[2024-05-28 04:26:36] [INFO ] Transformed 6994 transitions.
[2024-05-28 04:26:36] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 613 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 169 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 452 transition count 1612
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 452 transition count 1612
Applied a total of 4 rules in 107 ms. Remains 452 /454 variables (removed 2) and now considering 1612/1614 (removed 2) transitions.
Running 1606 sub problems to find dead transitions.
[2024-05-28 04:26:36] [INFO ] Flow matrix only has 1588 transitions (discarded 24 similar events)
// Phase 1: matrix 1588 rows 452 cols
[2024-05-28 04:26:36] [INFO ] Computed 50 invariants in 85 ms
[2024-05-28 04:26:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
[2024-05-28 04:27:03] [INFO ] Deduced a trap composed of 82 places in 173 ms of which 22 ms to minimize.
[2024-05-28 04:27:04] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/2040 variables, and 35 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 20081 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 20/32 constraints, State Equation: 0/452 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
At refinement iteration 4 (OVERLAPS) 5/445 variables, 5/40 constraints. Problems are: Problem set: 324 solved, 1282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/2040 variables, and 40 constraints, problems are : Problem set: 324 solved, 1282 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 20/32 constraints, State Equation: 0/452 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 2/2 constraints]
After SMT, in 55193ms problems are : Problem set: 324 solved, 1282 unsolved
Search for dead transitions found 324 dead transitions in 55243ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
[2024-05-28 04:27:31] [INFO ] Flow matrix only has 1264 transitions (discarded 24 similar events)
// Phase 1: matrix 1264 rows 452 cols
[2024-05-28 04:27:31] [INFO ] Computed 50 invariants in 56 ms
[2024-05-28 04:27:32] [INFO ] Implicit Places using invariants in 440 ms returned [42, 288, 351, 412]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 464 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 448/454 places, 1288/1614 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 1288/1288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55889 ms. Remains : 448/454 places, 1288/1614 transitions.
Support contains 169 out of 448 places after structural reductions.
[2024-05-28 04:27:32] [INFO ] Flatten gal took : 153 ms
[2024-05-28 04:27:32] [INFO ] Flatten gal took : 109 ms
[2024-05-28 04:27:33] [INFO ] Input system was already deterministic with 1288 transitions.
RANDOM walk for 19401 steps (93 resets) in 1568 ms. (12 steps per ms) remains 0/23 properties
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' '!(G((F(p0) U X(!p1))))'
Support contains 30 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1288/1288 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 442 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 438 transition count 1284
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 438 transition count 1284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 436 transition count 1282
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 436 transition count 1282
Applied a total of 18 rules in 50 ms. Remains 436 /448 variables (removed 12) and now considering 1282/1288 (removed 6) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:27:34] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
// Phase 1: matrix 1258 rows 436 cols
[2024-05-28 04:27:34] [INFO ] Computed 40 invariants in 56 ms
[2024-05-28 04:27:34] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:27:50] [INFO ] Deduced a trap composed of 182 places in 288 ms of which 4 ms to minimize.
[2024-05-28 04:27:51] [INFO ] Deduced a trap composed of 74 places in 289 ms of which 3 ms to minimize.
[2024-05-28 04:27:51] [INFO ] Deduced a trap composed of 99 places in 267 ms of which 3 ms to minimize.
[2024-05-28 04:27:52] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 2 ms to minimize.
[2024-05-28 04:27:53] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 1 ms to minimize.
[2024-05-28 04:27:53] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 2 ms to minimize.
[2024-05-28 04:27:53] [INFO ] Deduced a trap composed of 198 places in 290 ms of which 3 ms to minimize.
[2024-05-28 04:27:58] [INFO ] Deduced a trap composed of 202 places in 238 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 41 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:28:04] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 1 ms to minimize.
[2024-05-28 04:28:04] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 1 ms to minimize.
[2024-05-28 04:28:06] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 2 ms to minimize.
[2024-05-28 04:28:06] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 45 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 12/12 constraints]
After SMT, in 47862ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 47879ms
[2024-05-28 04:28:21] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:28:21] [INFO ] Invariant cache hit.
[2024-05-28 04:28:22] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-28 04:28:22] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:28:22] [INFO ] Invariant cache hit.
[2024-05-28 04:28:24] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:28:36] [INFO ] Implicit Places using invariants and state equation in 14094 ms returned []
Implicit Place search using SMT with State Equation took 14607 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:28:36] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:28:36] [INFO ] Invariant cache hit.
[2024-05-28 04:28:36] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:28:56] [INFO ] Deduced a trap composed of 74 places in 252 ms of which 2 ms to minimize.
[2024-05-28 04:28:57] [INFO ] Deduced a trap composed of 99 places in 269 ms of which 3 ms to minimize.
[2024-05-28 04:28:58] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 2 ms to minimize.
[2024-05-28 04:28:58] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 2 ms to minimize.
[2024-05-28 04:28:59] [INFO ] Deduced a trap composed of 202 places in 334 ms of which 3 ms to minimize.
[2024-05-28 04:28:59] [INFO ] Deduced a trap composed of 198 places in 294 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 39 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:29:17] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-28 04:29:18] [INFO ] Deduced a trap composed of 191 places in 279 ms of which 5 ms to minimize.
[2024-05-28 04:29:18] [INFO ] Deduced a trap composed of 185 places in 283 ms of which 2 ms to minimize.
[2024-05-28 04:29:18] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2024-05-28 04:29:19] [INFO ] Deduced a trap composed of 30 places in 405 ms of which 3 ms to minimize.
[2024-05-28 04:29:19] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-28 04:29:24] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 1 ms to minimize.
[2024-05-28 04:29:31] [INFO ] Deduced a trap composed of 210 places in 250 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 47 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 14/14 constraints]
After SMT, in 68452ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 68471ms
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 1282/1288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131017 ms. Remains : 436/448 places, 1282/1288 transitions.
Stuttering acceptance computed with spot in 514 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLFireability-00
Product exploration explored 100000 steps with 40088 reset in 1074 ms.
Product exploration explored 100000 steps with 39968 reset in 1001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 552 steps (3 resets) in 20 ms. (26 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 244 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1282/1282 transitions.
Applied a total of 0 rules in 9 ms. Remains 436 /436 variables (removed 0) and now considering 1282/1282 (removed 0) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:29:48] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:29:48] [INFO ] Invariant cache hit.
[2024-05-28 04:29:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:30:07] [INFO ] Deduced a trap composed of 74 places in 299 ms of which 3 ms to minimize.
[2024-05-28 04:30:08] [INFO ] Deduced a trap composed of 99 places in 291 ms of which 3 ms to minimize.
[2024-05-28 04:30:09] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 2 ms to minimize.
[2024-05-28 04:30:09] [INFO ] Deduced a trap composed of 47 places in 296 ms of which 2 ms to minimize.
[2024-05-28 04:30:10] [INFO ] Deduced a trap composed of 202 places in 377 ms of which 3 ms to minimize.
[2024-05-28 04:30:10] [INFO ] Deduced a trap composed of 198 places in 265 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 39 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:30:19] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 4 ms to minimize.
[2024-05-28 04:30:20] [INFO ] Deduced a trap composed of 191 places in 438 ms of which 10 ms to minimize.
[2024-05-28 04:30:20] [INFO ] Deduced a trap composed of 185 places in 329 ms of which 3 ms to minimize.
[2024-05-28 04:30:21] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 1 ms to minimize.
[2024-05-28 04:30:21] [INFO ] Deduced a trap composed of 30 places in 426 ms of which 4 ms to minimize.
[2024-05-28 04:30:22] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-05-28 04:30:26] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 3 ms to minimize.
[2024-05-28 04:30:32] [INFO ] Deduced a trap composed of 210 places in 348 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 47 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 14/14 constraints]
After SMT, in 47915ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 47960ms
[2024-05-28 04:30:36] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:30:36] [INFO ] Invariant cache hit.
[2024-05-28 04:30:37] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-28 04:30:37] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:30:37] [INFO ] Invariant cache hit.
[2024-05-28 04:30:38] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:30:48] [INFO ] Implicit Places using invariants and state equation in 11560 ms returned []
Implicit Place search using SMT with State Equation took 11961 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:30:48] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:30:48] [INFO ] Invariant cache hit.
[2024-05-28 04:30:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:31:06] [INFO ] Deduced a trap composed of 74 places in 289 ms of which 3 ms to minimize.
[2024-05-28 04:31:06] [INFO ] Deduced a trap composed of 99 places in 281 ms of which 2 ms to minimize.
[2024-05-28 04:31:07] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 2 ms to minimize.
[2024-05-28 04:31:07] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 1 ms to minimize.
[2024-05-28 04:31:08] [INFO ] Deduced a trap composed of 202 places in 281 ms of which 3 ms to minimize.
[2024-05-28 04:31:08] [INFO ] Deduced a trap composed of 198 places in 312 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.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 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.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 2.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 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.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 1.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)
(s110timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 39 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:31:30] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 2 ms to minimize.
[2024-05-28 04:31:31] [INFO ] Deduced a trap composed of 191 places in 311 ms of which 3 ms to minimize.
[2024-05-28 04:31:31] [INFO ] Deduced a trap composed of 185 places in 262 ms of which 4 ms to minimize.
[2024-05-28 04:31:31] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 1 ms to minimize.
[2024-05-28 04:31:32] [INFO ] Deduced a trap composed of 30 places in 355 ms of which 3 ms to minimize.
[2024-05-28 04:31:32] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-05-28 04:31:36] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2024-05-28 04:31:43] [INFO ] Deduced a trap composed of 210 places in 358 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 47 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 14/14 constraints]
After SMT, in 68380ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 68404ms
Finished structural reductions in LTL mode , in 1 iterations and 128346 ms. Remains : 436/436 places, 1282/1282 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 p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 182 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 542 steps (6 resets) in 24 ms. (21 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 254 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 253 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 39994 reset in 863 ms.
Product exploration explored 100000 steps with 40129 reset in 964 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 244 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 1282/1282 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 436 transition count 1282
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 26 place count 436 transition count 1330
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 56 place count 436 transition count 1330
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 428 transition count 1322
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 428 transition count 1322
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 120 place count 428 transition count 1322
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 136 place count 412 transition count 1306
Deduced a syphon composed of 84 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 152 place count 412 transition count 1306
Deduced a syphon composed of 84 places in 2 ms
Applied a total of 152 rules in 189 ms. Remains 412 /436 variables (removed 24) and now considering 1306/1282 (removed -24) transitions.
Running 1300 sub problems to find dead transitions.
[2024-05-28 04:32:01] [INFO ] Flow matrix only has 1282 transitions (discarded 24 similar events)
// Phase 1: matrix 1282 rows 412 cols
[2024-05-28 04:32:01] [INFO ] Computed 40 invariants in 41 ms
[2024-05-28 04:32:01] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
[2024-05-28 04:32:19] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-05-28 04:32:20] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 3 ms to minimize.
[2024-05-28 04:32:29] [INFO ] Deduced a trap composed of 90 places in 188 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1694 variables, and 32 constraints, problems are : Problem set: 0 solved, 1300 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 15/23 constraints, State Equation: 0/412 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1300/1300 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1300 unsolved
Problem TDEAD160 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1041 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/409 variables, 3/35 constraints. Problems are: Problem set: 100 solved, 1200 unsolved
[2024-05-28 04:32:42] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-28 04:32:42] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-28 04:32:43] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1188 is UNSAT
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 409/1694 variables, and 38 constraints, problems are : Problem set: 142 solved, 1158 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 15/23 constraints, State Equation: 0/412 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1300 constraints, Known Traps: 6/6 constraints]
After SMT, in 49388ms problems are : Problem set: 142 solved, 1158 unsolved
Search for dead transitions found 142 dead transitions in 49407ms
Found 142 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 142 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 142 transitions.
[2024-05-28 04:32:50] [INFO ] Redundant transitions in 60 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 412/436 places, 1164/1282 transitions.
Graph (complete) has 2414 edges and 412 vertex of which 394 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.6 ms
Discarding 18 places :
Also discarding 0 output transitions
Deduced a syphon composed of 66 places in 2 ms
Applied a total of 1 rules in 42 ms. Remains 394 /412 variables (removed 18) and now considering 1164/1164 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 394/436 places, 1164/1282 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49715 ms. Remains : 394/436 places, 1164/1282 transitions.
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1282/1282 transitions.
Applied a total of 0 rules in 10 ms. Remains 436 /436 variables (removed 0) and now considering 1282/1282 (removed 0) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:32:50] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
// Phase 1: matrix 1258 rows 436 cols
[2024-05-28 04:32:50] [INFO ] Computed 40 invariants in 21 ms
[2024-05-28 04:32:50] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:33:09] [INFO ] Deduced a trap composed of 182 places in 290 ms of which 3 ms to minimize.
[2024-05-28 04:33:10] [INFO ] Deduced a trap composed of 74 places in 283 ms of which 3 ms to minimize.
[2024-05-28 04:33:10] [INFO ] Deduced a trap composed of 99 places in 242 ms of which 3 ms to minimize.
[2024-05-28 04:33:11] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 2 ms to minimize.
[2024-05-28 04:33:11] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 2 ms to minimize.
[2024-05-28 04:33:11] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 2 ms to minimize.
[2024-05-28 04:33:12] [INFO ] Deduced a trap composed of 198 places in 335 ms of which 3 ms to minimize.
[2024-05-28 04:33:15] [INFO ] Deduced a trap composed of 202 places in 262 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 41 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:33:21] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
[2024-05-28 04:33:22] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 4 ms to minimize.
[2024-05-28 04:33:24] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2024-05-28 04:33:24] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 45 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 12/12 constraints]
After SMT, in 48719ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 48736ms
[2024-05-28 04:33:39] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:33:39] [INFO ] Invariant cache hit.
[2024-05-28 04:33:40] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-28 04:33:40] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:33:40] [INFO ] Invariant cache hit.
[2024-05-28 04:33:41] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:33:52] [INFO ] Implicit Places using invariants and state equation in 12264 ms returned []
Implicit Place search using SMT with State Equation took 12869 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:33:52] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:33:52] [INFO ] Invariant cache hit.
[2024-05-28 04:33:52] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:34:11] [INFO ] Deduced a trap composed of 74 places in 264 ms of which 3 ms to minimize.
[2024-05-28 04:34:11] [INFO ] Deduced a trap composed of 99 places in 336 ms of which 3 ms to minimize.
[2024-05-28 04:34:12] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 2 ms to minimize.
[2024-05-28 04:34:13] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 2 ms to minimize.
[2024-05-28 04:34:13] [INFO ] Deduced a trap composed of 202 places in 351 ms of which 2 ms to minimize.
[2024-05-28 04:34:14] [INFO ] Deduced a trap composed of 198 places in 264 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 39 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:34:36] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 1 ms to minimize.
[2024-05-28 04:34:38] [INFO ] Deduced a trap composed of 191 places in 390 ms of which 2 ms to minimize.
[2024-05-28 04:34:38] [INFO ] Deduced a trap composed of 185 places in 334 ms of which 3 ms to minimize.
[2024-05-28 04:34:39] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2024-05-28 04:34:39] [INFO ] Deduced a trap composed of 30 places in 490 ms of which 3 ms to minimize.
[2024-05-28 04:34:39] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-05-28 04:34:45] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 1 ms to minimize.
[2024-05-28 04:34:51] [INFO ] Deduced a trap composed of 210 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 47 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 14/14 constraints]
After SMT, in 68336ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 68356ms
Finished structural reductions in LTL mode , in 1 iterations and 129980 ms. Remains : 436/436 places, 1282/1282 transitions.
Treatment of property PolyORBLF-PT-S06J04T04-LTLFireability-00 finished in 447055 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)||G(!p0))))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1288/1288 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 442 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 438 transition count 1284
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 438 transition count 1284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 436 transition count 1282
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 436 transition count 1282
Applied a total of 18 rules in 42 ms. Remains 436 /448 variables (removed 12) and now considering 1282/1288 (removed 6) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:35:01] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:35:01] [INFO ] Invariant cache hit.
[2024-05-28 04:35:01] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:35:17] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 2 ms to minimize.
[2024-05-28 04:35:18] [INFO ] Deduced a trap composed of 99 places in 227 ms of which 2 ms to minimize.
[2024-05-28 04:35:18] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2024-05-28 04:35:19] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 2 ms to minimize.
[2024-05-28 04:35:19] [INFO ] Deduced a trap composed of 202 places in 231 ms of which 2 ms to minimize.
[2024-05-28 04:35:20] [INFO ] Deduced a trap composed of 198 places in 271 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 39 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:35:31] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 2 ms to minimize.
[2024-05-28 04:35:31] [INFO ] Deduced a trap composed of 191 places in 265 ms of which 3 ms to minimize.
[2024-05-28 04:35:32] [INFO ] Deduced a trap composed of 185 places in 260 ms of which 3 ms to minimize.
[2024-05-28 04:35:32] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2024-05-28 04:35:32] [INFO ] Deduced a trap composed of 30 places in 308 ms of which 3 ms to minimize.
[2024-05-28 04:35:32] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2024-05-28 04:35:36] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-05-28 04:35:42] [INFO ] Deduced a trap composed of 210 places in 319 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 47 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 14/14 constraints]
After SMT, in 47711ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 47726ms
[2024-05-28 04:35:48] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:35:48] [INFO ] Invariant cache hit.
[2024-05-28 04:35:49] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-05-28 04:35:49] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:35:49] [INFO ] Invariant cache hit.
[2024-05-28 04:35:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:36:04] [INFO ] Implicit Places using invariants and state equation in 14701 ms returned []
Implicit Place search using SMT with State Equation took 15196 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:36:04] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:36:04] [INFO ] Invariant cache hit.
[2024-05-28 04:36:04] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:36:20] [INFO ] Deduced a trap composed of 74 places in 252 ms of which 3 ms to minimize.
[2024-05-28 04:36:20] [INFO ] Deduced a trap composed of 99 places in 245 ms of which 3 ms to minimize.
[2024-05-28 04:36:21] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2024-05-28 04:36:21] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 2 ms to minimize.
[2024-05-28 04:36:22] [INFO ] Deduced a trap composed of 202 places in 308 ms of which 4 ms to minimize.
[2024-05-28 04:36:22] [INFO ] Deduced a trap composed of 198 places in 273 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:36:41] [INFO ] Deduced a trap composed of 185 places in 246 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 40 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:36:48] [INFO ] Deduced a trap composed of 30 places in 292 ms of which 2 ms to minimize.
[2024-05-28 04:36:51] [INFO ] Deduced a trap composed of 248 places in 360 ms of which 3 ms to minimize.
[2024-05-28 04:36:52] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2024-05-28 04:36:52] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 1 ms to minimize.
[2024-05-28 04:36:55] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 45 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 12/12 constraints]
After SMT, in 67660ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 67677ms
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 1282/1288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130651 ms. Remains : 436/448 places, 1282/1288 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (NOT p0), p0, false, false]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLFireability-02
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T04-LTLFireability-02 finished in 130969 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(F((p0&&F(p1)))))'
Support contains 10 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1288/1288 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 442 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 438 transition count 1284
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 438 transition count 1284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 436 transition count 1282
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 436 transition count 1282
Applied a total of 18 rules in 35 ms. Remains 436 /448 variables (removed 12) and now considering 1282/1288 (removed 6) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:37:12] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:37:12] [INFO ] Invariant cache hit.
[2024-05-28 04:37:12] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:37:29] [INFO ] Deduced a trap composed of 74 places in 345 ms of which 3 ms to minimize.
[2024-05-28 04:37:29] [INFO ] Deduced a trap composed of 99 places in 272 ms of which 3 ms to minimize.
[2024-05-28 04:37:30] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 2 ms to minimize.
[2024-05-28 04:37:31] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 2 ms to minimize.
[2024-05-28 04:37:31] [INFO ] Deduced a trap composed of 202 places in 306 ms of which 3 ms to minimize.
[2024-05-28 04:37:32] [INFO ] Deduced a trap composed of 198 places in 281 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 39 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:37:43] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 1 ms to minimize.
[2024-05-28 04:37:44] [INFO ] Deduced a trap composed of 191 places in 334 ms of which 4 ms to minimize.
[2024-05-28 04:37:44] [INFO ] Deduced a trap composed of 185 places in 302 ms of which 3 ms to minimize.
[2024-05-28 04:37:45] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-28 04:37:45] [INFO ] Deduced a trap composed of 30 places in 468 ms of which 3 ms to minimize.
[2024-05-28 04:37:45] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-05-28 04:37:50] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 1 ms to minimize.
[2024-05-28 04:37:57] [INFO ] Deduced a trap composed of 210 places in 391 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 47 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 14/14 constraints]
After SMT, in 48048ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 48078ms
[2024-05-28 04:38:00] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:38:00] [INFO ] Invariant cache hit.
[2024-05-28 04:38:00] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-28 04:38:00] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:38:00] [INFO ] Invariant cache hit.
[2024-05-28 04:38:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:38:16] [INFO ] Implicit Places using invariants and state equation in 15895 ms returned []
Implicit Place search using SMT with State Equation took 16684 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:38:16] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:38:16] [INFO ] Invariant cache hit.
[2024-05-28 04:38:16] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:38:38] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 4 ms to minimize.
[2024-05-28 04:38:38] [INFO ] Deduced a trap composed of 99 places in 293 ms of which 3 ms to minimize.
[2024-05-28 04:38:39] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 2 ms to minimize.
[2024-05-28 04:38:39] [INFO ] Deduced a trap composed of 47 places in 272 ms of which 2 ms to minimize.
[2024-05-28 04:38:40] [INFO ] Deduced a trap composed of 202 places in 308 ms of which 3 ms to minimize.
[2024-05-28 04:38:40] [INFO ] Deduced a trap composed of 198 places in 286 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 39 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:38:57] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 1 ms to minimize.
[2024-05-28 04:38:58] [INFO ] Deduced a trap composed of 191 places in 331 ms of which 3 ms to minimize.
[2024-05-28 04:38:58] [INFO ] Deduced a trap composed of 185 places in 290 ms of which 4 ms to minimize.
[2024-05-28 04:38:59] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-05-28 04:38:59] [INFO ] Deduced a trap composed of 30 places in 308 ms of which 3 ms to minimize.
[2024-05-28 04:38:59] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 1 ms to minimize.
[2024-05-28 04:39:03] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-28 04:39:10] [INFO ] Deduced a trap composed of 210 places in 358 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 47 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 14/14 constraints]
After SMT, in 68528ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 68543ms
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 1282/1288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133366 ms. Remains : 436/448 places, 1282/1288 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLFireability-03
Stuttering criterion allowed to conclude after 263 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T04-LTLFireability-03 finished in 133530 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)&&F(p0)))))'
Support contains 24 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1288/1288 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 1284
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 1284
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 442 transition count 1282
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 442 transition count 1282
Applied a total of 12 rules in 19 ms. Remains 442 /448 variables (removed 6) and now considering 1282/1288 (removed 6) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:39:25] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
// Phase 1: matrix 1258 rows 442 cols
[2024-05-28 04:39:25] [INFO ] Computed 46 invariants in 30 ms
[2024-05-28 04:39:25] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:39:41] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-28 04:39:41] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-05-28 04:39:41] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1700 variables, and 32 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 15/29 constraints, State Equation: 0/442 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:39:56] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 3 ms to minimize.
[2024-05-28 04:39:56] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 2 ms to minimize.
[2024-05-28 04:39:56] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-28 04:39:57] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-05-28 04:39:57] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2024-05-28 04:39:59] [INFO ] Deduced a trap composed of 178 places in 138 ms of which 3 ms to minimize.
[2024-05-28 04:39:59] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2024-05-28 04:40:00] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1276 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 430/1700 variables, and 40 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 15/29 constraints, State Equation: 0/442 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 11/11 constraints]
After SMT, in 47317ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 47330ms
[2024-05-28 04:40:12] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:40:12] [INFO ] Invariant cache hit.
[2024-05-28 04:40:13] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-28 04:40:13] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:40:13] [INFO ] Invariant cache hit.
[2024-05-28 04:40:14] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:40:22] [INFO ] Implicit Places using invariants and state equation in 9395 ms returned []
Implicit Place search using SMT with State Equation took 9832 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:40:22] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:40:22] [INFO ] Invariant cache hit.
[2024-05-28 04:40:22] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:40:45] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-05-28 04:40:48] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 2 ms to minimize.
[2024-05-28 04:40:48] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1700 variables, and 32 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 15/29 constraints, State Equation: 0/442 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:41:05] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 2 ms to minimize.
[2024-05-28 04:41:05] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 2 ms to minimize.
[2024-05-28 04:41:06] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:41:22] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-05-28 04:41:22] [INFO ] Deduced a trap composed of 100 places in 360 ms of which 3 ms to minimize.
[2024-05-28 04:41:23] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 2)
(s10 0)
(s11 0)
(s12 4)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 2)
(s59 0)
(s60 0)
(s61 0)
(s62 2)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 4)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 1)
(s77 0)
(s79 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 1)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 1)
(s114 0)
(s115 0)
(s116 4)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 4)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 2)
(s151 0)
(s152 4)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 4)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1700 variables, and 38 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 15/29 constraints, State Equation: 0/442 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 9/9 constraints]
After SMT, in 68427ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 68445ms
Starting structural reductions in LTL mode, iteration 1 : 442/448 places, 1282/1288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125634 ms. Remains : 442/448 places, 1282/1288 transitions.
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 715 ms.
Product exploration explored 100000 steps with 50000 reset in 701 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 24 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S06J04T04-LTLFireability-04 finished in 127427 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(F(p0)))'
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1288/1288 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 442 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 438 transition count 1284
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 438 transition count 1284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 436 transition count 1282
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 436 transition count 1282
Applied a total of 18 rules in 45 ms. Remains 436 /448 variables (removed 12) and now considering 1282/1288 (removed 6) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:41:33] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
// Phase 1: matrix 1258 rows 436 cols
[2024-05-28 04:41:33] [INFO ] Computed 40 invariants in 31 ms
[2024-05-28 04:41:33] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:41:48] [INFO ] Deduced a trap composed of 182 places in 274 ms of which 3 ms to minimize.
[2024-05-28 04:41:49] [INFO ] Deduced a trap composed of 74 places in 252 ms of which 3 ms to minimize.
[2024-05-28 04:41:49] [INFO ] Deduced a trap composed of 99 places in 246 ms of which 3 ms to minimize.
[2024-05-28 04:41:50] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 2 ms to minimize.
[2024-05-28 04:41:50] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 2 ms to minimize.
[2024-05-28 04:41:51] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 2 ms to minimize.
[2024-05-28 04:41:51] [INFO ] Deduced a trap composed of 198 places in 260 ms of which 3 ms to minimize.
[2024-05-28 04:41:55] [INFO ] Deduced a trap composed of 202 places in 253 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.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 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.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 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 2.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 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.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 1.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 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.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 1.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)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 2.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 2.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 2.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 1.0)
(s183 8.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 2.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 9.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 41 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:42:04] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-28 04:42:04] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 2 ms to minimize.
[2024-05-28 04:42:06] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-05-28 04:42:06] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 45 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 12/12 constraints]
After SMT, in 47619ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 47640ms
[2024-05-28 04:42:20] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:42:20] [INFO ] Invariant cache hit.
[2024-05-28 04:42:21] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-28 04:42:21] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:42:21] [INFO ] Invariant cache hit.
[2024-05-28 04:42:22] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:42:35] [INFO ] Implicit Places using invariants and state equation in 14011 ms returned []
Implicit Place search using SMT with State Equation took 14686 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:42:35] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:42:35] [INFO ] Invariant cache hit.
[2024-05-28 04:42:35] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:42:52] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 3 ms to minimize.
[2024-05-28 04:42:52] [INFO ] Deduced a trap composed of 99 places in 215 ms of which 2 ms to minimize.
[2024-05-28 04:42:53] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 2 ms to minimize.
[2024-05-28 04:42:53] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 2 ms to minimize.
[2024-05-28 04:42:54] [INFO ] Deduced a trap composed of 202 places in 216 ms of which 2 ms to minimize.
[2024-05-28 04:42:54] [INFO ] Deduced a trap composed of 198 places in 221 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 39 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:43:15] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-28 04:43:16] [INFO ] Deduced a trap composed of 191 places in 250 ms of which 2 ms to minimize.
[2024-05-28 04:43:16] [INFO ] Deduced a trap composed of 185 places in 277 ms of which 3 ms to minimize.
[2024-05-28 04:43:16] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-28 04:43:17] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 2 ms to minimize.
[2024-05-28 04:43:17] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-05-28 04:43:21] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2024-05-28 04:43:26] [INFO ] Deduced a trap composed of 210 places in 285 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 47 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 14/14 constraints]
After SMT, in 67273ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 67286ms
Starting structural reductions in LTL mode, iteration 1 : 436/448 places, 1282/1288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129666 ms. Remains : 436/448 places, 1282/1288 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLFireability-05
Stuttering criterion allowed to conclude after 49 steps with 1 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T04-LTLFireability-05 finished in 129770 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 13 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 1288/1288 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 442 transition count 1266
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 420 transition count 1264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 418 transition count 1264
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 48 place count 418 transition count 1216
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 144 place count 370 transition count 1216
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 236 place count 324 transition count 1170
Applied a total of 236 rules in 93 ms. Remains 324 /448 variables (removed 124) and now considering 1170/1288 (removed 118) transitions.
Running 1164 sub problems to find dead transitions.
[2024-05-28 04:43:42] [INFO ] Flow matrix only has 1146 transitions (discarded 24 similar events)
// Phase 1: matrix 1146 rows 324 cols
[2024-05-28 04:43:42] [INFO ] Computed 40 invariants in 19 ms
[2024-05-28 04:43:42] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 04:43:55] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 3 ms to minimize.
[2024-05-28 04:43:55] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2024-05-28 04:43:56] [INFO ] Deduced a trap composed of 98 places in 247 ms of which 2 ms to minimize.
[2024-05-28 04:44:03] [INFO ] Deduced a trap composed of 86 places in 202 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/1470 variables, and 37 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/324 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1164/1164 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 04:44:12] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 2 ms to minimize.
[2024-05-28 04:44:12] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-05-28 04:44:12] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-28 04:44:13] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 318/1470 variables, and 41 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/324 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1164 constraints, Known Traps: 8/8 constraints]
After SMT, in 46783ms problems are : Problem set: 0 solved, 1164 unsolved
Search for dead transitions found 0 dead transitions in 46796ms
[2024-05-28 04:44:29] [INFO ] Flow matrix only has 1146 transitions (discarded 24 similar events)
[2024-05-28 04:44:29] [INFO ] Invariant cache hit.
[2024-05-28 04:44:30] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-28 04:44:30] [INFO ] Flow matrix only has 1146 transitions (discarded 24 similar events)
[2024-05-28 04:44:30] [INFO ] Invariant cache hit.
[2024-05-28 04:44:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:44:39] [INFO ] Implicit Places using invariants and state equation in 9118 ms returned []
Implicit Place search using SMT with State Equation took 9532 ms to find 0 implicit places.
[2024-05-28 04:44:39] [INFO ] Redundant transitions in 65 ms returned []
Running 1164 sub problems to find dead transitions.
[2024-05-28 04:44:39] [INFO ] Flow matrix only has 1146 transitions (discarded 24 similar events)
[2024-05-28 04:44:39] [INFO ] Invariant cache hit.
[2024-05-28 04:44:39] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 04:44:53] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 2 ms to minimize.
[2024-05-28 04:44:54] [INFO ] Deduced a trap composed of 50 places in 913 ms of which 2 ms to minimize.
[2024-05-28 04:44:54] [INFO ] Deduced a trap composed of 47 places in 274 ms of which 2 ms to minimize.
[2024-05-28 04:44:55] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 2 ms to minimize.
[2024-05-28 04:44:56] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 2 ms to minimize.
[2024-05-28 04:44:56] [INFO ] Deduced a trap composed of 98 places in 241 ms of which 2 ms to minimize.
[2024-05-28 04:45:02] [INFO ] Deduced a trap composed of 89 places in 292 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
[2024-05-28 04:45:04] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/1470 variables, and 41 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/324 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1164/1164 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD828 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/321 variables, 3/44 constraints. Problems are: Problem set: 100 solved, 1064 unsolved
[2024-05-28 04:45:30] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-28 04:45:31] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-28 04:45:31] [INFO ] Deduced a trap composed of 99 places in 259 ms of which 3 ms to minimize.
[2024-05-28 04:45:34] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 4/48 constraints. Problems are: Problem set: 100 solved, 1064 unsolved
[2024-05-28 04:45:44] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/1470 variables, and 49 constraints, problems are : Problem set: 100 solved, 1064 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 17/21 constraints, State Equation: 0/324 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1164 constraints, Known Traps: 13/13 constraints]
After SMT, in 67333ms problems are : Problem set: 100 solved, 1064 unsolved
Search for dead transitions found 100 dead transitions in 67351ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 324/448 places, 1070/1288 transitions.
Applied a total of 0 rules in 24 ms. Remains 324 /324 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2024-05-28 04:45:46] [INFO ] Redundant transitions in 27 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 123920 ms. Remains : 324/448 places, 1070/1288 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J04T04-LTLFireability-06
Stuttering criterion allowed to conclude after 103 steps with 4 reset in 1 ms.
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J04T04-LTLFireability-06 finished in 124060 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 G((X(!p0)||p1))))'
Support contains 76 out of 448 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1288/1288 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 442 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 438 transition count 1284
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 438 transition count 1284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 436 transition count 1282
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 436 transition count 1282
Applied a total of 18 rules in 37 ms. Remains 436 /448 variables (removed 12) and now considering 1282/1288 (removed 6) transitions.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:45:46] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
// Phase 1: matrix 1258 rows 436 cols
[2024-05-28 04:45:46] [INFO ] Computed 40 invariants in 22 ms
[2024-05-28 04:45:46] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:46:03] [INFO ] Deduced a trap composed of 182 places in 293 ms of which 3 ms to minimize.
[2024-05-28 04:46:04] [INFO ] Deduced a trap composed of 74 places in 315 ms of which 3 ms to minimize.
[2024-05-28 04:46:04] [INFO ] Deduced a trap composed of 99 places in 272 ms of which 2 ms to minimize.
[2024-05-28 04:46:05] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 2 ms to minimize.
[2024-05-28 04:46:06] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 2 ms to minimize.
[2024-05-28 04:46:06] [INFO ] Deduced a trap composed of 47 places in 290 ms of which 3 ms to minimize.
[2024-05-28 04:46:07] [INFO ] Deduced a trap composed of 198 places in 393 ms of which 3 ms to minimize.
[2024-05-28 04:46:11] [INFO ] Deduced a trap composed of 202 places in 265 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1694 variables, and 41 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1276/1276 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 1276 unsolved
[2024-05-28 04:46:17] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 1 ms to minimize.
[2024-05-28 04:46:17] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 1 ms to minimize.
[2024-05-28 04:46:19] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2024-05-28 04:46:19] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1694 variables, and 45 constraints, problems are : Problem set: 0 solved, 1276 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 20/24 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1276 constraints, Known Traps: 12/12 constraints]
After SMT, in 47922ms problems are : Problem set: 0 solved, 1276 unsolved
Search for dead transitions found 0 dead transitions in 47952ms
[2024-05-28 04:46:34] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:46:34] [INFO ] Invariant cache hit.
[2024-05-28 04:46:35] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-28 04:46:35] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:46:35] [INFO ] Invariant cache hit.
[2024-05-28 04:46:36] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:46:46] [INFO ] Implicit Places using invariants and state equation in 11456 ms returned []
Implicit Place search using SMT with State Equation took 11902 ms to find 0 implicit places.
Running 1276 sub problems to find dead transitions.
[2024-05-28 04:46:46] [INFO ] Flow matrix only has 1258 transitions (discarded 24 similar events)
[2024-05-28 04:46:46] [INFO ] Invariant cache hit.
[2024-05-28 04:46:46] [INFO ] State equation strengthened by 112 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J04T04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 454
TRANSITIONS: 6994
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.376s, Sys 0.028s]


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


----------------------------------------------------------------------
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: 1756
MODEL NAME: /home/mcc/execution/model
454 places, 6994 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J04T04"
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 PolyORBLF-PT-S06J04T04, 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 r289-tajo-171654445700316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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