Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620118000163.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-10b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118000163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 11 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-10b-LTLCardinality-00
FORMULA_NAME ASLink-PT-10b-LTLCardinality-01
FORMULA_NAME ASLink-PT-10b-LTLCardinality-02
FORMULA_NAME ASLink-PT-10b-LTLCardinality-03
FORMULA_NAME ASLink-PT-10b-LTLCardinality-04
FORMULA_NAME ASLink-PT-10b-LTLCardinality-05
FORMULA_NAME ASLink-PT-10b-LTLCardinality-06
FORMULA_NAME ASLink-PT-10b-LTLCardinality-07
FORMULA_NAME ASLink-PT-10b-LTLCardinality-08
FORMULA_NAME ASLink-PT-10b-LTLCardinality-09
FORMULA_NAME ASLink-PT-10b-LTLCardinality-10
FORMULA_NAME ASLink-PT-10b-LTLCardinality-11
FORMULA_NAME ASLink-PT-10b-LTLCardinality-12
FORMULA_NAME ASLink-PT-10b-LTLCardinality-13
FORMULA_NAME ASLink-PT-10b-LTLCardinality-14
FORMULA_NAME ASLink-PT-10b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717243652987

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:07:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:07:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:07:36] [INFO ] Load time of PNML (sax parser for PT used): 795 ms
[2024-06-01 12:07:36] [INFO ] Transformed 4410 places.
[2024-06-01 12:07:36] [INFO ] Transformed 5405 transitions.
[2024-06-01 12:07:36] [INFO ] Found NUPN structural information;
[2024-06-01 12:07:36] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 1162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-10b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-10b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 4410 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Discarding 272 places :
Symmetric choice reduction at 0 with 272 rule applications. Total rules 272 place count 4138 transition count 5133
Iterating global reduction 0 with 272 rules applied. Total rules applied 544 place count 4138 transition count 5133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 545 place count 4138 transition count 5132
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 650 place count 4033 transition count 4974
Iterating global reduction 1 with 105 rules applied. Total rules applied 755 place count 4033 transition count 4974
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 787 place count 4033 transition count 4942
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 800 place count 4020 transition count 4929
Iterating global reduction 2 with 13 rules applied. Total rules applied 813 place count 4020 transition count 4929
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 817 place count 4016 transition count 4918
Iterating global reduction 2 with 4 rules applied. Total rules applied 821 place count 4016 transition count 4918
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 824 place count 4013 transition count 4915
Iterating global reduction 2 with 3 rules applied. Total rules applied 827 place count 4013 transition count 4915
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 830 place count 4010 transition count 4905
Iterating global reduction 2 with 3 rules applied. Total rules applied 833 place count 4010 transition count 4905
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 834 place count 4009 transition count 4897
Iterating global reduction 2 with 1 rules applied. Total rules applied 835 place count 4009 transition count 4897
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 836 place count 4008 transition count 4896
Iterating global reduction 2 with 1 rules applied. Total rules applied 837 place count 4008 transition count 4896
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 838 place count 4007 transition count 4888
Iterating global reduction 2 with 1 rules applied. Total rules applied 839 place count 4007 transition count 4888
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 840 place count 4006 transition count 4880
Iterating global reduction 2 with 1 rules applied. Total rules applied 841 place count 4006 transition count 4880
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 842 place count 4005 transition count 4879
Iterating global reduction 2 with 1 rules applied. Total rules applied 843 place count 4005 transition count 4879
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 844 place count 4004 transition count 4871
Iterating global reduction 2 with 1 rules applied. Total rules applied 845 place count 4004 transition count 4871
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 846 place count 4003 transition count 4863
Iterating global reduction 2 with 1 rules applied. Total rules applied 847 place count 4003 transition count 4863
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 848 place count 4002 transition count 4862
Iterating global reduction 2 with 1 rules applied. Total rules applied 849 place count 4002 transition count 4862
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 850 place count 4001 transition count 4854
Iterating global reduction 2 with 1 rules applied. Total rules applied 851 place count 4001 transition count 4854
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 852 place count 4000 transition count 4846
Iterating global reduction 2 with 1 rules applied. Total rules applied 853 place count 4000 transition count 4846
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 854 place count 3999 transition count 4845
Iterating global reduction 2 with 1 rules applied. Total rules applied 855 place count 3999 transition count 4845
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 856 place count 3998 transition count 4837
Iterating global reduction 2 with 1 rules applied. Total rules applied 857 place count 3998 transition count 4837
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 858 place count 3997 transition count 4829
Iterating global reduction 2 with 1 rules applied. Total rules applied 859 place count 3997 transition count 4829
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 860 place count 3996 transition count 4828
Iterating global reduction 2 with 1 rules applied. Total rules applied 861 place count 3996 transition count 4828
Applied a total of 861 rules in 10876 ms. Remains 3996 /4410 variables (removed 414) and now considering 4828/5405 (removed 577) transitions.
// Phase 1: matrix 4828 rows 3996 cols
[2024-06-01 12:07:48] [INFO ] Computed 433 invariants in 264 ms
[2024-06-01 12:07:53] [INFO ] Implicit Places using invariants in 4845 ms returned [3830, 3841, 3852, 3860, 3868, 3876, 3884, 3895, 3903, 3911, 3922]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 4899 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3985/4410 places, 4828/5405 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3972 transition count 4815
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3972 transition count 4815
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 3961 transition count 4804
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 3961 transition count 4804
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 3952 transition count 4795
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 3952 transition count 4795
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3948 transition count 4791
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3948 transition count 4791
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 3946 transition count 4789
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 3946 transition count 4789
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 3944 transition count 4787
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 3944 transition count 4787
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 3942 transition count 4785
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 3942 transition count 4785
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 3940 transition count 4783
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 3940 transition count 4783
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3939 transition count 4782
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3939 transition count 4782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3938 transition count 4781
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3938 transition count 4781
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 3937 transition count 4780
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 3937 transition count 4780
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 3936 transition count 4779
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 3936 transition count 4779
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 3935 transition count 4778
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 3935 transition count 4778
Applied a total of 100 rules in 6571 ms. Remains 3935 /3985 variables (removed 50) and now considering 4778/4828 (removed 50) transitions.
// Phase 1: matrix 4778 rows 3935 cols
[2024-06-01 12:07:59] [INFO ] Computed 422 invariants in 134 ms
[2024-06-01 12:08:04] [INFO ] Implicit Places using invariants in 4813 ms returned []
[2024-06-01 12:08:04] [INFO ] Invariant cache hit.
[2024-06-01 12:08:29] [INFO ] Implicit Places using invariants and state equation in 25033 ms returned []
Implicit Place search using SMT with State Equation took 29855 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3935/4410 places, 4778/5405 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52235 ms. Remains : 3935/4410 places, 4778/5405 transitions.
Support contains 45 out of 3935 places after structural reductions.
[2024-06-01 12:08:30] [INFO ] Flatten gal took : 460 ms
[2024-06-01 12:08:30] [INFO ] Flatten gal took : 289 ms
[2024-06-01 12:08:31] [INFO ] Input system was already deterministic with 4778 transitions.
RANDOM walk for 40000 steps (46 resets) in 3823 ms. (10 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
[2024-06-01 12:08:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1042/1072 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1072 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3804 variables, 303/406 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3804 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 131/3935 variables, 16/422 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3935 variables, 0/422 constraints. Problems are: Problem set: 1 solved, 14 unsolved
SMT process timed out in 5127ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 3935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 722 transitions
Trivial Post-agglo rules discarded 722 transitions
Performed 722 trivial Post agglomeration. Transition count delta: 722
Iterating post reduction 0 with 722 rules applied. Total rules applied 722 place count 3935 transition count 4056
Reduce places removed 722 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 725 rules applied. Total rules applied 1447 place count 3213 transition count 4053
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 1452 place count 3211 transition count 4050
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1455 place count 3208 transition count 4050
Performed 1051 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1051 Pre rules applied. Total rules applied 1455 place count 3208 transition count 2999
Deduced a syphon composed of 1051 places in 17 ms
Ensure Unique test removed 100 places
Reduce places removed 1151 places and 0 transitions.
Iterating global reduction 4 with 2202 rules applied. Total rules applied 3657 place count 2057 transition count 2999
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 4 with 73 rules applied. Total rules applied 3730 place count 2046 transition count 2937
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 63 rules applied. Total rules applied 3793 place count 1984 transition count 2936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3794 place count 1983 transition count 2936
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 39 Pre rules applied. Total rules applied 3794 place count 1983 transition count 2897
Deduced a syphon composed of 39 places in 19 ms
Ensure Unique test removed 39 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 7 with 117 rules applied. Total rules applied 3911 place count 1905 transition count 2897
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 38 Pre rules applied. Total rules applied 3911 place count 1905 transition count 2859
Deduced a syphon composed of 38 places in 46 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 3987 place count 1867 transition count 2859
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3988 place count 1866 transition count 2858
Iterating global reduction 7 with 1 rules applied. Total rules applied 3989 place count 1866 transition count 2858
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3989 place count 1866 transition count 2857
Deduced a syphon composed of 1 places in 32 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3991 place count 1865 transition count 2857
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Deduced a syphon composed of 316 places in 21 ms
Ensure Unique test removed 3 places
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 7 with 635 rules applied. Total rules applied 4626 place count 1546 transition count 2541
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 4630 place count 1542 transition count 2537
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 4635 place count 1541 transition count 2537
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 4636 place count 1541 transition count 2536
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4637 place count 1540 transition count 2536
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 4637 place count 1540 transition count 2535
Deduced a syphon composed of 1 places in 33 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4639 place count 1539 transition count 2535
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 4641 place count 1537 transition count 2533
Iterating global reduction 9 with 2 rules applied. Total rules applied 4643 place count 1537 transition count 2533
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 4645 place count 1537 transition count 2531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4646 place count 1536 transition count 2531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4648 place count 1535 transition count 2536
Free-agglomeration rule applied 12 times.
Iterating global reduction 11 with 12 rules applied. Total rules applied 4660 place count 1535 transition count 2524
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 4672 place count 1523 transition count 2524
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 12 with 9 rules applied. Total rules applied 4681 place count 1523 transition count 2515
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4690 place count 1514 transition count 2515
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 4699 place count 1514 transition count 2515
Applied a total of 4699 rules in 2405 ms. Remains 1514 /3935 variables (removed 2421) and now considering 2515/4778 (removed 2263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2406 ms. Remains : 1514/3935 places, 2515/4778 transitions.
RANDOM walk for 40000 steps (325 resets) in 952 ms. (41 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (29 resets) in 327 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (26 resets) in 346 ms. (115 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (30 resets) in 405 ms. (98 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (30 resets) in 327 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (30 resets) in 303 ms. (131 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (28 resets) in 229 ms. (173 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (30 resets) in 248 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (29 resets) in 236 ms. (168 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (28 resets) in 214 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (29 resets) in 225 ms. (177 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (29 resets) in 231 ms. (172 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (31 resets) in 316 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (31 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (28 resets) in 161 ms. (246 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 102802 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 14
Probabilistic random walk after 102802 steps, saw 24082 distinct states, run finished after 3010 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 2515 rows 1514 cols
[2024-06-01 12:08:44] [INFO ] Computed 268 invariants in 57 ms
[2024-06-01 12:08:45] [INFO ] State equation strengthened by 81 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 487/513 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 942/1455 variables, 179/252 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1455 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 59/1514 variables, 16/268 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1514 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2515/4029 variables, 1514/1782 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4029 variables, 81/1863 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4029 variables, 0/1863 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/4029 variables, 0/1863 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4029/4029 variables, and 1863 constraints, problems are : Problem set: 0 solved, 14 unsolved in 7781 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 195/195 constraints, State Equation: 1514/1514 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 487/513 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 12:08:53] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 942/1455 variables, 179/253 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 4 ms to minimize.
[2024-06-01 12:08:54] [INFO ] Deduced a trap composed of 46 places in 303 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1455 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1455 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 59/1514 variables, 16/271 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1514 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 2515/4029 variables, 1514/1785 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4029 variables, 81/1866 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4029 variables, 14/1880 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4029/4029 variables, and 1880 constraints, problems are : Problem set: 0 solved, 14 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 195/195 constraints, State Equation: 1514/1514 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints]
After SMT, in 52924ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 1514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1514/1514 places, 2515/2515 transitions.
Applied a total of 0 rules in 83 ms. Remains 1514 /1514 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1514/1514 places, 2515/2515 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1514/1514 places, 2515/2515 transitions.
Applied a total of 0 rules in 113 ms. Remains 1514 /1514 variables (removed 0) and now considering 2515/2515 (removed 0) transitions.
[2024-06-01 12:09:38] [INFO ] Invariant cache hit.
[2024-06-01 12:09:40] [INFO ] Implicit Places using invariants in 2554 ms returned [2, 19, 20, 23, 33, 52, 71, 154, 167, 168, 169, 170, 172, 191, 209, 290, 303, 304, 305, 306, 308, 327, 345, 426, 439, 440, 441, 442, 444, 461, 479, 560, 573, 574, 575, 576, 578, 595, 696, 709, 710, 711, 712, 714, 731, 749, 830, 843, 844, 845, 846, 848, 866, 884, 965, 979, 980, 981, 982, 1003, 1021, 1065, 1110, 1123, 1124, 1125, 1127, 1129, 1146, 1164, 1248, 1261, 1262, 1263, 1264, 1265, 1267, 1284, 1302, 1366, 1367, 1388, 1393, 1404, 1405, 1406, 1407, 1408, 1431, 1452, 1453, 1454, 1455]
[2024-06-01 12:09:40] [INFO ] Actually due to overlaps returned [1431, 1408, 33, 52, 172, 191, 308, 327, 444, 461, 578, 595, 714, 731, 848, 866, 1003, 1129, 1146, 1267, 1284, 168, 169, 304, 305, 440, 441, 574, 575, 710, 711, 844, 845, 980, 981, 1124, 1125, 1263, 1264, 1405, 1406, 1452, 170, 306, 442, 576, 712, 846, 982, 1127, 1265, 1407, 1453, 2, 19, 290, 426, 560, 696, 830, 965, 1110, 1248, 1261, 1388, 71, 167, 209, 303, 345, 439, 479, 573, 709, 749, 843, 884, 979, 1021, 1123, 1164, 1302, 1404, 1454, 20, 23, 154, 1262, 1393, 1455]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 2559 ms to find 90 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1424/1514 places, 2515/2515 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 1423 transition count 2353
Reduce places removed 162 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 165 rules applied. Total rules applied 328 place count 1261 transition count 2350
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 331 place count 1258 transition count 2350
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 331 place count 1258 transition count 2274
Deduced a syphon composed of 76 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 484 place count 1181 transition count 2274
Discarding 23 places :
Implicit places reduction removed 23 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 3 with 48 rules applied. Total rules applied 532 place count 1158 transition count 2249
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 557 place count 1133 transition count 2249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 557 place count 1133 transition count 2248
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 559 place count 1132 transition count 2248
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 564 place count 1127 transition count 2243
Iterating global reduction 5 with 5 rules applied. Total rules applied 569 place count 1127 transition count 2243
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 571 place count 1127 transition count 2241
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 572 place count 1126 transition count 2240
Iterating global reduction 6 with 1 rules applied. Total rules applied 573 place count 1126 transition count 2240
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 574 place count 1125 transition count 2239
Iterating global reduction 6 with 1 rules applied. Total rules applied 575 place count 1125 transition count 2239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 576 place count 1125 transition count 2238
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 7 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 7 with 168 rules applied. Total rules applied 744 place count 1041 transition count 2154
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 752 place count 1033 transition count 2146
Iterating global reduction 7 with 8 rules applied. Total rules applied 760 place count 1033 transition count 2146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 768 place count 1033 transition count 2138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 772 place count 1031 transition count 2139
Free-agglomeration rule applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 781 place count 1031 transition count 2130
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 798 place count 1022 transition count 2122
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 799 place count 1022 transition count 2121
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 9 with 21 rules applied. Total rules applied 820 place count 1022 transition count 2100
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 842 place count 1000 transition count 2100
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 10 with 30 rules applied. Total rules applied 872 place count 1000 transition count 2100
Applied a total of 872 rules in 1004 ms. Remains 1000 /1424 variables (removed 424) and now considering 2100/2515 (removed 415) transitions.
// Phase 1: matrix 2100 rows 1000 cols
[2024-06-01 12:09:41] [INFO ] Computed 152 invariants in 42 ms
[2024-06-01 12:09:43] [INFO ] Implicit Places using invariants in 1897 ms returned [77, 94, 102, 105, 107, 110, 111, 166, 183, 189, 192, 194, 195, 200, 201, 256, 272, 278, 281, 283, 284, 289, 290, 343, 359, 365, 368, 370, 371, 376, 377, 432, 449, 455, 458, 460, 461, 466, 467, 520, 536, 542, 545, 547, 548, 553, 554, 608, 624, 630, 633, 635, 636, 642, 643, 728, 734, 737, 739, 740, 745, 750, 751, 805, 821, 827, 830, 832, 838, 843, 844, 897, 913, 922, 923, 926, 929, 930]
[2024-06-01 12:09:43] [INFO ] Actually due to overlaps returned [195, 284, 371, 461, 548, 636, 745, 930, 838, 94, 102, 107, 183, 189, 194, 272, 278, 283, 359, 365, 370, 455, 460, 536, 542, 547, 624, 630, 635, 728, 734, 739, 821, 827, 832, 913, 922, 929, 77, 166, 256, 343, 432, 449, 520, 608, 740, 805, 897]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1901 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 951/1514 places, 2100/2515 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 951 transition count 2098
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 949 transition count 2098
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 39 place count 914 transition count 2063
Iterating global reduction 2 with 35 rules applied. Total rules applied 74 place count 914 transition count 2063
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 907 transition count 2056
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 907 transition count 2056
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 124 place count 889 transition count 2038
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 888 transition count 2036
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 888 transition count 2036
Free-agglomeration rule applied 29 times.
Iterating global reduction 2 with 29 rules applied. Total rules applied 155 place count 888 transition count 2007
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 184 place count 859 transition count 2007
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 193 place count 859 transition count 1998
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 202 place count 850 transition count 1998
Applied a total of 202 rules in 386 ms. Remains 850 /951 variables (removed 101) and now considering 1998/2100 (removed 102) transitions.
// Phase 1: matrix 1998 rows 850 cols
[2024-06-01 12:09:43] [INFO ] Computed 103 invariants in 42 ms
[2024-06-01 12:09:45] [INFO ] Implicit Places using invariants in 1310 ms returned [97, 98, 171, 172, 244, 245, 315, 316, 393, 394, 464, 465, 537, 538, 628, 629, 705, 706, 778]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1314 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 831/1514 places, 1998/2515 transitions.
Applied a total of 0 rules in 50 ms. Remains 831 /831 variables (removed 0) and now considering 1998/1998 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 7327 ms. Remains : 831/1514 places, 1998/2515 transitions.
RANDOM walk for 40000 steps (588 resets) in 620 ms. (64 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (70 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (74 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (73 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 115 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (74 resets) in 115 ms. (344 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (79 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (78 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (70 resets) in 136 ms. (291 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (73 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (72 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 150732 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 14
Probabilistic random walk after 150732 steps, saw 39376 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 1998 rows 831 cols
[2024-06-01 12:09:49] [INFO ] Computed 84 invariants in 36 ms
[2024-06-01 12:09:49] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 128/154 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 602/756 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 75/831 variables, 13/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1998/2829 variables, 831/915 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2829 variables, 9/924 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2829 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/2829 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2829/2829 variables, and 924 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3987 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 831/831 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 128/154 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 12:09:53] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 602/756 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 3 ms to minimize.
[2024-06-01 12:09:54] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/756 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 75/831 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/831 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1998/2829 variables, 831/918 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2829 variables, 9/927 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2829 variables, 14/941 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 12:11:04] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2829/2829 variables, and 942 constraints, problems are : Problem set: 0 solved, 14 unsolved in 75011 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 831/831 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints]
After SMT, in 79071ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 831 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 831/831 places, 1998/1998 transitions.
Applied a total of 0 rules in 49 ms. Remains 831 /831 variables (removed 0) and now considering 1998/1998 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 831/831 places, 1998/1998 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 831/831 places, 1998/1998 transitions.
Applied a total of 0 rules in 46 ms. Remains 831 /831 variables (removed 0) and now considering 1998/1998 (removed 0) transitions.
[2024-06-01 12:11:08] [INFO ] Invariant cache hit.
[2024-06-01 12:11:09] [INFO ] Implicit Places using invariants in 940 ms returned []
[2024-06-01 12:11:09] [INFO ] Invariant cache hit.
[2024-06-01 12:11:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 12:11:13] [INFO ] Implicit Places using invariants and state equation in 3792 ms returned []
Implicit Place search using SMT with State Equation took 4736 ms to find 0 implicit places.
[2024-06-01 12:11:13] [INFO ] Redundant transitions in 161 ms returned []
Running 1997 sub problems to find dead transitions.
[2024-06-01 12:11:13] [INFO ] Invariant cache hit.
[2024-06-01 12:11:13] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1997 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 830/2829 variables, and 42 constraints, problems are : Problem set: 0 solved, 1997 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 42/68 constraints, State Equation: 0/831 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 1997/1997 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1997 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1997 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 830/2829 variables, and 42 constraints, problems are : Problem set: 0 solved, 1997 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/16 constraints, Generalized P Invariants (flows): 42/68 constraints, State Equation: 0/831 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1997 constraints, Known Traps: 0/0 constraints]
After SMT, in 62008ms problems are : Problem set: 0 solved, 1997 unsolved
Search for dead transitions found 0 dead transitions in 62044ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67010 ms. Remains : 831/831 places, 1998/1998 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ASLink-PT-10b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 161 stabilizing places and 161 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 4 out of 3935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3930 transition count 4761
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3930 transition count 4761
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 3926 transition count 4750
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 3926 transition count 4750
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3925 transition count 4748
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3924 transition count 4740
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3923 transition count 4732
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3922 transition count 4731
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3921 transition count 4723
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3921 transition count 4723
Applied a total of 29 rules in 3943 ms. Remains 3921 /3935 variables (removed 14) and now considering 4723/4778 (removed 55) transitions.
// Phase 1: matrix 4723 rows 3921 cols
[2024-06-01 12:12:19] [INFO ] Computed 422 invariants in 82 ms
[2024-06-01 12:12:22] [INFO ] Implicit Places using invariants in 3095 ms returned []
[2024-06-01 12:12:22] [INFO ] Invariant cache hit.
[2024-06-01 12:12:47] [INFO ] Implicit Places using invariants and state equation in 24486 ms returned []
Implicit Place search using SMT with State Equation took 27586 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2024-06-01 12:12:47] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 13.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 4.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 3.0)
(s54 6.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 42.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 239/239 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 239 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, Generalized P Invariants (flows): 239/321 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 239/239 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 239 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30146 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, Generalized P Invariants (flows): 239/321 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints]
After SMT, in 63401ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 63462ms
Starting structural reductions in LTL mode, iteration 1 : 3921/3935 places, 4723/4778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95007 ms. Remains : 3921/3935 places, 4723/4778 transitions.
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 1767 ms.
Product exploration explored 100000 steps with 50000 reset in 1509 ms.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 28 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-10b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10b-LTLCardinality-01 finished in 98896 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 4 out of 3935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 734 transitions
Trivial Post-agglo rules discarded 734 transitions
Performed 734 trivial Post agglomeration. Transition count delta: 734
Iterating post reduction 0 with 734 rules applied. Total rules applied 734 place count 3934 transition count 4043
Reduce places removed 734 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 737 rules applied. Total rules applied 1471 place count 3200 transition count 4040
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1474 place count 3198 transition count 4039
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1475 place count 3197 transition count 4039
Performed 1063 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1063 Pre rules applied. Total rules applied 1475 place count 3197 transition count 2976
Deduced a syphon composed of 1063 places in 19 ms
Ensure Unique test removed 103 places
Reduce places removed 1166 places and 0 transitions.
Iterating global reduction 4 with 2229 rules applied. Total rules applied 3704 place count 2031 transition count 2976
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 4 with 73 rules applied. Total rules applied 3777 place count 2021 transition count 2913
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 5 with 63 rules applied. Total rules applied 3840 place count 1958 transition count 2913
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 41 Pre rules applied. Total rules applied 3840 place count 1958 transition count 2872
Deduced a syphon composed of 41 places in 20 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 6 with 123 rules applied. Total rules applied 3963 place count 1876 transition count 2872
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 3963 place count 1876 transition count 2832
Deduced a syphon composed of 40 places in 19 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 4043 place count 1836 transition count 2832
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 4046 place count 1833 transition count 2817
Iterating global reduction 6 with 3 rules applied. Total rules applied 4049 place count 1833 transition count 2817
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4049 place count 1833 transition count 2816
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4051 place count 1832 transition count 2816
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4052 place count 1831 transition count 2808
Iterating global reduction 6 with 1 rules applied. Total rules applied 4053 place count 1831 transition count 2808
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4054 place count 1830 transition count 2800
Iterating global reduction 6 with 1 rules applied. Total rules applied 4055 place count 1830 transition count 2800
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4056 place count 1829 transition count 2792
Iterating global reduction 6 with 1 rules applied. Total rules applied 4057 place count 1829 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4058 place count 1828 transition count 2784
Iterating global reduction 6 with 1 rules applied. Total rules applied 4059 place count 1828 transition count 2784
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 9 ms
Ensure Unique test removed 2 places
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 6 with 626 rules applied. Total rules applied 4685 place count 1514 transition count 2472
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4689 place count 1510 transition count 2468
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4694 place count 1509 transition count 2468
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 4695 place count 1509 transition count 2467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4696 place count 1508 transition count 2467
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4696 place count 1508 transition count 2466
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4698 place count 1507 transition count 2466
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4700 place count 1505 transition count 2464
Iterating global reduction 8 with 2 rules applied. Total rules applied 4702 place count 1505 transition count 2464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 4704 place count 1505 transition count 2462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4705 place count 1504 transition count 2462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4707 place count 1503 transition count 2467
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4709 place count 1501 transition count 2465
Reduce places removed 19 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 10 with 28 rules applied. Total rules applied 4737 place count 1482 transition count 2456
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 4746 place count 1473 transition count 2456
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 29 Pre rules applied. Total rules applied 4746 place count 1473 transition count 2427
Deduced a syphon composed of 29 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 59 rules applied. Total rules applied 4805 place count 1443 transition count 2427
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 12 with 20 rules applied. Total rules applied 4825 place count 1423 transition count 2427
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 4825 place count 1423 transition count 2426
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4827 place count 1422 transition count 2426
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 10 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 13 with 60 rules applied. Total rules applied 4887 place count 1392 transition count 2396
Discarding 19 places :
Symmetric choice reduction at 13 with 19 rule applications. Total rules 4906 place count 1373 transition count 2377
Iterating global reduction 13 with 19 rules applied. Total rules applied 4925 place count 1373 transition count 2377
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 4935 place count 1363 transition count 2367
Iterating global reduction 13 with 10 rules applied. Total rules applied 4945 place count 1363 transition count 2367
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4955 place count 1363 transition count 2357
Applied a total of 4955 rules in 2690 ms. Remains 1363 /3935 variables (removed 2572) and now considering 2357/4778 (removed 2421) transitions.
// Phase 1: matrix 2357 rows 1363 cols
[2024-06-01 12:13:57] [INFO ] Computed 225 invariants in 80 ms
[2024-06-01 12:13:59] [INFO ] Implicit Places using invariants in 2708 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 623, 624, 636, 637, 639, 656, 674, 694, 745, 746, 758, 759, 761, 778, 796, 816, 867, 868, 880, 881, 883, 900, 918, 939, 991, 992, 1004, 1005, 1007, 1024, 1042, 1063, 1121, 1122, 1134, 1135, 1136, 1137, 1139, 1156, 1174, 1194, 1245, 1246, 1249, 1260, 1261, 1262, 1280, 1301, 1302, 1303, 1304]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 2718 ms to find 91 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1272/3935 places, 2357/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 1272 transition count 2192
Reduce places removed 165 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 166 rules applied. Total rules applied 331 place count 1107 transition count 2191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 332 place count 1106 transition count 2191
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 332 place count 1106 transition count 2143
Deduced a syphon composed of 48 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 429 place count 1057 transition count 2143
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 441 place count 1053 transition count 2135
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 449 place count 1045 transition count 2135
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 452 place count 1042 transition count 2132
Iterating global reduction 5 with 3 rules applied. Total rules applied 455 place count 1042 transition count 2132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 458 place count 1042 transition count 2129
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 8 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 610 place count 966 transition count 2053
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 614 place count 964 transition count 2054
Applied a total of 614 rules in 395 ms. Remains 964 /1272 variables (removed 308) and now considering 2054/2357 (removed 303) transitions.
// Phase 1: matrix 2054 rows 964 cols
[2024-06-01 12:14:00] [INFO ] Computed 129 invariants in 37 ms
[2024-06-01 12:14:01] [INFO ] Implicit Places using invariants in 1633 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 439, 445, 450, 527, 533, 538, 615, 621, 626, 705, 711, 716, 793, 799, 804, 885, 891, 896, 961]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1636 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 933/3935 places, 2054/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 933 transition count 2053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 932 transition count 2053
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 21 place count 913 transition count 2034
Iterating global reduction 2 with 19 rules applied. Total rules applied 40 place count 913 transition count 2034
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 59 place count 894 transition count 2015
Iterating global reduction 2 with 19 rules applied. Total rules applied 78 place count 894 transition count 2015
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 885 transition count 2006
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 885 transition count 2006
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 116 place count 875 transition count 1996
Applied a total of 116 rules in 247 ms. Remains 875 /933 variables (removed 58) and now considering 1996/2054 (removed 58) transitions.
// Phase 1: matrix 1996 rows 875 cols
[2024-06-01 12:14:02] [INFO ] Computed 98 invariants in 38 ms
[2024-06-01 12:14:03] [INFO ] Implicit Places using invariants in 1644 ms returned []
[2024-06-01 12:14:03] [INFO ] Invariant cache hit.
[2024-06-01 12:14:08] [INFO ] Implicit Places using invariants and state equation in 4672 ms returned []
Implicit Place search using SMT with State Equation took 6319 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 875/3935 places, 1996/4778 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 14012 ms. Remains : 875/3935 places, 1996/4778 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-03
Product exploration explored 100000 steps with 1038 reset in 762 ms.
Product exploration explored 100000 steps with 1004 reset in 716 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 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (407 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (52 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (55 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 161498 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 161498 steps, saw 39943 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2024-06-01 12:14:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/234 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/252 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 397/649 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/696 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/696 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 173/869 variables, 26/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/869 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/873 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/875 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/875 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1996/2871 variables, 875/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2871 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2871 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2871/2871 variables, and 973 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1633 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 875/875 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/234 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/252 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 397/649 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/696 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/696 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 173/869 variables, 26/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/869 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/873 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/875 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/875 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1996/2871 variables, 875/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2871 variables, 2/975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2871 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2871 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2871/2871 variables, and 975 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2746 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 875/875 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4403ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 555 ms.
Support contains 4 out of 875 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 875/875 places, 1996/1996 transitions.
Free-agglomeration rule applied 49 times.
Iterating global reduction 0 with 49 rules applied. Total rules applied 49 place count 875 transition count 1947
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 107 place count 826 transition count 1938
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 1 with 29 rules applied. Total rules applied 136 place count 826 transition count 1909
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 165 place count 797 transition count 1909
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 797 transition count 1909
Applied a total of 166 rules in 336 ms. Remains 797 /875 variables (removed 78) and now considering 1909/1996 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 337 ms. Remains : 797/875 places, 1909/1996 transitions.
RANDOM walk for 40000 steps (611 resets) in 243 ms. (163 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (80 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 170711 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :1 out of 2
Probabilistic random walk after 170711 steps, saw 43523 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :1
// Phase 1: matrix 1909 rows 797 cols
[2024-06-01 12:14:22] [INFO ] Computed 98 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/205 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 317/522 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/558 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/739 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/765 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/765 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/797 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2706 variables, 797/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2706 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2706 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2706/2706 variables, and 895 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1129 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/205 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 317/522 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/558 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/739 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/765 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/765 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/797 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2706 variables, 797/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2706 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:14:25] [INFO ] Deduced a trap composed of 54 places in 324 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2706 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2706 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2706 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2706/2706 variables, and 897 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2005 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3179ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 236 ms.
Support contains 4 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1909/1909 transitions.
Applied a total of 0 rules in 68 ms. Remains 797 /797 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 797/797 places, 1909/1909 transitions.
RANDOM walk for 40000 steps (612 resets) in 322 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (77 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 170002 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 170002 steps, saw 43375 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-06-01 12:14:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/205 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 317/522 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/558 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/739 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/765 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/765 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/797 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2706 variables, 797/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2706 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2706 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2706/2706 variables, and 895 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/205 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 317/522 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/558 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/739 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/765 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/765 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/797 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2706 variables, 797/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2706 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2706 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2706 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2706/2706 variables, and 896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1478 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2689ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 249 ms.
Support contains 4 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1909/1909 transitions.
Applied a total of 0 rules in 42 ms. Remains 797 /797 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 797/797 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1909/1909 transitions.
Applied a total of 0 rules in 42 ms. Remains 797 /797 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-06-01 12:14:31] [INFO ] Invariant cache hit.
[2024-06-01 12:14:33] [INFO ] Implicit Places using invariants in 1661 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 376, 377, 447, 448, 518, 519, 591, 592, 667, 668]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1669 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 779/797 places, 1909/1909 transitions.
Applied a total of 0 rules in 67 ms. Remains 779 /779 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1778 ms. Remains : 779/797 places, 1909/1909 transitions.
RANDOM walk for 40000 steps (616 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (79 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 175837 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 175837 steps, saw 45232 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 1909 rows 779 cols
[2024-06-01 12:14:36] [INFO ] Computed 80 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 234/238 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/249 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/547 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/571 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 169/740 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/766 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/766 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/779 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/779 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2688 variables, 779/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2688 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2688 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2688/2688 variables, and 859 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 779/779 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 234/238 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/249 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/547 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/571 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 169/740 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/766 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/766 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/779 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/779 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2688 variables, 779/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2688 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2688 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2688 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2688/2688 variables, and 860 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2100 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 779/779 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3187ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 360 ms.
Support contains 4 out of 779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 1909/1909 transitions.
Applied a total of 0 rules in 69 ms. Remains 779 /779 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 779/779 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 1909/1909 transitions.
Applied a total of 0 rules in 69 ms. Remains 779 /779 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-06-01 12:14:40] [INFO ] Invariant cache hit.
[2024-06-01 12:14:41] [INFO ] Implicit Places using invariants in 1564 ms returned []
[2024-06-01 12:14:41] [INFO ] Invariant cache hit.
[2024-06-01 12:14:45] [INFO ] Implicit Places using invariants and state equation in 3863 ms returned []
Implicit Place search using SMT with State Equation took 5440 ms to find 0 implicit places.
[2024-06-01 12:14:45] [INFO ] Redundant transitions in 192 ms returned []
Running 1858 sub problems to find dead transitions.
[2024-06-01 12:14:45] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/778 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
SMT process timed out in 31927ms, After SMT, problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 31967ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37684 ms. Remains : 779/779 places, 1909/1909 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 65 ms. Remains 779 /779 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 12:15:17] [INFO ] Invariant cache hit.
[2024-06-01 12:15:18] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:15:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 12:15:18] [INFO ] [Nat]Absence check using 16 positive and 64 generalized place invariants in 55 ms returned sat
[2024-06-01 12:15:19] [INFO ] After 1049ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:15:19] [INFO ] After 1165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:15:19] [INFO ] After 1538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1867 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 875 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 875/875 places, 1996/1996 transitions.
Applied a total of 0 rules in 47 ms. Remains 875 /875 variables (removed 0) and now considering 1996/1996 (removed 0) transitions.
// Phase 1: matrix 1996 rows 875 cols
[2024-06-01 12:15:20] [INFO ] Computed 98 invariants in 36 ms
[2024-06-01 12:15:21] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2024-06-01 12:15:21] [INFO ] Invariant cache hit.
[2024-06-01 12:15:25] [INFO ] Implicit Places using invariants and state equation in 3745 ms returned []
Implicit Place search using SMT with State Equation took 5057 ms to find 0 implicit places.
[2024-06-01 12:15:25] [INFO ] Redundant transitions in 44 ms returned []
Running 1926 sub problems to find dead transitions.
[2024-06-01 12:15:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/864 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
SMT process timed out in 31739ms, After SMT, problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 31765ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36922 ms. Remains : 875/875 places, 1996/1996 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (377 resets) in 500 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (51 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (52 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 142017 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 142017 steps, saw 35355 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 12:16:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/234 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/252 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 397/649 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/696 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/696 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 173/869 variables, 26/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/869 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/873 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/875 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/875 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1996/2871 variables, 875/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2871 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2871 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2871/2871 variables, and 973 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1636 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 875/875 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/234 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/252 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 397/649 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 47/696 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/696 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 173/869 variables, 26/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/869 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/873 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/873 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/875 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/875 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1996/2871 variables, 875/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2871 variables, 2/975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2871 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2871 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2871/2871 variables, and 975 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2665 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 84/84 constraints, State Equation: 875/875 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4314ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 388 ms.
Support contains 4 out of 875 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 875/875 places, 1996/1996 transitions.
Free-agglomeration rule applied 49 times.
Iterating global reduction 0 with 49 rules applied. Total rules applied 49 place count 875 transition count 1947
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 107 place count 826 transition count 1938
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 1 with 29 rules applied. Total rules applied 136 place count 826 transition count 1909
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 165 place count 797 transition count 1909
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 797 transition count 1909
Applied a total of 166 rules in 279 ms. Remains 797 /875 variables (removed 78) and now considering 1909/1996 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 797/875 places, 1909/1996 transitions.
RANDOM walk for 40000 steps (585 resets) in 878 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (81 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (83 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 153051 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :1 out of 2
Probabilistic random walk after 153051 steps, saw 38700 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :1
// Phase 1: matrix 1909 rows 797 cols
[2024-06-01 12:16:09] [INFO ] Computed 98 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/205 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 317/522 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/558 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/739 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/765 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/765 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/797 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2706 variables, 797/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2706 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2706 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2706/2706 variables, and 895 constraints, problems are : Problem set: 0 solved, 1 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/205 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 317/522 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/558 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/739 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/765 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/765 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/797 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2706 variables, 797/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2706 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:16:12] [INFO ] Deduced a trap composed of 54 places in 599 ms of which 7 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2706 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2706 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2706 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2706/2706 variables, and 897 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2377 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3389ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 326 ms.
Support contains 4 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1909/1909 transitions.
Applied a total of 0 rules in 70 ms. Remains 797 /797 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 797/797 places, 1909/1909 transitions.
RANDOM walk for 40000 steps (654 resets) in 344 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (76 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 179161 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 179161 steps, saw 46212 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2024-06-01 12:16:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/205 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 317/522 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/558 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/739 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/765 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/765 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/797 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2706 variables, 797/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2706 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2706 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2706/2706 variables, and 895 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1188 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 191/195 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/205 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 317/522 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/558 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/739 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/765 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/765 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 32/797 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2706 variables, 797/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2706 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2706 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2706 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2706/2706 variables, and 896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1576 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 797/797 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2774ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 349 ms.
Support contains 4 out of 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1909/1909 transitions.
Applied a total of 0 rules in 71 ms. Remains 797 /797 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 797/797 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1909/1909 transitions.
Applied a total of 0 rules in 71 ms. Remains 797 /797 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-06-01 12:16:19] [INFO ] Invariant cache hit.
[2024-06-01 12:16:21] [INFO ] Implicit Places using invariants in 1601 ms returned [88, 89, 159, 160, 230, 231, 301, 302, 376, 377, 447, 448, 518, 519, 591, 592, 667, 668]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1605 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 779/797 places, 1909/1909 transitions.
Applied a total of 0 rules in 68 ms. Remains 779 /779 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1744 ms. Remains : 779/797 places, 1909/1909 transitions.
RANDOM walk for 40000 steps (604 resets) in 338 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (79 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 190694 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 190694 steps, saw 49137 distinct states, run finished after 3005 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 1909 rows 779 cols
[2024-06-01 12:16:24] [INFO ] Computed 80 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 234/238 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/249 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/547 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/571 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 169/740 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/766 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/766 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/779 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/779 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2688 variables, 779/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2688 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2688 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2688/2688 variables, and 859 constraints, problems are : Problem set: 0 solved, 1 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 779/779 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 234/238 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/249 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 298/547 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/571 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 169/740 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 26/766 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/766 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/779 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/779 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1909/2688 variables, 779/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2688 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2688 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2688 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2688/2688 variables, and 860 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 779/779 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2932ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 253 ms.
Support contains 4 out of 779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 1909/1909 transitions.
Applied a total of 0 rules in 43 ms. Remains 779 /779 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 779/779 places, 1909/1909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 1909/1909 transitions.
Applied a total of 0 rules in 39 ms. Remains 779 /779 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
[2024-06-01 12:16:27] [INFO ] Invariant cache hit.
[2024-06-01 12:16:28] [INFO ] Implicit Places using invariants in 1079 ms returned []
[2024-06-01 12:16:28] [INFO ] Invariant cache hit.
[2024-06-01 12:16:31] [INFO ] Implicit Places using invariants and state equation in 3165 ms returned []
Implicit Place search using SMT with State Equation took 4253 ms to find 0 implicit places.
[2024-06-01 12:16:31] [INFO ] Redundant transitions in 73 ms returned []
Running 1858 sub problems to find dead transitions.
[2024-06-01 12:16:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/778 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1858 unsolved
SMT process timed out in 31663ms, After SMT, problems are : Problem set: 0 solved, 1858 unsolved
Search for dead transitions found 0 dead transitions in 31701ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36083 ms. Remains : 779/779 places, 1909/1909 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 68 ms. Remains 779 /779 variables (removed 0) and now considering 1909/1909 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 12:17:03] [INFO ] Invariant cache hit.
[2024-06-01 12:17:03] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:17:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-06-01 12:17:04] [INFO ] [Nat]Absence check using 16 positive and 64 generalized place invariants in 59 ms returned sat
[2024-06-01 12:17:05] [INFO ] After 996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:17:05] [INFO ] After 1134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:17:05] [INFO ] After 1505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1839 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1026 reset in 369 ms.
Product exploration explored 100000 steps with 1057 reset in 572 ms.
Support contains 4 out of 875 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 875/875 places, 1996/1996 transitions.
Applied a total of 0 rules in 44 ms. Remains 875 /875 variables (removed 0) and now considering 1996/1996 (removed 0) transitions.
// Phase 1: matrix 1996 rows 875 cols
[2024-06-01 12:17:07] [INFO ] Computed 98 invariants in 23 ms
[2024-06-01 12:17:08] [INFO ] Implicit Places using invariants in 1584 ms returned []
[2024-06-01 12:17:08] [INFO ] Invariant cache hit.
[2024-06-01 12:17:12] [INFO ] Implicit Places using invariants and state equation in 4183 ms returned []
Implicit Place search using SMT with State Equation took 5768 ms to find 0 implicit places.
[2024-06-01 12:17:12] [INFO ] Redundant transitions in 77 ms returned []
Running 1926 sub problems to find dead transitions.
[2024-06-01 12:17:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/864 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
SMT process timed out in 31584ms, After SMT, problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 31630ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37536 ms. Remains : 875/875 places, 1996/1996 transitions.
Treatment of property ASLink-PT-10b-LTLCardinality-03 finished in 230735 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&&F(!p1)) U G(!p0)))'
Support contains 3 out of 3935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 735 transitions
Trivial Post-agglo rules discarded 735 transitions
Performed 735 trivial Post agglomeration. Transition count delta: 735
Iterating post reduction 0 with 735 rules applied. Total rules applied 735 place count 3934 transition count 4042
Reduce places removed 735 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 740 rules applied. Total rules applied 1475 place count 3199 transition count 4037
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1478 place count 3196 transition count 4037
Performed 1066 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1066 Pre rules applied. Total rules applied 1478 place count 3196 transition count 2971
Deduced a syphon composed of 1066 places in 14 ms
Ensure Unique test removed 104 places
Reduce places removed 1170 places and 0 transitions.
Iterating global reduction 3 with 2236 rules applied. Total rules applied 3714 place count 2026 transition count 2971
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3788 place count 2016 transition count 2907
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3852 place count 1952 transition count 2907
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3852 place count 1952 transition count 2866
Deduced a syphon composed of 41 places in 16 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3975 place count 1870 transition count 2866
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3975 place count 1870 transition count 2826
Deduced a syphon composed of 40 places in 14 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4055 place count 1830 transition count 2826
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 4058 place count 1827 transition count 2811
Iterating global reduction 5 with 3 rules applied. Total rules applied 4061 place count 1827 transition count 2811
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4061 place count 1827 transition count 2810
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4063 place count 1826 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4064 place count 1825 transition count 2802
Iterating global reduction 5 with 1 rules applied. Total rules applied 4065 place count 1825 transition count 2802
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4066 place count 1824 transition count 2794
Iterating global reduction 5 with 1 rules applied. Total rules applied 4067 place count 1824 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4068 place count 1823 transition count 2786
Iterating global reduction 5 with 1 rules applied. Total rules applied 4069 place count 1823 transition count 2786
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4070 place count 1822 transition count 2778
Iterating global reduction 5 with 1 rules applied. Total rules applied 4071 place count 1822 transition count 2778
Performed 308 Post agglomeration using F-continuation condition.Transition count delta: 308
Deduced a syphon composed of 308 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 5 with 618 rules applied. Total rules applied 4689 place count 1512 transition count 2470
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4693 place count 1508 transition count 2466
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4698 place count 1507 transition count 2466
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4699 place count 1507 transition count 2465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4700 place count 1506 transition count 2465
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4700 place count 1506 transition count 2464
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4702 place count 1505 transition count 2464
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4704 place count 1503 transition count 2462
Iterating global reduction 7 with 2 rules applied. Total rules applied 4706 place count 1503 transition count 2462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 4708 place count 1503 transition count 2460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4709 place count 1502 transition count 2460
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4711 place count 1501 transition count 2465
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 4712 place count 1501 transition count 2465
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4714 place count 1499 transition count 2463
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 27 rules applied. Total rules applied 4741 place count 1481 transition count 2454
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4750 place count 1472 transition count 2454
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 27 Pre rules applied. Total rules applied 4750 place count 1472 transition count 2427
Deduced a syphon composed of 27 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 55 rules applied. Total rules applied 4805 place count 1444 transition count 2427
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 4824 place count 1425 transition count 2427
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4824 place count 1425 transition count 2426
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4826 place count 1424 transition count 2426
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 56 rules applied. Total rules applied 4882 place count 1396 transition count 2398
Discarding 18 places :
Symmetric choice reduction at 12 with 18 rule applications. Total rules 4900 place count 1378 transition count 2380
Iterating global reduction 12 with 18 rules applied. Total rules applied 4918 place count 1378 transition count 2380
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 4927 place count 1369 transition count 2371
Iterating global reduction 12 with 9 rules applied. Total rules applied 4936 place count 1369 transition count 2371
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4945 place count 1369 transition count 2362
Applied a total of 4945 rules in 2031 ms. Remains 1369 /3935 variables (removed 2566) and now considering 2362/4778 (removed 2416) transitions.
// Phase 1: matrix 2362 rows 1369 cols
[2024-06-01 12:17:47] [INFO ] Computed 226 invariants in 38 ms
[2024-06-01 12:17:49] [INFO ] Implicit Places using invariants in 2352 ms returned [1, 18, 19, 31, 48, 66, 86, 138, 148, 149, 151, 168, 186, 206, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 514, 515, 517, 534, 552, 572, 623, 624, 636, 637, 639, 656, 674, 694, 745, 746, 758, 759, 761, 778, 796, 816, 867, 868, 880, 881, 883, 900, 918, 938, 989, 990, 1002, 1003, 1006, 1023, 1041, 1139, 1142, 1143, 1145, 1162, 1180, 1200, 1251, 1252, 1255, 1266, 1267, 1268, 1286, 1307, 1308, 1309, 1310]
Discarding 87 places :
Implicit Place search using SMT only with invariants took 2356 ms to find 87 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1282/3935 places, 2362/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 1282 transition count 2200
Reduce places removed 162 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 163 rules applied. Total rules applied 325 place count 1120 transition count 2199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 326 place count 1119 transition count 2199
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 326 place count 1119 transition count 2151
Deduced a syphon composed of 48 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 423 place count 1070 transition count 2151
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 13 rules applied. Total rules applied 436 place count 1065 transition count 2143
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 444 place count 1057 transition count 2143
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 447 place count 1054 transition count 2140
Iterating global reduction 5 with 3 rules applied. Total rules applied 450 place count 1054 transition count 2140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 453 place count 1054 transition count 2137
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 5 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 605 place count 978 transition count 2061
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 609 place count 976 transition count 2062
Applied a total of 609 rules in 237 ms. Remains 976 /1282 variables (removed 306) and now considering 2062/2362 (removed 300) transitions.
// Phase 1: matrix 2062 rows 976 cols
[2024-06-01 12:17:49] [INFO ] Computed 133 invariants in 23 ms
[2024-06-01 12:17:51] [INFO ] Implicit Places using invariants in 1532 ms returned [89, 95, 100, 175, 181, 186, 263, 269, 274, 351, 357, 362, 439, 445, 450, 527, 533, 538, 615, 621, 626, 703, 709, 714, 798, 804, 811, 897, 903, 908, 973]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1537 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 945/3935 places, 2062/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 945 transition count 2061
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 944 transition count 2061
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 924 transition count 2041
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 924 transition count 2041
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 904 transition count 2021
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 904 transition count 2021
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 894 transition count 2011
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 894 transition count 2011
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 122 place count 884 transition count 2001
Applied a total of 122 rules in 290 ms. Remains 884 /945 variables (removed 61) and now considering 2001/2062 (removed 61) transitions.
// Phase 1: matrix 2001 rows 884 cols
[2024-06-01 12:17:51] [INFO ] Computed 102 invariants in 54 ms
[2024-06-01 12:17:53] [INFO ] Implicit Places using invariants in 1374 ms returned []
[2024-06-01 12:17:53] [INFO ] Invariant cache hit.
[2024-06-01 12:17:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:17:57] [INFO ] Implicit Places using invariants and state equation in 4501 ms returned []
Implicit Place search using SMT with State Equation took 5883 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 884/3935 places, 2001/4778 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 12334 ms. Remains : 884/3935 places, 2001/4778 transitions.
Stuttering acceptance computed with spot in 125 ms :[p0, p1, p0, true]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-04
Product exploration explored 100000 steps with 983 reset in 509 ms.
Product exploration explored 100000 steps with 940 reset in 395 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, p0]
RANDOM walk for 40000 steps (382 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (53 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 194493 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 1
Probabilistic random walk after 194493 steps, saw 47057 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-06-01 12:18:01] [INFO ] Invariant cache hit.
[2024-06-01 12:18:01] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/260 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/264 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 154/418 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/422 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 156/578 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/588 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/590 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/590 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 182/772 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 17/789 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:18:02] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/789 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/789 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 71/860 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/860 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/882 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/882 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/884 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:18:02] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/884 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/884 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2885/2885 variables, and 988 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2435 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 884/884 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/260 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/264 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 154/418 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/422 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 156/578 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/588 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/590 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/590 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 182/772 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:18:04] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 17/789 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/789 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:18:05] [INFO ] Deduced a trap composed of 22 places in 470 ms of which 7 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/789 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/789 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 71/860 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/860 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 22/882 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/882 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/884 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/884 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/884 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2001/2885 variables, 884/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2885 variables, 5/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2885 variables, 1/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2885 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/2885 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2885/2885 variables, and 996 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2607 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 884/884 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 5060ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 285 ms.
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 884/884 places, 2001/2001 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 884 transition count 2000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 883 transition count 2000
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 881 transition count 1998
Free-agglomeration rule applied 50 times.
Iterating global reduction 2 with 50 rules applied. Total rules applied 56 place count 881 transition count 1948
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 59 rules applied. Total rules applied 115 place count 831 transition count 1939
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 144 place count 831 transition count 1910
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 173 place count 802 transition count 1910
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 802 transition count 1909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 801 transition count 1908
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 800 transition count 1908
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 176 place count 800 transition count 1906
Deduced a syphon composed of 2 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 181 place count 797 transition count 1906
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 182 place count 796 transition count 1905
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 796 transition count 1905
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 796 transition count 1904
Applied a total of 184 rules in 348 ms. Remains 796 /884 variables (removed 88) and now considering 1904/2001 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 796/884 places, 1904/2001 transitions.
RANDOM walk for 40000 steps (634 resets) in 256 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (82 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 200058 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 200058 steps, saw 53395 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 1904 rows 796 cols
[2024-06-01 12:18:10] [INFO ] Computed 100 invariants in 32 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/86 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/230 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/232 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 140/372 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/374 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 142/516 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/523 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/523 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/531 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/531 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 173/704 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 17/721 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/721 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 51/772 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/772 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 22/794 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/794 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/796 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/796 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1904/2700 variables, 796/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/2700 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2700 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2700/2700 variables, and 896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2120 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 796/796 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/86 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/230 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/232 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 140/372 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/374 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 142/516 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/523 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/523 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/531 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/531 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 173/704 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 17/721 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:18:13] [INFO ] Deduced a trap composed of 21 places in 714 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/721 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/721 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 51/772 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/772 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/794 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/794 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/796 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/796 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1904/2700 variables, 796/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2700 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2700 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2700 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2700/2700 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2939 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 796/796 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 5106ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 309 ms.
Support contains 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 1904/1904 transitions.
Applied a total of 0 rules in 44 ms. Remains 796 /796 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 796/796 places, 1904/1904 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 1904/1904 transitions.
Applied a total of 0 rules in 46 ms. Remains 796 /796 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2024-06-01 12:18:16] [INFO ] Invariant cache hit.
[2024-06-01 12:18:17] [INFO ] Implicit Places using invariants in 1427 ms returned [89, 90, 160, 161, 231, 232, 302, 303, 373, 374, 444, 445, 515, 516, 644, 660, 661, 666, 667]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1433 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 777/796 places, 1904/1904 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 774 transition count 1901
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 774 transition count 1898
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 771 transition count 1898
Applied a total of 12 rules in 119 ms. Remains 771 /777 variables (removed 6) and now considering 1898/1904 (removed 6) transitions.
// Phase 1: matrix 1898 rows 771 cols
[2024-06-01 12:18:17] [INFO ] Computed 81 invariants in 33 ms
[2024-06-01 12:18:18] [INFO ] Implicit Places using invariants in 967 ms returned [572, 573]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 970 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 769/796 places, 1898/1904 transitions.
Applied a total of 0 rules in 70 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2638 ms. Remains : 769/796 places, 1898/1904 transitions.
RANDOM walk for 40000 steps (625 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (79 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 182789 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 1
Probabilistic random walk after 182789 steps, saw 48793 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 1898 rows 769 cols
[2024-06-01 12:18:21] [INFO ] Computed 79 invariants in 21 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/100 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/239 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/379 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 136/515 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/530 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 156/686 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/686 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 48/734 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/734 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 35/769 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/769 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1898/2667 variables, 769/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:18:24] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2667 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2667 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2667 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2667/2667 variables, and 849 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2418 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/100 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/239 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/379 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 136/515 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/530 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 156/686 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/686 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 48/734 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/734 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 35/769 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/769 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:18:25] [INFO ] Deduced a trap composed of 54 places in 705 ms of which 7 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/769 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/769 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1898/2667 variables, 769/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2667 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2667 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/2667 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2667/2667 variables, and 851 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3007 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 5453ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 321 ms.
Support contains 1 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1898/1898 transitions.
Applied a total of 0 rules in 66 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 769/769 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1898/1898 transitions.
Applied a total of 0 rules in 65 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2024-06-01 12:18:27] [INFO ] Invariant cache hit.
[2024-06-01 12:18:29] [INFO ] Implicit Places using invariants in 1557 ms returned []
[2024-06-01 12:18:29] [INFO ] Invariant cache hit.
[2024-06-01 12:18:32] [INFO ] Implicit Places using invariants and state equation in 3564 ms returned []
Implicit Place search using SMT with State Equation took 5124 ms to find 0 implicit places.
[2024-06-01 12:18:33] [INFO ] Redundant transitions in 71 ms returned []
Running 1849 sub problems to find dead transitions.
[2024-06-01 12:18:33] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
SMT process timed out in 31454ms, After SMT, problems are : Problem set: 0 solved, 1849 unsolved
Search for dead transitions found 0 dead transitions in 31493ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36772 ms. Remains : 769/769 places, 1898/1898 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 65 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 12:19:04] [INFO ] Invariant cache hit.
[2024-06-01 12:19:04] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-01 12:19:04] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 66 ms returned sat
[2024-06-01 12:19:06] [INFO ] After 1477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:19:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-06-01 12:19:06] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 49 ms returned sat
[2024-06-01 12:19:07] [INFO ] After 1313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:19:07] [INFO ] After 1481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:19:07] [INFO ] After 1833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 3404 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[true, p0]
Stuttering acceptance computed with spot in 64 ms :[true, p0]
Support contains 1 out of 884 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 884/884 places, 2001/2001 transitions.
Applied a total of 0 rules in 74 ms. Remains 884 /884 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
// Phase 1: matrix 2001 rows 884 cols
[2024-06-01 12:19:08] [INFO ] Computed 102 invariants in 35 ms
[2024-06-01 12:19:10] [INFO ] Implicit Places using invariants in 1571 ms returned []
[2024-06-01 12:19:10] [INFO ] Invariant cache hit.
[2024-06-01 12:19:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 12:19:15] [INFO ] Implicit Places using invariants and state equation in 5007 ms returned []
Implicit Place search using SMT with State Equation took 6585 ms to find 0 implicit places.
[2024-06-01 12:19:15] [INFO ] Redundant transitions in 66 ms returned []
Running 1937 sub problems to find dead transitions.
[2024-06-01 12:19:15] [INFO ] Invariant cache hit.
[2024-06-01 12:19:15] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
SMT process timed out in 31742ms, After SMT, problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 31776ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38518 ms. Remains : 884/884 places, 2001/2001 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, p0]
RANDOM walk for 40000 steps (348 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (52 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 175117 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 175117 steps, saw 42340 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-06-01 12:19:50] [INFO ] Invariant cache hit.
[2024-06-01 12:19:50] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/260 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/264 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 154/418 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/422 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 156/578 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/588 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/590 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/590 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 182/772 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 17/789 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:19:51] [INFO ] Deduced a trap composed of 21 places in 342 ms of which 6 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/789 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/789 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 71/860 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/860 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/882 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/882 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/884 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:19:51] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/884 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/884 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2885/2885 variables, and 988 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3121 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 884/884 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/102 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 158/260 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/264 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 154/418 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/422 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 156/578 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/588 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/590 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/590 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 182/772 variables, 19/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:19:54] [INFO ] Deduced a trap composed of 8 places in 469 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 17/789 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/789 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:19:55] [INFO ] Deduced a trap composed of 22 places in 537 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/789 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/789 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 71/860 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/860 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 22/882 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/882 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/884 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/884 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/884 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2885/2885 variables, and 990 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2986 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 884/884 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 6118ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 389 ms.
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 884/884 places, 2001/2001 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 884 transition count 2000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 883 transition count 2000
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 881 transition count 1998
Free-agglomeration rule applied 50 times.
Iterating global reduction 2 with 50 rules applied. Total rules applied 56 place count 881 transition count 1948
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 59 rules applied. Total rules applied 115 place count 831 transition count 1939
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 144 place count 831 transition count 1910
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 173 place count 802 transition count 1910
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 802 transition count 1909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 801 transition count 1908
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 800 transition count 1908
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 176 place count 800 transition count 1906
Deduced a syphon composed of 2 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 181 place count 797 transition count 1906
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 182 place count 796 transition count 1905
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 796 transition count 1905
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 796 transition count 1904
Applied a total of 184 rules in 366 ms. Remains 796 /884 variables (removed 88) and now considering 1904/2001 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 796/884 places, 1904/2001 transitions.
RANDOM walk for 40000 steps (629 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (78 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 183896 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 183896 steps, saw 48926 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 1904 rows 796 cols
[2024-06-01 12:20:00] [INFO ] Computed 100 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/86 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/230 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/232 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 140/372 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/374 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 142/516 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/523 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/523 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/531 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/531 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 173/704 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 17/721 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/721 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 51/772 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/772 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 22/794 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/794 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/796 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/796 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1904/2700 variables, 796/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/2700 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2700 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2700/2700 variables, and 896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2053 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 796/796 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/86 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/230 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/232 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 140/372 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/374 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 142/516 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/523 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/523 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/531 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/531 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 173/704 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/704 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 17/721 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:20:03] [INFO ] Deduced a trap composed of 21 places in 390 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/721 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/721 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 51/772 variables, 7/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/772 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/794 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/794 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/796 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/796 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1904/2700 variables, 796/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2700 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2700 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/2700 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2700/2700 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 796/796 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 4769ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 286 ms.
Support contains 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 1904/1904 transitions.
Applied a total of 0 rules in 46 ms. Remains 796 /796 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 796/796 places, 1904/1904 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 1904/1904 transitions.
Applied a total of 0 rules in 46 ms. Remains 796 /796 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2024-06-01 12:20:05] [INFO ] Invariant cache hit.
[2024-06-01 12:20:06] [INFO ] Implicit Places using invariants in 1431 ms returned [89, 90, 160, 161, 231, 232, 302, 303, 373, 374, 444, 445, 515, 516, 644, 660, 661, 666, 667]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1434 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 777/796 places, 1904/1904 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 774 transition count 1901
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 774 transition count 1898
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 771 transition count 1898
Applied a total of 12 rules in 195 ms. Remains 771 /777 variables (removed 6) and now considering 1898/1904 (removed 6) transitions.
// Phase 1: matrix 1898 rows 771 cols
[2024-06-01 12:20:06] [INFO ] Computed 81 invariants in 33 ms
[2024-06-01 12:20:08] [INFO ] Implicit Places using invariants in 1589 ms returned [572, 573]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1591 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 769/796 places, 1898/1904 transitions.
Applied a total of 0 rules in 65 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3333 ms. Remains : 769/796 places, 1898/1904 transitions.
RANDOM walk for 40000 steps (638 resets) in 294 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (81 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 188079 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 188079 steps, saw 50140 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 1898 rows 769 cols
[2024-06-01 12:20:11] [INFO ] Computed 79 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/100 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/239 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/379 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 136/515 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/530 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 156/686 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/686 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 48/734 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/734 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 35/769 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/769 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1898/2667 variables, 769/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:20:14] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2667 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2667 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2667 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2667/2667 variables, and 849 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2570 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/100 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 139/239 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/379 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 136/515 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 15/530 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 156/686 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/686 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 48/734 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/734 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 35/769 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/769 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:20:15] [INFO ] Deduced a trap composed of 54 places in 846 ms of which 9 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/769 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/769 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1898/2667 variables, 769/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2667 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2667 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/2667 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2667/2667 variables, and 851 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3100 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 769/769 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 5704ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 271 ms.
Support contains 1 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1898/1898 transitions.
Applied a total of 0 rules in 46 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 769/769 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1898/1898 transitions.
Applied a total of 0 rules in 46 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2024-06-01 12:20:17] [INFO ] Invariant cache hit.
[2024-06-01 12:20:18] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2024-06-01 12:20:18] [INFO ] Invariant cache hit.
[2024-06-01 12:20:21] [INFO ] Implicit Places using invariants and state equation in 2690 ms returned []
Implicit Place search using SMT with State Equation took 3718 ms to find 0 implicit places.
[2024-06-01 12:20:21] [INFO ] Redundant transitions in 43 ms returned []
Running 1849 sub problems to find dead transitions.
[2024-06-01 12:20:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1849 unsolved
SMT process timed out in 31315ms, After SMT, problems are : Problem set: 0 solved, 1849 unsolved
Search for dead transitions found 0 dead transitions in 31338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35156 ms. Remains : 769/769 places, 1898/1898 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 40 ms. Remains 769 /769 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 12:20:52] [INFO ] Invariant cache hit.
[2024-06-01 12:20:53] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-06-01 12:20:53] [INFO ] [Real]Absence check using 15 positive and 64 generalized place invariants in 42 ms returned sat
[2024-06-01 12:20:54] [INFO ] After 1211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:20:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-06-01 12:20:54] [INFO ] [Nat]Absence check using 15 positive and 64 generalized place invariants in 46 ms returned sat
[2024-06-01 12:20:55] [INFO ] After 1020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:20:55] [INFO ] After 1165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:20:55] [INFO ] After 1459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2735 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, p0]
Stuttering acceptance computed with spot in 65 ms :[true, p0]
Stuttering acceptance computed with spot in 55 ms :[true, p0]
Product exploration explored 100000 steps with 935 reset in 558 ms.
Product exploration explored 100000 steps with 964 reset in 450 ms.
Support contains 1 out of 884 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 884/884 places, 2001/2001 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 883 transition count 1999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 882 transition count 1999
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 881 transition count 1998
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 880 transition count 1997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 879 transition count 1997
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 879 transition count 1995
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 877 transition count 1995
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 876 transition count 1994
Applied a total of 12 rules in 185 ms. Remains 876 /884 variables (removed 8) and now considering 1994/2001 (removed 7) transitions.
// Phase 1: matrix 1994 rows 876 cols
[2024-06-01 12:20:57] [INFO ] Computed 101 invariants in 22 ms
[2024-06-01 12:20:58] [INFO ] Implicit Places using invariants in 1744 ms returned [728, 731, 732]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1747 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 873/884 places, 1994/2001 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 873 transition count 1992
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 871 transition count 1992
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 870 transition count 1991
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 870 transition count 1991
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 870 transition count 1990
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 11 place count 868 transition count 1988
Applied a total of 11 rules in 208 ms. Remains 868 /873 variables (removed 5) and now considering 1988/1994 (removed 6) transitions.
// Phase 1: matrix 1988 rows 868 cols
[2024-06-01 12:20:59] [INFO ] Computed 98 invariants in 34 ms
[2024-06-01 12:21:00] [INFO ] Implicit Places using invariants in 1733 ms returned [704]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1735 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 867/884 places, 1988/2001 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 866 transition count 1987
Applied a total of 2 rules in 133 ms. Remains 866 /867 variables (removed 1) and now considering 1987/1988 (removed 1) transitions.
// Phase 1: matrix 1987 rows 866 cols
[2024-06-01 12:21:01] [INFO ] Computed 97 invariants in 34 ms
[2024-06-01 12:21:02] [INFO ] Implicit Places using invariants in 1710 ms returned []
[2024-06-01 12:21:02] [INFO ] Invariant cache hit.
[2024-06-01 12:21:06] [INFO ] Implicit Places using invariants and state equation in 4142 ms returned []
Implicit Place search using SMT with State Equation took 5855 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 866/884 places, 1987/2001 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 9865 ms. Remains : 866/884 places, 1987/2001 transitions.
Treatment of property ASLink-PT-10b-LTLCardinality-04 finished in 201907 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 4 out of 3935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 734 transitions
Trivial Post-agglo rules discarded 734 transitions
Performed 734 trivial Post agglomeration. Transition count delta: 734
Iterating post reduction 0 with 734 rules applied. Total rules applied 734 place count 3934 transition count 4043
Reduce places removed 734 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 739 rules applied. Total rules applied 1473 place count 3200 transition count 4038
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 1477 place count 3197 transition count 4037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1478 place count 3196 transition count 4037
Performed 1063 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1063 Pre rules applied. Total rules applied 1478 place count 3196 transition count 2974
Deduced a syphon composed of 1063 places in 17 ms
Ensure Unique test removed 103 places
Reduce places removed 1166 places and 0 transitions.
Iterating global reduction 4 with 2229 rules applied. Total rules applied 3707 place count 2030 transition count 2974
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 4 with 74 rules applied. Total rules applied 3781 place count 2020 transition count 2910
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 3845 place count 1956 transition count 2910
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 3845 place count 1956 transition count 2870
Deduced a syphon composed of 40 places in 17 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 3965 place count 1876 transition count 2870
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 39 Pre rules applied. Total rules applied 3965 place count 1876 transition count 2831
Deduced a syphon composed of 39 places in 16 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 4043 place count 1837 transition count 2831
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 4046 place count 1834 transition count 2816
Iterating global reduction 6 with 3 rules applied. Total rules applied 4049 place count 1834 transition count 2816
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4049 place count 1834 transition count 2815
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4051 place count 1833 transition count 2815
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4052 place count 1832 transition count 2807
Iterating global reduction 6 with 1 rules applied. Total rules applied 4053 place count 1832 transition count 2807
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4054 place count 1831 transition count 2799
Iterating global reduction 6 with 1 rules applied. Total rules applied 4055 place count 1831 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4056 place count 1830 transition count 2791
Iterating global reduction 6 with 1 rules applied. Total rules applied 4057 place count 1830 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 4058 place count 1829 transition count 2783
Iterating global reduction 6 with 1 rules applied. Total rules applied 4059 place count 1829 transition count 2783
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 6 ms
Ensure Unique test removed 3 places
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 6 with 627 rules applied. Total rules applied 4686 place count 1514 transition count 2471
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4690 place count 1510 transition count 2467
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4695 place count 1509 transition count 2467
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 4696 place count 1509 transition count 2466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4697 place count 1508 transition count 2466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4697 place count 1508 transition count 2465
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4699 place count 1507 transition count 2465
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4701 place count 1505 transition count 2463
Iterating global reduction 8 with 2 rules applied. Total rules applied 4703 place count 1505 transition count 2463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 4705 place count 1505 transition count 2461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4706 place count 1504 transition count 2461
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4708 place count 1503 transition count 2466
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4710 place count 1501 transition count 2464
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 30 rules applied. Total rules applied 4740 place count 1481 transition count 2454
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 4750 place count 1471 transition count 2454
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 30 Pre rules applied. Total rules applied 4750 place count 1471 transition count 2424
Deduced a syphon composed of 30 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 61 rules applied. Total rules applied 4811 place count 1440 transition count 2424
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 12 with 21 rules applied. Total rules applied 4832 place count 1419 transition count 2424
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 4832 place count 1419 transition count 2423
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4834 place count 1418 transition count 2423
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 62 rules applied. Total rules applied 4896 place count 1387 transition count 2392
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 4916 place count 1367 transition count 2372
Iterating global reduction 13 with 20 rules applied. Total rules applied 4936 place count 1367 transition count 2372
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 4946 place count 1357 transition count 2362
Iterating global reduction 13 with 10 rules applied. Total rules applied 4956 place count 1357 transition count 2362
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4966 place count 1357 transition count 2352
Applied a total of 4966 rules in 2002 ms. Remains 1357 /3935 variables (removed 2578) and now considering 2352/4778 (removed 2426) transitions.
// Phase 1: matrix 2352 rows 1357 cols
[2024-06-01 12:21:09] [INFO ] Computed 223 invariants in 36 ms
[2024-06-01 12:21:11] [INFO ] Implicit Places using invariants in 1938 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 169, 187, 207, 258, 259, 271, 272, 274, 291, 309, 329, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 759, 760, 762, 779, 797, 817, 868, 869, 881, 882, 884, 901, 919, 939, 958, 993, 994, 1006, 1007, 1009, 1026, 1044, 1064, 1115, 1116, 1128, 1129, 1131, 1148, 1166, 1186, 1237, 1238, 1241, 1252, 1253, 1254, 1272, 1293, 1294, 1295, 1296]
[2024-06-01 12:21:11] [INFO ] Actually due to overlaps returned [1272, 1254, 48, 169, 291, 413, 535, 657, 779, 901, 1026, 1148, 31, 147, 150, 271, 274, 393, 396, 515, 518, 637, 640, 759, 762, 881, 884, 1006, 1009, 1128, 1131, 1252, 1293, 148, 272, 394, 516, 638, 760, 882, 1007, 1129, 1253, 1294, 1, 18, 258, 259, 380, 381, 502, 503, 624, 625, 746, 747, 868, 869, 993, 994, 1115, 1116, 1237, 1238, 1295, 19, 66, 85, 137, 187, 207, 309, 329, 431, 451, 553, 573, 675, 695, 797, 817, 919, 939, 1044, 1064, 1166, 1186, 1241, 1296]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 1945 ms to find 89 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1268/3935 places, 2352/4778 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 1267 transition count 2191
Reduce places removed 161 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 162 rules applied. Total rules applied 324 place count 1106 transition count 2190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 325 place count 1105 transition count 2190
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 325 place count 1105 transition count 2143
Deduced a syphon composed of 47 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 420 place count 1057 transition count 2143
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 432 place count 1053 transition count 2135
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 440 place count 1045 transition count 2135
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 443 place count 1042 transition count 2132
Iterating global reduction 5 with 3 rules applied. Total rules applied 446 place count 1042 transition count 2132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 449 place count 1042 transition count 2129
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 5 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 601 place count 966 transition count 2053
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 605 place count 964 transition count 2054
Applied a total of 605 rules in 326 ms. Remains 964 /1268 variables (removed 304) and now considering 2054/2352 (removed 298) transitions.
// Phase 1: matrix 2054 rows 964 cols
[2024-06-01 12:21:11] [INFO ] Computed 128 invariants in 24 ms
[2024-06-01 12:21:12] [INFO ] Implicit Places using invariants in 1476 ms returned [88, 94, 99, 176, 182, 187, 264, 270, 275, 352, 358, 363, 440, 446, 451, 528, 534, 539, 616, 622, 627, 706, 712, 717, 794, 800, 805, 882, 888, 893, 961]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1483 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 933/3935 places, 2054/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 933 transition count 2053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 932 transition count 2053
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 912 transition count 2033
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 912 transition count 2033
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 892 transition count 2013
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 892 transition count 2013
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 882 transition count 2003
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 882 transition count 2003
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 122 place count 872 transition count 1993
Applied a total of 122 rules in 229 ms. Remains 872 /933 variables (removed 61) and now considering 1993/2054 (removed 61) transitions.
// Phase 1: matrix 1993 rows 872 cols
[2024-06-01 12:21:13] [INFO ] Computed 97 invariants in 34 ms
[2024-06-01 12:21:14] [INFO ] Implicit Places using invariants in 1315 ms returned []
[2024-06-01 12:21:14] [INFO ] Invariant cache hit.
[2024-06-01 12:21:18] [INFO ] Implicit Places using invariants and state equation in 4307 ms returned []
Implicit Place search using SMT with State Equation took 5627 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 872/3935 places, 1993/4778 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 11615 ms. Remains : 872/3935 places, 1993/4778 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-07
Product exploration explored 100000 steps with 1097 reset in 544 ms.
Product exploration explored 100000 steps with 1170 reset in 511 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 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (430 resets) in 292 ms. (136 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (55 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
[2024-06-01 12:21:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/174 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 484/658 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/719 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/719 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 153/872 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/872 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1993/2865 variables, 872/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2865 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2865 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2865/2865 variables, and 969 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1436 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/174 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 484/658 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/719 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/719 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 153/872 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/872 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2865/2865 variables, and 969 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1995 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3439ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 2 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 1993/1993 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 872 transition count 1991
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 870 transition count 1991
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 869 transition count 1990
Free-agglomeration rule applied 50 times.
Iterating global reduction 2 with 50 rules applied. Total rules applied 56 place count 869 transition count 1940
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 116 place count 819 transition count 1930
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 145 place count 819 transition count 1901
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 174 place count 790 transition count 1901
Applied a total of 174 rules in 297 ms. Remains 790 /872 variables (removed 82) and now considering 1901/1993 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 790/872 places, 1901/1993 transitions.
RANDOM walk for 40000 steps (658 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (86 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 191390 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 191390 steps, saw 51329 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 1901 rows 790 cols
[2024-06-01 12:21:27] [INFO ] Computed 97 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/128 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/139 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/549 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/604 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 186/790 variables, 33/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/790 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1901/2691 variables, 790/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2691 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2691 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2691/2691 variables, and 887 constraints, problems are : Problem set: 0 solved, 1 unsolved in 891 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/128 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/139 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/549 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/604 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 186/790 variables, 33/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/790 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1901/2691 variables, 790/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2691 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2691 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2691 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2691/2691 variables, and 888 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2364 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3298ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 175 ms.
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 62 ms. Remains 790 /790 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 790/790 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 63 ms. Remains 790 /790 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 12:21:30] [INFO ] Invariant cache hit.
[2024-06-01 12:21:32] [INFO ] Implicit Places using invariants in 1735 ms returned [88, 89, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517, 589, 590, 660, 661]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1738 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 772/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 69 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1870 ms. Remains : 772/790 places, 1901/1901 transitions.
RANDOM walk for 40000 steps (641 resets) in 336 ms. (118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (83 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 187257 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 187257 steps, saw 50058 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
// Phase 1: matrix 1901 rows 772 cols
[2024-06-01 12:21:35] [INFO ] Computed 79 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/172 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/185 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 403/621 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/644 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/644 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 128/772 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/772 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1901/2673 variables, 772/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2673 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2673 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2673/2673 variables, and 851 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1531 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 772/772 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/172 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/185 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 403/621 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/644 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/644 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 128/772 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:21:37] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/772 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/772 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1901/2673 variables, 772/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2673 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2673 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2673 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2673/2673 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2512 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 772/772 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 4071ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 177 ms.
Support contains 2 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1901/1901 transitions.
Applied a total of 0 rules in 66 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 772/772 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1901/1901 transitions.
Applied a total of 0 rules in 68 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 12:21:40] [INFO ] Invariant cache hit.
[2024-06-01 12:21:41] [INFO ] Implicit Places using invariants in 1338 ms returned []
[2024-06-01 12:21:41] [INFO ] Invariant cache hit.
[2024-06-01 12:21:45] [INFO ] Implicit Places using invariants and state equation in 3456 ms returned []
Implicit Place search using SMT with State Equation took 4796 ms to find 0 implicit places.
[2024-06-01 12:21:45] [INFO ] Redundant transitions in 70 ms returned []
Running 1852 sub problems to find dead transitions.
[2024-06-01 12:21:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/771 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1852 unsolved
SMT process timed out in 31888ms, After SMT, problems are : Problem set: 0 solved, 1852 unsolved
Search for dead transitions found 0 dead transitions in 31927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36876 ms. Remains : 772/772 places, 1901/1901 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 41 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 12:22:17] [INFO ] Invariant cache hit.
[2024-06-01 12:22:17] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:22:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-06-01 12:22:17] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 35 ms returned sat
[2024-06-01 12:22:18] [INFO ] After 1100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:22:18] [INFO ] After 1250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:22:18] [INFO ] After 1529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1738 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 1993/1993 transitions.
Applied a total of 0 rules in 74 ms. Remains 872 /872 variables (removed 0) and now considering 1993/1993 (removed 0) transitions.
// Phase 1: matrix 1993 rows 872 cols
[2024-06-01 12:22:19] [INFO ] Computed 97 invariants in 36 ms
[2024-06-01 12:22:20] [INFO ] Implicit Places using invariants in 1170 ms returned []
[2024-06-01 12:22:20] [INFO ] Invariant cache hit.
[2024-06-01 12:22:23] [INFO ] Implicit Places using invariants and state equation in 3366 ms returned []
Implicit Place search using SMT with State Equation took 4538 ms to find 0 implicit places.
[2024-06-01 12:22:23] [INFO ] Redundant transitions in 45 ms returned []
Running 1924 sub problems to find dead transitions.
[2024-06-01 12:22:23] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/861 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1924 unsolved
SMT process timed out in 31348ms, After SMT, problems are : Problem set: 0 solved, 1924 unsolved
Search for dead transitions found 0 dead transitions in 31371ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36037 ms. Remains : 872/872 places, 1993/1993 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (432 resets) in 317 ms. (125 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (55 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
[2024-06-01 12:22:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/174 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 484/658 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/719 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/719 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 153/872 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/872 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1993/2865 variables, 872/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2865 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2865 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2865/2865 variables, and 969 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1368 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/174 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 484/658 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/719 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/719 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 153/872 variables, 29/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/872 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2865/2865 variables, and 969 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2005 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 872/872 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3385ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 1993/1993 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 872 transition count 1991
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 870 transition count 1991
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 869 transition count 1990
Free-agglomeration rule applied 50 times.
Iterating global reduction 2 with 50 rules applied. Total rules applied 56 place count 869 transition count 1940
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 116 place count 819 transition count 1930
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 3 with 29 rules applied. Total rules applied 145 place count 819 transition count 1901
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 174 place count 790 transition count 1901
Applied a total of 174 rules in 185 ms. Remains 790 /872 variables (removed 82) and now considering 1901/1993 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 790/872 places, 1901/1993 transitions.
RANDOM walk for 40000 steps (658 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (84 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 170114 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 170114 steps, saw 44903 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 1901 rows 790 cols
[2024-06-01 12:23:02] [INFO ] Computed 97 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/128 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/139 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/549 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/604 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 186/790 variables, 33/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/790 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1901/2691 variables, 790/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2691 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2691 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2691/2691 variables, and 887 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 126/128 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/139 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/549 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/604 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 186/790 variables, 33/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/790 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1901/2691 variables, 790/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2691 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2691 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2691 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2691/2691 variables, and 888 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2131 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 82/82 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3207ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 238 ms.
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 77 ms. Remains 790 /790 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 790/790 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 76 ms. Remains 790 /790 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 12:23:06] [INFO ] Invariant cache hit.
[2024-06-01 12:23:07] [INFO ] Implicit Places using invariants in 1707 ms returned [88, 89, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517, 589, 590, 660, 661]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1711 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 772/790 places, 1901/1901 transitions.
Applied a total of 0 rules in 74 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1862 ms. Remains : 772/790 places, 1901/1901 transitions.
RANDOM walk for 40000 steps (661 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (81 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 190898 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 190898 steps, saw 51203 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 1901 rows 772 cols
[2024-06-01 12:23:11] [INFO ] Computed 79 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/172 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/185 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 403/621 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/644 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/644 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 128/772 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/772 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1901/2673 variables, 772/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2673 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2673 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2673/2673 variables, and 851 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1294 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 772/772 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 155/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/172 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/185 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/218 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 403/621 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/644 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/644 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 128/772 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:23:12] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/772 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/772 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1901/2673 variables, 772/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2673 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2673 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2673 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2673/2673 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2271 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 772/772 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 2 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1901/1901 transitions.
Applied a total of 0 rules in 39 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 772/772 places, 1901/1901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1901/1901 transitions.
Applied a total of 0 rules in 39 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
[2024-06-01 12:23:14] [INFO ] Invariant cache hit.
[2024-06-01 12:23:15] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2024-06-01 12:23:15] [INFO ] Invariant cache hit.
[2024-06-01 12:23:18] [INFO ] Implicit Places using invariants and state equation in 2414 ms returned []
Implicit Place search using SMT with State Equation took 3490 ms to find 0 implicit places.
[2024-06-01 12:23:18] [INFO ] Redundant transitions in 43 ms returned []
Running 1852 sub problems to find dead transitions.
[2024-06-01 12:23:18] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/771 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1852 unsolved
SMT process timed out in 31422ms, After SMT, problems are : Problem set: 0 solved, 1852 unsolved
Search for dead transitions found 0 dead transitions in 31444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35026 ms. Remains : 772/772 places, 1901/1901 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 40 ms. Remains 772 /772 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 12:23:49] [INFO ] Invariant cache hit.
[2024-06-01 12:23:49] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 12:23:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-06-01 12:23:50] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 50 ms returned sat
[2024-06-01 12:23:51] [INFO ] After 995ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 12:23:51] [INFO ] After 1130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 12:23:51] [INFO ] After 1452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1656 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1136 reset in 538 ms.
Product exploration explored 100000 steps with 1141 reset in 428 ms.
Support contains 4 out of 872 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 872/872 places, 1993/1993 transitions.
Applied a total of 0 rules in 44 ms. Remains 872 /872 variables (removed 0) and now considering 1993/1993 (removed 0) transitions.
// Phase 1: matrix 1993 rows 872 cols
[2024-06-01 12:23:52] [INFO ] Computed 97 invariants in 36 ms
[2024-06-01 12:23:53] [INFO ] Implicit Places using invariants in 888 ms returned []
[2024-06-01 12:23:53] [INFO ] Invariant cache hit.
[2024-06-01 12:23:57] [INFO ] Implicit Places using invariants and state equation in 3623 ms returned []
Implicit Place search using SMT with State Equation took 4516 ms to find 0 implicit places.
[2024-06-01 12:23:57] [INFO ] Redundant transitions in 48 ms returned []
Running 1924 sub problems to find dead transitions.
[2024-06-01 12:23:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/861 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1924 unsolved
SMT process timed out in 31368ms, After SMT, problems are : Problem set: 0 solved, 1924 unsolved
Search for dead transitions found 0 dead transitions in 31392ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36013 ms. Remains : 872/872 places, 1993/1993 transitions.
Treatment of property ASLink-PT-10b-LTLCardinality-07 finished in 202005 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 5 out of 3935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3931 transition count 4762
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3931 transition count 4762
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 3927 transition count 4751
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 3927 transition count 4751
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 3927 transition count 4750
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 3926 transition count 4749
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3925 transition count 4741
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3925 transition count 4741
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3924 transition count 4733
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3924 transition count 4733
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3923 transition count 4732
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3922 transition count 4724
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3922 transition count 4724
Applied a total of 27 rules in 4168 ms. Remains 3922 /3935 variables (removed 13) and now considering 4724/4778 (removed 54) transitions.
// Phase 1: matrix 4724 rows 3922 cols
[2024-06-01 12:24:33] [INFO ] Computed 422 invariants in 79 ms
[2024-06-01 12:24:36] [INFO ] Implicit Places using invariants in 3333 ms returned []
[2024-06-01 12:24:36] [INFO ] Invariant cache hit.
[2024-06-01 12:24:56] [INFO ] Implicit Places using invariants and state equation in 20298 ms returned []
Implicit Place search using SMT with State Equation took 23632 ms to find 0 implicit places.
Running 4723 sub problems to find dead transitions.
[2024-06-01 12:24:56] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3921 variables, 241/241 constraints. Problems are: Problem set: 0 solved, 4723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3921/8646 variables, and 241 constraints, problems are : Problem set: 0 solved, 4723 unsolved in 30139 ms.
Refiners :[Positive P Invariants (semi-flows): 0/99 constraints, Generalized P Invariants (flows): 241/323 constraints, State Equation: 0/3922 constraints, PredecessorRefiner: 4723/4723 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3921 variables, 241/241 constraints. Problems are: Problem set: 0 solved, 4723 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 3921/8646 variables, and 241 constraints, problems are : Problem set: 0 solved, 4723 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 0/99 constraints, Generalized P Invariants (flows): 241/323 constraints, State Equation: 0/3922 constraints, PredecessorRefiner: 0/4723 constraints, Known Traps: 0/0 constraints]
After SMT, in 63047ms problems are : Problem set: 0 solved, 4723 unsolved
Search for dead transitions found 0 dead transitions in 63103ms
Starting structural reductions in LTL mode, iteration 1 : 3922/3935 places, 4724/4778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90914 ms. Remains : 3922/3935 places, 4724/4778 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-08
Stuttering criterion allowed to conclude after 772 steps with 0 reset in 8 ms.
FORMULA ASLink-PT-10b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-08 finished in 91087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&G(p1))))'
Support contains 6 out of 3935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 735 transitions
Trivial Post-agglo rules discarded 735 transitions
Performed 735 trivial Post agglomeration. Transition count delta: 735
Iterating post reduction 0 with 735 rules applied. Total rules applied 735 place count 3934 transition count 4042
Reduce places removed 735 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 740 rules applied. Total rules applied 1475 place count 3199 transition count 4037
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 1480 place count 3196 transition count 4035
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1482 place count 3194 transition count 4035
Performed 1062 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1062 Pre rules applied. Total rules applied 1482 place count 3194 transition count 2973
Deduced a syphon composed of 1062 places in 15 ms
Ensure Unique test removed 103 places
Reduce places removed 1165 places and 0 transitions.
Iterating global reduction 4 with 2227 rules applied. Total rules applied 3709 place count 2029 transition count 2973
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 4 with 74 rules applied. Total rules applied 3783 place count 2019 transition count 2909
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 3847 place count 1955 transition count 2909
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 3847 place count 1955 transition count 2869
Deduced a syphon composed of 40 places in 14 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 3967 place count 1875 transition count 2869
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 39 Pre rules applied. Total rules applied 3967 place count 1875 transition count 2830
Deduced a syphon composed of 39 places in 13 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 4045 place count 1836 transition count 2830
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 4047 place count 1834 transition count 2823
Iterating global reduction 6 with 2 rules applied. Total rules applied 4049 place count 1834 transition count 2823
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4049 place count 1834 transition count 2822
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4051 place count 1833 transition count 2822
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 6 with 624 rules applied. Total rules applied 4675 place count 1520 transition count 2511
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4679 place count 1516 transition count 2507
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4684 place count 1515 transition count 2507
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 4685 place count 1515 transition count 2506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4686 place count 1514 transition count 2506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4686 place count 1514 transition count 2505
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4688 place count 1513 transition count 2505
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4690 place count 1511 transition count 2503
Iterating global reduction 8 with 2 rules applied. Total rules applied 4692 place count 1511 transition count 2503
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 4694 place count 1511 transition count 2501
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4695 place count 1510 transition count 2501
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4697 place count 1509 transition count 2506
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4699 place count 1507 transition count 2504
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 30 rules applied. Total rules applied 4729 place count 1487 transition count 2494
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 4739 place count 1477 transition count 2494
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 30 Pre rules applied. Total rules applied 4739 place count 1477 transition count 2464
Deduced a syphon composed of 30 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 61 rules applied. Total rules applied 4800 place count 1446 transition count 2464
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 12 with 21 rules applied. Total rules applied 4821 place count 1425 transition count 2464
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 4821 place count 1425 transition count 2463
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4823 place count 1424 transition count 2463
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 13 with 62 rules applied. Total rules applied 4885 place count 1393 transition count 2432
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 4905 place count 1373 transition count 2412
Iterating global reduction 13 with 20 rules applied. Total rules applied 4925 place count 1373 transition count 2412
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 4935 place count 1363 transition count 2402
Iterating global reduction 13 with 10 rules applied. Total rules applied 4945 place count 1363 transition count 2402
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 4955 place count 1363 transition count 2392
Applied a total of 4955 rules in 1495 ms. Remains 1363 /3935 variables (removed 2572) and now considering 2392/4778 (removed 2386) transitions.
// Phase 1: matrix 2392 rows 1363 cols
[2024-06-01 12:26:01] [INFO ] Computed 224 invariants in 59 ms
[2024-06-01 12:26:04] [INFO ] Implicit Places using invariants in 2782 ms returned [1, 18, 19, 31, 50, 68, 87, 139, 149, 150, 152, 169, 187, 207, 258, 259, 271, 272, 274, 291, 309, 329, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 759, 760, 762, 779, 797, 817, 868, 869, 881, 882, 884, 901, 919, 939, 990, 991, 1003, 1004, 1006, 1023, 1041, 1061, 1112, 1113, 1125, 1126, 1128, 1145, 1163, 1183, 1226, 1227, 1239, 1240, 1243, 1254, 1255, 1256, 1279, 1300, 1301, 1302, 1303]
[2024-06-01 12:26:04] [INFO ] Actually due to overlaps returned [1279, 1256, 50, 169, 291, 413, 535, 657, 779, 901, 1023, 1145, 31, 149, 152, 271, 274, 393, 396, 515, 518, 637, 640, 759, 762, 881, 884, 1003, 1006, 1125, 1128, 1254, 1300, 150, 272, 394, 516, 638, 760, 882, 1004, 1126, 1255, 1301, 1, 18, 258, 259, 380, 381, 502, 503, 624, 625, 746, 747, 868, 869, 990, 991, 1112, 1113, 1239, 1240, 1302, 19, 68, 87, 139, 187, 207, 309, 329, 431, 451, 553, 573, 675, 695, 797, 817, 919, 939, 1041, 1061, 1163, 1183, 1243, 1303]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 2787 ms to find 89 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1274/3935 places, 2392/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 1274 transition count 2230
Reduce places removed 162 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 163 rules applied. Total rules applied 325 place count 1112 transition count 2229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 326 place count 1111 transition count 2229
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 326 place count 1111 transition count 2182
Deduced a syphon composed of 47 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 421 place count 1063 transition count 2182
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 11 rules applied. Total rules applied 432 place count 1059 transition count 2175
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 439 place count 1052 transition count 2175
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 442 place count 1049 transition count 2172
Iterating global reduction 5 with 3 rules applied. Total rules applied 445 place count 1049 transition count 2172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 447 place count 1049 transition count 2170
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 8 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 599 place count 973 transition count 2094
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 603 place count 971 transition count 2095
Applied a total of 603 rules in 373 ms. Remains 971 /1274 variables (removed 303) and now considering 2095/2392 (removed 297) transitions.
// Phase 1: matrix 2095 rows 971 cols
[2024-06-01 12:26:04] [INFO ] Computed 130 invariants in 38 ms
[2024-06-01 12:26:06] [INFO ] Implicit Places using invariants in 1937 ms returned [90, 96, 101, 176, 182, 187, 264, 270, 275, 352, 358, 363, 440, 446, 451, 528, 534, 539, 616, 622, 627, 704, 710, 715, 792, 798, 803, 880, 889, 890, 896, 968]
[2024-06-01 12:26:06] [INFO ] Actually due to overlaps returned [90, 96, 101, 176, 182, 187, 264, 270, 275, 352, 358, 363, 440, 446, 451, 528, 534, 539, 616, 622, 627, 704, 710, 715, 792, 798, 803, 880, 889, 896, 968]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1940 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 940/3935 places, 2095/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 940 transition count 2094
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 939 transition count 2094
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 21 place count 920 transition count 2075
Iterating global reduction 2 with 19 rules applied. Total rules applied 40 place count 920 transition count 2075
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 59 place count 901 transition count 2056
Iterating global reduction 2 with 19 rules applied. Total rules applied 78 place count 901 transition count 2056
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 892 transition count 2047
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 892 transition count 2047
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 116 place count 882 transition count 2037
Applied a total of 116 rules in 419 ms. Remains 882 /940 variables (removed 58) and now considering 2037/2095 (removed 58) transitions.
// Phase 1: matrix 2037 rows 882 cols
[2024-06-01 12:26:07] [INFO ] Computed 99 invariants in 35 ms
[2024-06-01 12:26:08] [INFO ] Implicit Places using invariants in 1715 ms returned [806]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1717 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 881/3935 places, 2037/4778 transitions.
Applied a total of 0 rules in 73 ms. Remains 881 /881 variables (removed 0) and now considering 2037/2037 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 8804 ms. Remains : 881/3935 places, 2037/4778 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-10
Product exploration explored 100000 steps with 1061 reset in 810 ms.
Product exploration explored 100000 steps with 1066 reset in 435 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (424 resets) in 541 ms. (73 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (53 resets) in 620 ms. (64 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (53 resets) in 868 ms. (46 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (55 resets) in 335 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (52 resets) in 353 ms. (113 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (53 resets) in 678 ms. (58 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 133098 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 5
Probabilistic random walk after 133098 steps, saw 32771 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 2037 rows 881 cols
[2024-06-01 12:26:14] [INFO ] Computed 98 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 187/279 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 15/294 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 308/602 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 11/613 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 245/858 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/858 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/860 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/860 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 21/881 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/881 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2037/2918 variables, 881/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2918 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/2918 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2918/2918 variables, and 979 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2670 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 881/881 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 187/279 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 15/294 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 308/602 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 11/613 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 245/858 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/858 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/860 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/860 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 21/881 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/881 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2037/2918 variables, 881/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2918 variables, 5/984 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2918/2918 variables, and 984 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 881/881 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 7732ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 881/881 places, 2037/2037 transitions.
Free-agglomeration rule applied 50 times.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 881 transition count 1987
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 110 place count 831 transition count 1977
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 831 transition count 1976
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 1 with 29 rules applied. Total rules applied 140 place count 831 transition count 1947
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 169 place count 802 transition count 1947
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 802 transition count 1947
Applied a total of 170 rules in 328 ms. Remains 802 /881 variables (removed 79) and now considering 1947/2037 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 802/881 places, 1947/2037 transitions.
RANDOM walk for 40000 steps (627 resets) in 1484 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (82 resets) in 369 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (78 resets) in 237 ms. (168 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (82 resets) in 332 ms. (120 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (82 resets) in 314 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (76 resets) in 297 ms. (134 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 108227 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 5
Probabilistic random walk after 108227 steps, saw 24709 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 1947 rows 802 cols
[2024-06-01 12:26:27] [INFO ] Computed 98 invariants in 121 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 80/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 166/252 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 10/262 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 264/526 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 6/532 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 231/763 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/763 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/764 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 38/802 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/802 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1947/2749 variables, 802/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2749 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/2749 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2749/2749 variables, and 900 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2923 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 80/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:26:30] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 166/252 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 10/262 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 264/526 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/532 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 231/763 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/763 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/764 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/764 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 38/802 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/802 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1947/2749 variables, 802/901 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2749 variables, 5/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2749 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/2749 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2749/2749 variables, and 906 constraints, problems are : Problem set: 0 solved, 5 unsolved in 35797 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 38866ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 8627 ms.
Support contains 6 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 40 ms. Remains 802 /802 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 802/802 places, 1947/1947 transitions.
RANDOM walk for 40000 steps (644 resets) in 984 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (74 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (81 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 165810 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 2
Probabilistic random walk after 165810 steps, saw 36663 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2024-06-01 12:27:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 166/252 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/262 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 264/526 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/532 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 231/763 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/763 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/764 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 38/802 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/802 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1947/2749 variables, 802/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2749 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2749 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2749/2749 variables, and 900 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1872 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:27:19] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 166/252 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/262 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 264/526 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/532 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 231/763 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/763 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/764 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/764 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 38/802 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/802 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1947/2749 variables, 802/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2749 variables, 2/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2749 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2749 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2749/2749 variables, and 903 constraints, problems are : Problem set: 0 solved, 2 unsolved in 12620 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 14509ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2261 ms.
Support contains 6 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 67 ms. Remains 802 /802 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 802/802 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 67 ms. Remains 802 /802 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2024-06-01 12:27:34] [INFO ] Invariant cache hit.
[2024-06-01 12:27:36] [INFO ] Implicit Places using invariants in 1564 ms returned [90, 91, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517, 587, 588, 658, 659]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1570 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 784/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 153 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1790 ms. Remains : 784/802 places, 1947/1947 transitions.
RANDOM walk for 40000 steps (621 resets) in 841 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (77 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (79 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 145586 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 145586 steps, saw 32522 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 1947 rows 784 cols
[2024-06-01 12:27:40] [INFO ] Computed 80 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 190/274 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/286 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 260/546 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/552 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 209/761 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/761 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/762 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/762 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/784 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/784 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1947/2731 variables, 784/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2731 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2731 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2731/2731 variables, and 864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 784/784 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:27:41] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 5/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 190/274 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 12:27:41] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/286 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 260/546 variables, 22/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/546 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/552 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 209/761 variables, 23/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/761 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/762 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/762 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 22/784 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/784 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1947/2731 variables, 784/866 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2731 variables, 2/868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2731 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2731 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2731/2731 variables, and 868 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11011 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 784/784 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 12338ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2101 ms.
Support contains 6 out of 784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1947/1947 transitions.
Applied a total of 0 rules in 65 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 784/784 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1947/1947 transitions.
Applied a total of 0 rules in 64 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2024-06-01 12:27:54] [INFO ] Invariant cache hit.
[2024-06-01 12:27:56] [INFO ] Implicit Places using invariants in 1470 ms returned []
[2024-06-01 12:27:56] [INFO ] Invariant cache hit.
[2024-06-01 12:27:59] [INFO ] Implicit Places using invariants and state equation in 3086 ms returned []
Implicit Place search using SMT with State Equation took 4562 ms to find 0 implicit places.
[2024-06-01 12:27:59] [INFO ] Redundant transitions in 66 ms returned []
Running 1898 sub problems to find dead transitions.
[2024-06-01 12:27:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/783 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1898 unsolved
SMT process timed out in 31673ms, After SMT, problems are : Problem set: 0 solved, 1898 unsolved
Search for dead transitions found 0 dead transitions in 31711ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36416 ms. Remains : 784/784 places, 1947/1947 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 200 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
// Phase 1: matrix 2037 rows 881 cols
[2024-06-01 12:28:31] [INFO ] Computed 98 invariants in 36 ms
[2024-06-01 12:28:34] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-06-01 12:28:34] [INFO ] [Real]Absence check using 15 positive and 83 generalized place invariants in 175 ms returned sat
[2024-06-01 12:28:41] [INFO ] [Real]Absence check using state equation in 7378 ms returned sat
[2024-06-01 12:28:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:28:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2024-06-01 12:28:44] [INFO ] [Nat]Absence check using 15 positive and 83 generalized place invariants in 158 ms returned sat
[2024-06-01 12:28:50] [INFO ] [Nat]Absence check using state equation in 5926 ms returned unknown
Could not prove EG (NOT p0)
Support contains 6 out of 881 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 881/881 places, 2037/2037 transitions.
Applied a total of 0 rules in 46 ms. Remains 881 /881 variables (removed 0) and now considering 2037/2037 (removed 0) transitions.
[2024-06-01 12:28:50] [INFO ] Invariant cache hit.
[2024-06-01 12:28:51] [INFO ] Implicit Places using invariants in 1512 ms returned []
[2024-06-01 12:28:51] [INFO ] Invariant cache hit.
[2024-06-01 12:28:55] [INFO ] Implicit Places using invariants and state equation in 3516 ms returned []
Implicit Place search using SMT with State Equation took 5030 ms to find 0 implicit places.
[2024-06-01 12:28:55] [INFO ] Redundant transitions in 47 ms returned []
Running 1967 sub problems to find dead transitions.
[2024-06-01 12:28:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/870 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1967 unsolved
SMT process timed out in 31528ms, After SMT, problems are : Problem set: 0 solved, 1967 unsolved
Search for dead transitions found 0 dead transitions in 31561ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36692 ms. Remains : 881/881 places, 2037/2037 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 p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 193 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (430 resets) in 2390 ms. (16 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (53 resets) in 311 ms. (128 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (54 resets) in 489 ms. (81 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (58 resets) in 395 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (54 resets) in 458 ms. (87 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (53 resets) in 364 ms. (109 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 121188 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 5
Probabilistic random walk after 121188 steps, saw 28936 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 12:29:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 187/279 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 15/294 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 308/602 variables, 33/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 11/613 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 245/858 variables, 31/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/858 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/860 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/860 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 21/881 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/881 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2037/2918 variables, 881/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2918 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/2918 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2918/2918 variables, and 979 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2822 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 881/881 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:29:34] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 187/279 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 15/294 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 308/602 variables, 33/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 11/613 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/613 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 245/858 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/858 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/860 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/860 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 21/881 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/881 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2037/2918 variables, 881/980 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2918 variables, 5/985 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2918/2918 variables, and 985 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 881/881 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 7846ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 881 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 881/881 places, 2037/2037 transitions.
Free-agglomeration rule applied 50 times.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 881 transition count 1987
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 110 place count 831 transition count 1977
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 831 transition count 1976
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 1 with 29 rules applied. Total rules applied 140 place count 831 transition count 1947
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 169 place count 802 transition count 1947
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 170 place count 802 transition count 1947
Applied a total of 170 rules in 362 ms. Remains 802 /881 variables (removed 79) and now considering 1947/2037 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 802/881 places, 1947/2037 transitions.
RANDOM walk for 40000 steps (620 resets) in 1078 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (83 resets) in 394 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (81 resets) in 341 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (79 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (82 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (77 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 140277 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 5
Probabilistic random walk after 140277 steps, saw 31608 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
// Phase 1: matrix 1947 rows 802 cols
[2024-06-01 12:29:43] [INFO ] Computed 98 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 80/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 166/252 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 10/262 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 264/526 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 6/532 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 231/763 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/763 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/764 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/764 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 38/802 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/802 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1947/2749 variables, 802/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2749 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/2749 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2749/2749 variables, and 900 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2602 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 80/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:29:46] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 166/252 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 10/262 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 264/526 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/532 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 231/763 variables, 31/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/763 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/764 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/764 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 38/802 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/802 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1947/2749 variables, 802/901 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2749 variables, 5/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2749 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/2749 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2749/2749 variables, and 906 constraints, problems are : Problem set: 0 solved, 5 unsolved in 21842 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 83/83 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 24493ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 25041 ms.
Support contains 6 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 40 ms. Remains 802 /802 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 802/802 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 41 ms. Remains 802 /802 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2024-06-01 12:30:33] [INFO ] Invariant cache hit.
[2024-06-01 12:30:34] [INFO ] Implicit Places using invariants in 1460 ms returned [90, 91, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517, 587, 588, 658, 659]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1464 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 784/802 places, 1947/1947 transitions.
Applied a total of 0 rules in 59 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1565 ms. Remains : 784/802 places, 1947/1947 transitions.
RANDOM walk for 40000 steps (600 resets) in 1597 ms. (25 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (81 resets) in 277 ms. (143 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (73 resets) in 296 ms. (134 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (81 resets) in 275 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (86 resets) in 261 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (79 resets) in 292 ms. (136 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 154994 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 5
Probabilistic random walk after 154994 steps, saw 33958 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 1947 rows 784 cols
[2024-06-01 12:30:39] [INFO ] Computed 80 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 190/274 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 12/286 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 260/546 variables, 22/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 6/552 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 209/761 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/761 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/762 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/762 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 22/784 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/784 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1947/2731 variables, 784/864 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2731 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/2731 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2731/2731 variables, and 864 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2343 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 784/784 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 190/274 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 12:30:41] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/286 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 260/546 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/552 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 209/761 variables, 23/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/761 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/762 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/762 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 22/784 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/784 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 1947/2731 variables, 784/865 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2731 variables, 5/870 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2731 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/2731 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2731/2731 variables, and 870 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41006 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 784/784 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 43391ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15545 ms.
Support contains 6 out of 784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1947/1947 transitions.
Applied a total of 0 rules in 72 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 784/784 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1947/1947 transitions.
Applied a total of 0 rules in 64 ms. Remains 784 /784 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2024-06-01 12:31:38] [INFO ] Invariant cache hit.
[2024-06-01 12:31:39] [INFO ] Implicit Places using invariants in 1603 ms returned []
[2024-06-01 12:31:39] [INFO ] Invariant cache hit.
[2024-06-01 12:31:42] [INFO ] Implicit Places using invariants and state equation in 3095 ms returned []
Implicit Place search using SMT with State Equation took 4706 ms to find 0 implicit places.
[2024-06-01 12:31:42] [INFO ] Redundant transitions in 45 ms returned []
Running 1898 sub problems to find dead transitions.
[2024-06-01 12:31:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/783 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1898 unsolved
SMT process timed out in 31461ms, After SMT, problems are : Problem set: 0 solved, 1898 unsolved
Search for dead transitions found 0 dead transitions in 31485ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36313 ms. Remains : 784/784 places, 1947/1947 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 185 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
// Phase 1: matrix 2037 rows 881 cols
[2024-06-01 12:32:14] [INFO ] Computed 98 invariants in 36 ms
[2024-06-01 12:32:17] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2024-06-01 12:32:17] [INFO ] [Real]Absence check using 15 positive and 83 generalized place invariants in 230 ms returned sat
[2024-06-01 12:32:24] [INFO ] [Real]Absence check using state equation in 6896 ms returned sat
[2024-06-01 12:32:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 12:32:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-06-01 12:32:27] [INFO ] [Nat]Absence check using 15 positive and 83 generalized place invariants in 121 ms returned sat
[2024-06-01 12:32:33] [INFO ] [Nat]Absence check using state equation in 6171 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1092 reset in 547 ms.
Product exploration explored 100000 steps with 1043 reset in 532 ms.
Support contains 6 out of 881 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 881/881 places, 2037/2037 transitions.
Applied a total of 0 rules in 42 ms. Remains 881 /881 variables (removed 0) and now considering 2037/2037 (removed 0) transitions.
[2024-06-01 12:32:34] [INFO ] Invariant cache hit.
[2024-06-01 12:32:35] [INFO ] Implicit Places using invariants in 1386 ms returned []
[2024-06-01 12:32:35] [INFO ] Invariant cache hit.
[2024-06-01 12:32:40] [INFO ] Implicit Places using invariants and state equation in 4730 ms returned []
Implicit Place search using SMT with State Equation took 6126 ms to find 0 implicit places.
[2024-06-01 12:32:40] [INFO ] Redundant transitions in 73 ms returned []
Running 1967 sub problems to find dead transitions.
[2024-06-01 12:32:40] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/870 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1967 unsolved
SMT process timed out in 31606ms, After SMT, problems are : Problem set: 0 solved, 1967 unsolved
Search for dead transitions found 0 dead transitions in 31646ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37904 ms. Remains : 881/881 places, 2037/2037 transitions.
Treatment of property ASLink-PT-10b-LTLCardinality-10 finished in 432501 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((X(p1)||p0))))'
Support contains 4 out of 3935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3930 transition count 4761
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3930 transition count 4761
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 3926 transition count 4750
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 3926 transition count 4750
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3925 transition count 4748
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3924 transition count 4740
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3923 transition count 4732
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3922 transition count 4731
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3921 transition count 4723
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3921 transition count 4723
Applied a total of 29 rules in 4722 ms. Remains 3921 /3935 variables (removed 14) and now considering 4723/4778 (removed 55) transitions.
// Phase 1: matrix 4723 rows 3921 cols
[2024-06-01 12:33:17] [INFO ] Computed 422 invariants in 124 ms
[2024-06-01 12:33:20] [INFO ] Implicit Places using invariants in 3315 ms returned []
[2024-06-01 12:33:20] [INFO ] Invariant cache hit.
[2024-06-01 12:33:48] [INFO ] Implicit Places using invariants and state equation in 27538 ms returned []
Implicit Place search using SMT with State Equation took 30855 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2024-06-01 12:33:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 239/239 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 239 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, Generalized P Invariants (flows): 239/321 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 239/239 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 13)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 4)
(s29 1)
(s30 1)
(s31 1)
(s32 0)
(s33 1)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 1)
(s43 0)
(s44 0)
(s45 1)
(s46 1)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 3)
(s54 6)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 42)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 1)
(s150 1)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 16)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 10)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 0)
(s325 0)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 2)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 0)
(s355 1)
(s356 1)
(s357 1)
(s358 0)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 0)
(s368 1)
(s369 4)
(s370 1)
(s371 0)
(s372 0)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 23)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 37)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 37)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 34)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 4)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 0)
(s457 0)
(s458 1)
(s459 1)
(s460 0)
(s461 0)
(s462 1)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 1)
(s468 0)
(s469 0)
(s470 1)
(s471 1)
(s472 0)
(s473 0)
(s474 1)
(s475 1)
(s476 0)
(s477 0)
(s478 1)
(s479 1)
(s480 0)
(s481 0)
(s482 1)
(s483 1)
(s484 0)
(s485 0)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 0)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 1)
(s497 0)
(s498 1)
(s499 1)
(s500 0)
(s501 0)
(s502 1)
(s503 0)
(s504 0)
(s505 1)
(s506 1)
(s507 0)
(s508 1)
(s509 1)
(s510 0)
(s511 1)
(s512 1)
(s513 0)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 16)
(s642 1)
(s643 1)
(s644 0)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 0)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 10)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 0)
(s684 1)
(s685 1)
(s686 1)
(s687 0)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 7)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 0)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 0)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 4)
(s726 0)
(s727 0)
(s728 1)
(s729 1)
(s730 1)
(s731 0)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 33)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 33)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 30)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 4)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 28)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 0)
(s816 1)
(s817 1)
(s818 1)
(s819 0)
(s820 0)
(s821 1)
(s822 1)
(s823 0)
(s824 0)
(s825 1)
(s826 1)
(s827 1)
(s828 0)
(s829 1)
(s830 1)
(s831 0)
(s832 1)
(s833 1)
(s834 6)
(s835 0)
(s836 0)
(s837 1)
(s838 1)
(s839 0)
(s840 0)
(s841 1)
(s842 1)
(s843 0)
(s844 0)
(s845 5)
(s846 1)
(s847 1)
(s848 1)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 1)
(s865 1)
(s866 0)
(s867 0)
(s868 1)
(s869 0)
(s870 5)
(s871 0)
(s872 0)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 7)
(s897 0)
(s898 0)
(s899 1)
(s900 0)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 0)
(s974 0)
(s975 1)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 1)
(s981 0)
(s982 0)
(s983 1)
(s984 0)
(s985 0)
(s986 1)
(s987 0)
(s988 1)
(s989 1)
(s990 0)
(s991 1)
(s992 0)
(s993 0)
(s994 1)
(s995 1)
(s996 0)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 0)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 0)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 0)
(s1016 0)
(s1017 1)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 0)
(s1029 0)
(s1030 1)
(s1031 1)
(s1032 0)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 0)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 0)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 0)
(s1052 1)
(s1053 1)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 0)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 0)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 0)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 4)
(s1085 0)
(s1086 0)
(s1087 1)
(s1088 1)
(s1089 0)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 7)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 29)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 29)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 26)
(s1125 1)
(s1126 1)
(s1127 0)
(s1128 0)
(s1129 1)
(s1130 1)
(s1131 0)
(s1132 1)
(s1133 4)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 77)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 0)
(s1175 0)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 0)
(s1180 1)
(s1181 1)
(s1182 0)
(s1183 0)
(s1184 1)
(s1185 1)
(s1186 0)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 0)
(s1191 0)
(s1192 1)
(s1193 1)
(s1194 0)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 5)
(s1199 0)
(s1200 1)
(s1201 1)
(s1202 0)
(s1203 0)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 0)
(s1210 1)
(s1211 1)
(s1212 0)
(s1213 0)
(s1214 1)
(s1215 0)
(s1216 0)
(s1217 1)
(s1218 1)
(s1219 0)
(s1220 1)
(s1221 0)
(s1222 0)
(s1223 1)
(s1224 1)
(s1225 0)
(s1226 1)
(s1227 1)
(s1228 0)
(s1229 1)
(s1230 1)
(s1231 0)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 23)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 2)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 0)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 0)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 10)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 0)
(s1402 1)
(s1403 1)
(s1404 0)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 7)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 0)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 0)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 0)
(s1446 4)
(s1447 1)
(s1448 0)
(s1449 0)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 25)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 25)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 22)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 4)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 89)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 0)
(s1539 1)
(s1540 1)
(s1541 0)
(s1542 0)
(s1543 1)
(s1544 6)
(s1545 0)
(s1546 0)
(s1547 1)
(s1548 1)
(s1549 0)
(s1550 0)
(s1551 1)
(s1552 1)
(s1553 0)
(s1554 0)
(s1555 1)
(s1556 1)
(s1557 0)
(s1558 0)
(s1559 1)
(s1560 1)
(s1561 0)
(s1562 0)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 0)
(s1569 0)
(s1570 1)
(s1571 0)
(s1572 0)
(s1573 1)
(s1574 1)
(s1575 0)
(s1576 1)
(s1577 1)
(s1578 0)
(s1579 1)
(s1580 0)
(s1581 0)
(s1582 1)
(s1583 1)
(s1584 0)
(s1585 1)
(s1586 1)
(s1587 0)
(s1588 1)
(s1589 1)
(s1590 0)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 23)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 16)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 0)
(s1724 1)
(s1725 0)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 2)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 0)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 0)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 7)
(s1789 1)
(s1790 0)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 0)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 4)
(s1803 1)
(s1804 0)
(s1805 1)
(s1806 1)
(s1807 0)
(s1808 0)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 21)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 21)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 18)
(s1843 1)
(s1844 1)
(s1845 1)
(s1846 1)
(s1847 1)
(s1848 1)
(s1849 1)
(s1850 1)
(s1851 4)
(s1852 1)
(s1853 1)
(s1854 1)
(s1855 1)
(s1856 1)
(s1857 1)
(s1858 1)
(s1859 1)
(s1860 1)
(s1861 89)
(s1862 1)
(s1863 1)
(s1864 1)
(s1865 1)
(s1866 1)
(s1867 1)
(s1868 1)
(s1869 1)
(s1870 1)
(s1871 1)
(s1872 1)
(s1873 1)
(s1874 1)
(s1875 1)
(s1876 1)
(s1877 1)
(s1878 1)
(s1879 1)
(s1880 1)
(s1881 1)
(s1882 1)
(s1883 1)
(s1884 1)
(s1885 1)
(s1886 1)
(s1887 1)
(s1888 1)
(s1889 1)
(s1890 1)
(s1891 1)
(s1892 0)
(s1893 0)
(s1894 1)
(s1895 1)
(s1896 1)
(s1897 0)
(s1898 1)
(s1899 1)
(s1900 0)
(s1901 0)
(s1902 1)
(s1903 1)
(s1904 0)
(s1905 0)
(s1906 1)
(s1907 1)
(s1908 0)
(s1909 0)
(s1910 1)
(s1911 1)
(s1912 0)
(s1913 0)
(s1914 1)
(s1915 1)
(s1916 1)
(s1917 0)
(s1918 1)
(s1919 1)
(s1920 6)
(s1921 0)
(s1922 1)
(s1923 1)
(s1924 1)
(s1925 1)
(s1926 1)
(s1927 1)
(s1928 0)
(s1929 1)
(s1930 0)
(s1931 0)
(s1932 1)
(s1933 1)
(s1934 0)
(s1935 1)
(s1936 0)
(s1937 1)
(s1938 1)
(s1939 0)
(s1940 0)
(s1941 1)
(s1942 0)
(s1943 0)
(s1944 1)
(s1945 1)
(s1946 0)
(s1947 1)
(s1948 1)
(s1949 0)
(s1950 1)
(s1951 1)
(s1952 1)
(s1953 1)
(s1954 1)
(s1955 1)
(s1956 1)
(s1957 1)
(s1958 1)
(s1959 1)
(s1960 1)
(s1961 1)
(s1962 1)
(s1963 1)
(s1964 1)
(s1965 1)
(s1966 1)
(s1967 1)
(s1968 1)
(s1969 1)
(s1970 1)
(s1971 1)
(s1972 1)
(s1973 1)
(s1974 1)
(s1975 1)
(s1976 1)
(s1977 1)
(s1978 1)
(s1979 1)
(s1980 1)
(s1981 1)
(s1982 1)
(s1983 1)
(s1984 1)
(s1985 1)
(s1986 1)
(s1987 1)
(s1988 1)
(s1989 1)
(s1990 1)
(s1991 1)
(s1992 1)
(s1993 1)
(s1994 1)
(s1995 1)
(s1996 1)
(s1997 1)
(s1998 1)
(s1999 1)
(s2000 1)
(s2001 1)
(s2002 1)
(s2003 1)
(s2004 1)
(s2005 1)
(s2006 1)
(s2007 1)
(s2008 1)
(s2009 1)
(s2010 1)
(s2011 1)
(s2012 1)
(s2013 1)
(s2014 1)
(s2015 1)
(s2016 1)
(s2017 1)
(s2018 1)
(s2019 1)
(s2020 1)
(s2021 1)
(s2022 1)
(s2023 1)
(s2024 1)
(s2025 1)
(s2026 1)
(s2027 1)
(s2028 1)
(s2029 1)
(s2030 1)
(s2031 1)
(s2032 1)
(s2033 1)
(s2034 1)
(s2035 1)
(s2036 1)
(s2037 1)
(s2038 1)
(s2039 1)
(s2040 1)
(s2041 1)
(s2042 1)
(s2043 1)
(s2044 1)
(s2045 1)
(s2046 1)
(s2047 1)
(s2048 1)
(s2049 1)
(s2050 1)
(s2051 1)
(s2052 1)
(s2053 1)
(s2054 1)
(s2055 1)
(s2056 1)
(s2057 1)
(s2058 1)
(s2059 1)
(s2060 1)
(s2061 1)
(s2062 1)
(s2063 1)
(s2064 1)
(s2065 1)
(s2066 1)
(s2067 1)
(s2068 1)
(s2069 1)
(s2070 1)
(s2071 1)
(s2072 1)
(s2073 1)
(s2074 1)
(s2075 16)
(s2076 1)
(s2077 1)
(s2078 1)
(s2079 1)
(s2080 1)
(s2081 1)
(s2082 0)
(s2083 1)
(s2084 1)
(s2085 1)
(s2086 0)
(s2087 1)
(s2088 1)
(s2089 1)
(s2090 1)
(s2091 1)
(s2092 1)
(s2093 1)
(s2094 1)
(s2095 1)
(s2096 1)
(s2097 1)
(s2098 1)
(s2099 1)
(s2100 1)
(s2101 1)
(s2102 1)
(s2103 1)
(s2104 1)
(s2105 1)
(s2106 1)
(s2107 1)
(s2108 1)
(s2109 1)
(s2110 10)
(s2111 1)
(s2112 1)
(s2113 1)
(s2114 1)
(s2115 1)
(s2116 1)
(s2117 1)
(s2118 1)
(s2119 0)
(s2120 1)
(s2121 1)
(s2122 0)
(s2123 1)
(s2124 1)
(s2125 1)
(s2126 1)
(s2127 1)
(s2128 1)
(s2129 1)
(s2130 1)
(s2131 1)
(s2132 1)
(s2133 1)
(s2134 1)
(s2135 2)
(s2136 1)
(s2137 1)
(s2138 1)
(s2139 1)
(s2140 1)
(s2141 1)
(s2142 1)
(s2143 1)
(s2144 1)
(s2145 1)
(s2146 1)
(s2147 1)
(s2148 1)
(s2149 1)
(s2150 1)
(s2151 1)
(s2152 0)
(s2153 1)
(s2154 1)
(s2155 1)
(s2156 0)
(s2157 1)
(s2158 1)
(s2159 1)
(s2160 1)
(s2161 1)
(s2162 1)
(s2163 0)
(s2164 4)
(s2165 1)
(s2166 0)
(s2167 0)
(s2168 1)
(s2169 1)
(s2170 1)
(s2171 1)
(s2172 1)
(s2173 1)
(s2174 1)
(s2175 1)
(s2176 1)
(s2177 1)
(s2178 1)
(s2179 1)
(s2180 1)
(s2181 23)
(s2182 1)
(s2183 1)
(s2184 1)
(s2185 1)
(s2186 1)
(s2187 1)
(s2188 1)
(s2189 1)
(s2190 17)
(s2191 1)
(s2192 1)
(s2193 1)
(s2194 1)
(s2195 1)
(s2196 17)
(s2197 1)
(s2198 1)
(s2199 1)
(s2200 1)
(s2201 14)
(s2202 1)
(s2203 1)
(s2204 1)
(s2205 1)
(s2206 1)
(s2207 1)
(s2208 1)
(s2209 4)
(s2210 1)
(s2211 1)
(s2212 1)
(s2213 1)
(s2214 1)
(s2215 1)
(s2216 1)
(s2217 1)
(s2218 1)
(s2219 1)
(s2220 89)
(s2221 1)
(s2222 1)
(s2223 1)
(s2224 1)
(s2225 1)
(s2226 1)
(s2227 1)
(s2228 1)
(s2229 1)
(s2230 1)
(s2231 1)
(s2232 1)
(s2233 1)
(s2234 1)
(s2235 1)
(s2236 1)
(s2237 1)
(s2238 1)
(s2239 1)
(s2240 1)
(s2241 1)
(s2242 1)
(s2243 1)
(s2244 1)
(s2245 1)
(s2246 1)
(s2247 1)
(s2248 1)
(s2249 1)
(s2250 1)
(s2251 0)
(s2252 0)
(s2253 1)
(s2254 1)
(s2255 0)
(s2256 0)
(s2257 1)
(s2258 1)
(s2259 0)
(s2260 1)
(s2261 1)
(s2262 1)
(s2263 0)
(s2264 0)
(s2265 0)
(s2266 1)
(s2267 1)
(s2268 0)
(s2269 1)
(s2270 1)
(s2271 1)
(s2272 0)
(s2273 1)
(s2274 1)
(s2275 0)
(s2276 0)
(s2277 1)
(s2278 6)
(s2279 0)
(s2280 0)
(s2281 1)
(s2282 1)
(s2283 1)
(s2284 1)
(s2285 0)
(s2286 0)
(s2287 0)
(s2288 0)
(s2289 1)
(s2290 0)
(s2291 0)
(s2292 0)
(s2293 1)
(s2294 0)
(s2295 0)
(s2296 0)
(s2297 0)
(s2298 0)
(s2299 0)
(s2300 0)
(s2301 1)
(s2302 0)
(s2303 0)
(s2304 1)
(s2305 0)
(s2306 0)
(s2307 1)
(s2308 0)
(s2309 0)
(s2310 1)
(s2311 1)
(s2312 1)
(s2313 1)
(s2314 1)
(s2315 1)
(s2316 1)
(s2317 1)
(s2318 1)
(s2319 1)
(s2320 1)
(s2321 1)
(s2322 1)
(s2323 1)
(s2324 1)
(s2325 1)
(s2326 1)
(s2327 1)
(s2328 1)
(s2329 1)
(s2330 1)
(s2331 1)
(s2332 1)
(s2333 1)
(s2334 1)
(s2335 1)
(s2336 1)
(s2337 1)
(s2338 1)
(s2339 1)
(s2340 1)
(s2341 1)
(s2342 1)
(s2343 1)
(s2344 1)
(s2345 1)
(s2346 1)
(s2347 1)
(s2348 1)
(s2349 1)
(s2350 1)
(s2351 1)
(s2352 1)
(s2353 1)
(s2354 1)
(s2355 1)
(s2356 1)
(s2357 1)
(s2358 1)
(s2359 1)
(s2360 1)
(s2361 1)
(s2362 1)
(s2363 1)
(s2364 1)
(s2365 1)
(s2366 1)
(s2367 1)
(s2368 1)
(s2369 1)
(s2370 1)
(s2371 1)
(s2372 1)
(s2373 1)
(s2374 1)
(s2375 1)
(s2376 1)
(s2377 1)
(s2378 1)
(s2379 1)
(s2380 1)
(s2381 1)
(s2382 0)
(s2383 1)
(s2384 1)
(s2385 1)
(s2386 1)
(s2387 1)
(s2388 1)
(s2389 1)
(s2390 1)
(s2391 7)
(s2392 1)
(s2393 1)
(s2394 1)
(s2395 1)
(s2396 1)
(s2397 1)
(s2398 1)
(s2399 1)
(s2400 1)
(s2401 1)
(s2402 1)
(s2403 1)
(s2404 1)
(s2405 1)
(s2406 1)
(s2407 1)
(s2408 1)
(s2409 0)
(s2410 0)
(s2411 1)
(s2412 0)
(s2413 0)
(s2414 0)
(s2415 0)
(s2416 1)
(s2417 0)
(s2418 1)
(s2419 0)
(s2420 0)
(s2421 1)
(s2422 0)
(s2423 0)
(s2424 1)
(s2425 1)
(s2426 0)
(s2427 1)
(s2428 0)
(s2429 0)
(s2430 1)
(s2431 1)
(s2432 0)
(s2433 1)
(s2434 1)
(s2435 1)
(s2436 1)
(s2437 1)
(s2438 1)
(s2439 1)
(s2440 1)
(s2441 1)
(s2442 0)
(s2443 1)
(s2444 1)
(s2445 1)
(s2446 0)
(s2447 1)
(s2448 1)
(s2449 1)
(s2450 1)
(s2451 0)
(s2452 0)
(s2453 1)
(s2454 3)
(s2455 0)
(s2456 0)
(s2457 0)
(s2458 1)
(s2459 0)
(s2460 1)
(s2461 1)
(s2462 1)
(s2463 1)
(s2464 0)
(s2465 0)
(s2466 0)
(s2467 0)
(s2468 0)
(s2469 1)
(s2470 1)
(s2471 1)
(s2472 1)
(s2473 1)
(s2474 1)
(s2475 0)
(s2476 1)
(s2477 1)
(s2478 1)
(s2479 0)
(s2480 1)
(s2481 1)
(s2482 1)
(s2483 1)
(s2484 1)
(s2485 1)
(s2486 1)
(s2487 0)
(s2488 1)
(s2489 1)
(s2490 1)
(s2491 0)
(s2492 2)
(s2493 1)
(s2494 1)
(s2495 0)
(s2496 1)
(s2497 0)
(s2498 0)
(s2499 1)
(s2500 0)
(s2501 0)
(s2502 1)
(s2503 1)
(s2504 1)
(s2505 1)
(s2506 1)
(s2507 1)
(s2508 1)
(s2509 1)
(s2510 1)
(s2511 0)
(s2512 0)
(s2513 1)
(s2514 1)
(s2515 1)
(s2516 1)
(s2517 1)
(s2518 1)
(s2519 1)
(s2520 4)
(s2521 0)
(s2522 1)
(s2523 1)
(s2524 1)
(s2525 0)
(s2526 0)
(s2527 1)
(s2528 1)
(s2529 1)
(s2530 1)
(s2531 1)
(s2532 1)
(s2533 1)
(s2534 1)
(s2535 1)
(s2536 1)
(s2537 1)
(s2538 1)
(s2539 1)
(s2540 23)
(s2541 1)
(s2542 1)
(s2543 1)
(s2544 1)
(s2545 1)
(s2546 1)
(s2547 1)
(s2548 13)
(s2549 1)
(s2550 1)
(s2551 1)
(s2552 1)
(s2553 1)
(s2554 13)
(s2555 1)
(s2556 1)
(s2557 1)
(s2558 1)
(s2559 1)
(s2560 1)
(s2561 10)
(s2562 1)
(s2563 1)
(s2564 1)
(s2565 1)
(s2566 1)
(s2567 1)
(s2568 1)
(s2569 1)
(s2570 1)
(s2571 1)
(s2572 1)
(s2573 1)
(s2574 1)
(s2575 1)
(s2576 1)
(s2577 1)
(s2578 1)
(s2579 93)
(s2580 1)
(s2581 1)
(s2582 1)
(s2583 1)
(s2584 1)
(s2585 1)
(s2586 1)
(s2587 1)
(s2588 1)
(s2589 1)
(s2590 1)
(s2591 1)
(s2592 1)
(s2593 1)
(s2594 1)
(s2595 1)
(s2596 1)
(s2597 1)
(s2598 1)
(s2599 1)
(s2600 1)
(s2601 1)
(s2602 1)
(s2603 1)
(s2604 1)
(s2605 1)
(s2606 1)
(s2607 1)
(s2608 1)
(s2609 1)
(s2610 1)
(s2611 6)
(s2612 1)
(s2613 1)
(s2614 0)
(s2615 0)
(s2616 1)
(s2617 1)
(s2618 1)
(s2619 0)
(s2620 1)
(s2621 1)
(s2622 0)
(s2623 0)
(s2624 1)
(s2625 1)
(s2626 0)
(s2627 0)
(s2628 1)
(s2629 1)
(s2630 0)
(s2631 0)
(s2632 1)
(s2633 1)
(s2634 0)
(s2635 0)
(s2636 1)
(s2637 1)
(s2638 0)
(s2639 0)
(s2640 1)
(s2641 1)
(s2642 1)
(s2643 1)
(s2644 1)
(s2645 0)
(s2646 0)
(s2647 1)
(s2648 1)
(s2649 0)
(s2650 1)
(s2651 1)
(s2652 0)
(s2653 1)
(s2654 0)
(s2655 0)
(s2656 1)
(s2657 0)
(s2658 0)
(s2659 1)
(s2660 1)
(s2661 0)
(s2662 1)
(s2663 1)
(s2664 0)
(s2665 1)
(s2666 1)
(s2667 0)
(s2668 1)
(s2669 1)
(s2670 1)
(s2671 1)
(s2672 1)
(s2673 1)
(s2674 1)
(s2675 1)
(s2676 1)
(s2677 1)
(s2678 1)
(s2679 1)
(s2680 1)
(s2681 1)
(s2682 1)
(s2683 1)
(s2684 1)
(s2685 1)
(s2686 1)
(s2687 1)
(s2688 1)
(s2689 1)
(s2690 1)
(s2691 1)
(s2692 1)
(s2693 1)
(s2694 1)
(s2695 1)
(s2696 1)
(s2697 1)
(s2698 1)
(s2699 1)
(s2700 1)
(s2701 1)
(s2702 1)
(s2703 1)
(s2704 1)
(s2705 1)
(s2706 1)
(s2707 1)
(s2708 1)
(s2709 1)
(s2710 1)
(s2711 1)
(s2712 1)
(s2713 1)
(s2714 1)
(s2715 23)
(s2716 1)
(s2717 1)
(s2718 1)
(s2719 1)
(s2720 1)
(s2721 1)
(s2722 1)
(s2723 1)
(s2724 1)
(s2725 1)
(s2726 1)
(s2727 1)
(s2728 1)
(s2729 1)
(s2730 1)
(s2731 1)
(s2732 1)
(s2733 1)
(s2734 1)
(s2735 1)
(s2736 1)
(s2737 1)
(s2738 1)
(s2739 1)
(s2740 1)
(s2741 1)
(s2742 1)
(s2743 1)
(s2744 1)
(s2745 1)
(s2746 1)
(s2747 1)
(s2748 1)
(s2749 1)
(s2750 1)
(s2751 1)
(s2752 1)
(s2753 1)
(s2754 1)
(s2755 1)
(s2756 1)
(s2757 1)
(s2758 1)
(s2759 1)
(s2760 1)
(s2761 1)
(s2762 1)
(s2763 1)
(s2764 1)
(s2765 1)
(s2766 1)
(s2767 1)
(s2768 1)
(s2769 1)
(s2770 1)
(s2771 1)
(s2772 1)
(s2773 1)
(s2774 1)
(s2775 1)
(s2776 1)
(s2777 1)
(s2778 1)
(s2779 1)
(s2780 1)
(s2781 1)
(s2782 2)
(s2783 1)
(s2784 1)
(s2785 1)
(s2786 1)
(s2787 1)
(s2788 1)
(s2789 1)
(s2790 1)
(s2791 1)
(s2792 1)
(s2793 1)
(s2794 1)
(s2795 1)
(s2796 1)
(s2797 1)
(s2798 1)
(s2799 1)
(s2800 1)
(s2801 0)
(s2802 1)
(s2803 1)
(s2804 1)
(s2805 0)
(s2806 1)
(s2807 1)
(s2808 1)
(s2809 1)
(s2810 1)
(s2811 1)
(s2812 1)
(s2813 1)
(s2814 1)
(s2815 1)
(s2816 1)
(s2817 1)
(s2818 1)
(s2819 1)
(s2820 1)
(s2821 1)
(s2822 1)
(s2823 1)
(s2824 1)
(s2825 1)
(s2826 1)
(s2827 1)
(s2828 1)
(s2829 1)
(s2830 1)
(s2831 1)
(s2832 10)
(s2833 1)
(s2834 1)
(s2835 1)
(s2836 1)
(s2837 0)
(s2838 1)
(s2839 1)
(s2840 0)
(s2841 1)
(s2842 1)
(s2843 1)
(s2844 1)
(s2845 1)
(s2846 1)
(s2847 1)
(s2848 1)
(s2849 1)
(s2850 1)
(s2851 1)
(s2852 1)
(s2853 1)
(s2854 1)
(s2855 1)
(s2856 1)
(s2857 1)
(s2858 1)
(s2859 1)
(s2860 1)
(s2861 1)
(s2862 7)
(s2863 1)
(s2864 1)
(s2865 1)
(s2866 1)
(s2867 1)
(s2868 1)
(s2869 1)
(s2870 0)
(s2871 1)
(s2872 1)
(s2873 1)
(s2874 0)
(s2875 1)
(s2876 1)
(s2877 1)
(s2878 1)
(s2879 1)
(s2880 0)
(s2881 1)
(s2882 4)
(s2883 1)
(s2884 0)
(s2885 0)
(s2886 1)
(s2887 1)
(s2888 1)
(s2889 1)
(s2890 1)
(s2891 1)
(s2892 1)
(s2893 1)
(s2894 1)
(s2895 1)
(s2896 1)
(s2897 1)
(s2898 1)
(s2899 1)
(s2900 1)
(s2901 1)
(s2902 1)
(s2903 1)
(s2904 1)
(s2905 1)
(s2906 1)
(s2907 9)timeout

(s2908 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 239 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30143 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, Generalized P Invariants (flows): 239/321 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints]
After SMT, in 62976ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 63035ms
Starting structural reductions in LTL mode, iteration 1 : 3921/3935 places, 4723/4778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98624 ms. Remains : 3921/3935 places, 4723/4778 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 1324 ms.
Product exploration explored 100000 steps with 50000 reset in 1002 ms.
Computed a total of 161 stabilizing places and 161 stable transitions
Computed a total of 161 stabilizing places and 161 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-10b-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-10b-LTLCardinality-11 finished in 101236 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((X(p0)&&(p1||F(p2))))))'
Support contains 4 out of 3935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3930 transition count 4761
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3930 transition count 4761
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 3926 transition count 4750
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 3926 transition count 4750
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3925 transition count 4748
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3924 transition count 4740
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3923 transition count 4732
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3922 transition count 4731
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3921 transition count 4723
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3921 transition count 4723
Applied a total of 29 rules in 4022 ms. Remains 3921 /3935 variables (removed 14) and now considering 4723/4778 (removed 55) transitions.
[2024-06-01 12:34:57] [INFO ] Invariant cache hit.
[2024-06-01 12:35:01] [INFO ] Implicit Places using invariants in 3282 ms returned []
[2024-06-01 12:35:01] [INFO ] Invariant cache hit.
[2024-06-01 12:35:28] [INFO ] Implicit Places using invariants and state equation in 27124 ms returned []
Implicit Place search using SMT with State Equation took 30413 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2024-06-01 12:35:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 239/239 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 239 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30151 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, Generalized P Invariants (flows): 239/321 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 239/239 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 13)
(s16 1)
(s17 1)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 4)
(s29 1)
(s30 1)
(s31 1)
(s32 0)
(s33 1)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 1)
(s43 0)
(s44 0)
(s45 1)
(s46 1)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 3)
(s54 6)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 42)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 1)
(s150 1)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 16)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 10)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 0)
(s325 0)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 2)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 0)
(s355 1)
(s356 1)
(s357 1)
(s358 0)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 0)
(s368 1)
(s369 4)
(s370 1)
(s371 0)
(s372 0)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 23)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 37)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 37)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 34)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 4)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 0)
(s457 0)
(s458 1)
(s459 1)
(s460 0)
(s461 0)
(s462 1)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 1)
(s468 0)
(s469 0)
(s470 1)
(s471 1)
(s472 0)
(s473 0)
(s474 1)
(s475 1)
(s476 0)
(s477 0)
(s478 1)
(s479 1)
(s480 0)
(s481 0)
(s482 1)
(s483 1)
(s484 0)
(s485 0)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 0)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 1)
(s497 0)
(s498 1)
(s499 1)
(s500 0)
(s501 0)
(s502 1)
(s503 0)
(s504 0)
(s505 1)
(s506 1)
(s507 0)
(s508 1)
(s509 1)
(s510 0)
(s511 1)
(s512 1)
(s513 0)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 16)
(s642 1)
(s643 1)
(s644 0)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 0)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 10)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 0)
(s684 1)
(s685 1)
(s686 1)
(s687 0)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 7)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 0)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 0)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 4)
(s726 0)
(s727 0)
(s728 1)
(s729 1)
(s730 1)
(s731 0)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 33)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 33)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 30)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 4)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 28)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 0)
(s816 1)
(s817 1)
(s818 1)
(s819 0)
(s820 0)
(s821 1)
(s822 1)
(s823 0)
(s824 0)
(s825 1)
(s826 1)
(s827 1)
(s828 0)
(s829 1)
(s830 1)
(s831 0)
(s832 1)
(s833 1)
(s834 6)
(s835 0)
(s836 0)
(s837 1)
(s838 1)
(s839 0)
(s840 0)
(s841 1)
(s842 1)
(s843 0)
(s844 0)
(s845 5)
(s846 1)
(s847 1)
(s848 1)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 1)
(s865 1)
(s866 0)
(s867 0)
(s868 1)
(s869 0)
(s870 5)
(s871 0)
(s872 0)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 7)
(s897 0)
(s898 0)
(s899 1)
(s900 0)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 0)
(s974 0)
(s975 1)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 1)
(s981 0)
(s982 0)
(s983 1)
(s984 0)
(s985 0)
(s986 1)
(s987 0)
(s988 1)
(s989 1)
(s990 0)
(s991 1)
(s992 0)
(s993 0)
(s994 1)
(s995 1)
(s996 0)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 0)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 0)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 0)
(s1016 0)
(s1017 1)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 0)
(s1029 0)
(s1030 1)
(s1031 1)
(s1032 0)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 0)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 0)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 0)
(s1052 1)
(s1053 1)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 0)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 0)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 0)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 4)
(s1085 0)
(s1086 0)
(s1087 1)
(s1088 1)
(s1089 0)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 7)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 29)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 29)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 26)
(s1125 1)
(s1126 1)
(s1127 0)
(s1128 0)
(s1129 1)
(s1130 1)
(s1131 0)
(s1132 1)
(s1133 4)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 77)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 0)
(s1175 0)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 0)
(s1180 1)
(s1181 1)
(s1182 0)
(s1183 0)
(s1184 1)
(s1185 1)
(s1186 0)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 0)
(s1191 0)
(s1192 1)
(s1193 1)
(s1194 0)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 5)
(s1199 0)
(s1200 1)
(s1201 1)
(s1202 0)
(s1203 0)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 0)
(s1210 1)
(s1211 1)
(s1212 0)
(s1213 0)
(s1214 1)
(s1215 0)
(s1216 0)
(s1217 1)
(s1218 1)
(s1219 0)
(s1220 1)
(s1221 0)
(s1222 0)
(s1223 1)
(s1224 1)
(s1225 0)
(s1226 1)
(s1227 1)
(s1228 0)
(s1229 1)
(s1230 1)
(s1231 0)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 23)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 2)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 0)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 0)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 10)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 0)
(s1402 1)
(s1403 1)
(s1404 0)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 7)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 0)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 0)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 0)
(s1446 4)
(s1447 1)
(s1448 0)
(s1449 0)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 25)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 25)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 22)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 4)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 89)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 0)
(s1539 1)
(s1540 1)
(s1541 0)
(s1542 0)
(s1543 1)
(s1544 6)
(s1545 0)
(s1546 0)
(s1547 1)
(s1548 1)
(s1549 0)
(s1550 0)
(s1551 1)
(s1552 1)
(s1553 0)
(s1554 0)
(s1555 1)
(s1556 1)
(s1557 0)
(s1558 0)
(s1559 1)
(s1560 1)
(s1561 0)
(s1562 0)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 0)
(s1569 0)
(s1570 1)
(s1571 0)
(s1572 0)
(s1573 1)
(s1574 1)
(s1575 0)
(s1576 1)
(s1577 1)
(s1578 0)
(s1579 1)
(s1580 0)
(s1581 0)
(s1582 1)
(s1583 1)
(s1584 0)
(s1585 1)
(s1586 1)
(s1587 0)
(s1588 1)
(s1589 1)
(s1590 0)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 23)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 16)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 0)
(s1724 1)
(s1725 0)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 2)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 0)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 0)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 7)
(s1789 1)
(s1790 0)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 0)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 4)
(s1803 1)
(s1804 0)
(s1805 1)
(s1806 1)
(s1807 0)
(s1808 0)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 21)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 21)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 18)
(s1843 1)
(s1844 1)
(s1845 1)
(s1846 1)
(s1847 1)
(s1848 1)
(s1849 1)
(s1850 1)
(s1851 4)
(s1852 1)
(s1853 1)
(s1854 1)
(s1855 1)
(s1856 1)
(s1857 1)
(s1858 1)
(s1859 1)
(s1860 1)
(s1861 89)
(s1862 1)
(s1863 1)
(s1864 1)
(s1865 1)
(s1866 1)
(s1867 1)
(s1868 1)
(s1869 1)
(s1870 1)
(s1871 1)
(s1872 1)
(s1873 1)
(s1874 1)
(s1875 1)
(s1876 1)
(s1877 1)
(s1878 1)
(s1879 1)
(s1880 1)
(s1881 1)
(s1882 1)
(s1883 1)
(s1884 1)
(s1885 1)
(s1886 1)
(s1887 1)
(s1888 1)
(s1889 1)
(s1890 1)
(s1891 1)
(s1892 0)
(s1893 0)
(s1894 1)
(s1895 1)
(s1896 1)
(s1897 0)
(s1898 1)
(s1899 1)
(s1900 0)
(s1901 0)
(s1902 1)
(s1903 1)
(s1904 0)
(s1905 0)
(s1906 1)
(s1907 1)
(s1908 0)
(s1909 0)
(s1910 1)
(s1911 1)
(s1912 0)
(s1913 0)
(s1914 1)
(s1915 1)
(s1916 1)
(s1917 0)
(s1918 1)
(s1919 1)
(s1920 6)
(s1921 0)
(s1922 1)
(s1923 1)
(s1924 1)
(s1925 1)
(s1926 1)
(s1927 1)
(s1928 0)
(s1929 1)
(s1930 0)
(s1931 0)
(s1932 1)
(s1933 1)
(s1934 0)
(s1935 1)
(s1936 0)
(s1937 1)
(s1938 1)
(s1939 0)
(s1940 0)
(s1941 1)
(s1942 0)
(s1943 0)
(s1944 1)
(s1945 1)
(s1946 0)
(s1947 1)
(s1948 1)
(s1949 0)
(s1950 1)
(s1951 1)
(s1952 1)
(s1953 1)
(s1954 1)
(s1955 1)
(s1956 1)
(s1957 1)
(s1958 1)
(s1959 1)
(s1960 1)
(s1961 1)
(s1962 1)
(s1963 1)
(s1964 1)
(s1965 1)
(s1966 1)
(s1967 1)
(s1968 1)
(s1969 1)
(s1970 1)
(s1971 1)
(s1972 1)
(s1973 1)
(s1974 1)
(s1975 1)
(s1976 1)
(s1977 1)
(s1978 1)
(s1979 1)
(s1980 1)
(s1981 1)
(s1982 1)
(s1983 1)
(s1984 1)
(s1985 1)
(s1986 1)
(s1987 1)
(s1988 1)
(s1989 1)
(s1990 1)
(s1991 1)
(s1992 1)
(s1993 1)
(s1994 1)
(s1995 1)
(s1996 1)
(s1997 1)
(s1998 1)
(s1999 1)
(s2000 1)
(s2001 1)
(s2002 1)
(s2003 1)
(s2004 1)
(s2005 1)
(s2006 1)
(s2007 1)
(s2008 1)
(s2009 1)
(s2010 1)
(s2011 1)
(s2012 1)
(s2013 1)
(s2014 1)
(s2015 1)
(s2016 1)
(s2017 1)
(s2018 1)
(s2019 1)
(s2020 1)
(s2021 1)
(s2022 1)
(s2023 1)
(s2024 1)
(s2025 1)
(s2026 1)
(s2027 1)
(s2028 1)
(s2029 1)
(s2030 1)
(s2031 1)
(s2032 1)
(s2033 1)
(s2034 1)
(s2035 1)
(s2036 1)
(s2037 1)
(s2038 1)
(s2039 1)
(s2040 1)
(s2041 1)
(s2042 1)
(s2043 1)
(s2044 1)
(s2045 1)
(s2046 1)
(s2047 1)
(s2048 1)
(s2049 1)
(s2050 1)
(s2051 1)
(s2052 1)
(s2053 1)
(s2054 1)
(s2055 1)
(s2056 1)
(s2057 1)
(s2058 1)
(s2059 1)
(s2060 1)
(s2061 1)
(s2062 1)
(s2063 1)
(s2064 1)
(s2065 1)
(s2066 1)
(s2067 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3920/8644 variables, and 239 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30140 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, Generalized P Invariants (flows): 239/321 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints]
After SMT, in 63256ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 63315ms
Starting structural reductions in LTL mode, iteration 1 : 3921/3935 places, 4723/4778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97761 ms. Remains : 3921/3935 places, 4723/4778 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-10b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-12 finished in 98070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 737 transitions
Trivial Post-agglo rules discarded 737 transitions
Performed 737 trivial Post agglomeration. Transition count delta: 737
Iterating post reduction 0 with 737 rules applied. Total rules applied 737 place count 3934 transition count 4040
Reduce places removed 737 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 742 rules applied. Total rules applied 1479 place count 3197 transition count 4035
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1482 place count 3194 transition count 4035
Performed 1064 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1064 Pre rules applied. Total rules applied 1482 place count 3194 transition count 2971
Deduced a syphon composed of 1064 places in 18 ms
Ensure Unique test removed 104 places
Reduce places removed 1168 places and 0 transitions.
Iterating global reduction 3 with 2232 rules applied. Total rules applied 3714 place count 2026 transition count 2971
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 3 with 74 rules applied. Total rules applied 3788 place count 2016 transition count 2907
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 3852 place count 1952 transition count 2907
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3852 place count 1952 transition count 2866
Deduced a syphon composed of 41 places in 16 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3975 place count 1870 transition count 2866
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3975 place count 1870 transition count 2826
Deduced a syphon composed of 40 places in 16 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4055 place count 1830 transition count 2826
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 4058 place count 1827 transition count 2811
Iterating global reduction 5 with 3 rules applied. Total rules applied 4061 place count 1827 transition count 2811
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4061 place count 1827 transition count 2810
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4063 place count 1826 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4064 place count 1825 transition count 2802
Iterating global reduction 5 with 1 rules applied. Total rules applied 4065 place count 1825 transition count 2802
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4066 place count 1824 transition count 2794
Iterating global reduction 5 with 1 rules applied. Total rules applied 4067 place count 1824 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4068 place count 1823 transition count 2786
Iterating global reduction 5 with 1 rules applied. Total rules applied 4069 place count 1823 transition count 2786
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4070 place count 1822 transition count 2778
Iterating global reduction 5 with 1 rules applied. Total rules applied 4071 place count 1822 transition count 2778
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 8 ms
Ensure Unique test removed 2 places
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 5 with 624 rules applied. Total rules applied 4695 place count 1509 transition count 2467
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4699 place count 1505 transition count 2463
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4704 place count 1504 transition count 2463
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4705 place count 1504 transition count 2462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4706 place count 1503 transition count 2462
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4706 place count 1503 transition count 2461
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4708 place count 1502 transition count 2461
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4710 place count 1500 transition count 2459
Iterating global reduction 7 with 2 rules applied. Total rules applied 4712 place count 1500 transition count 2459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 4714 place count 1500 transition count 2457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4715 place count 1499 transition count 2457
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4717 place count 1498 transition count 2462
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4719 place count 1496 transition count 2460
Reduce places removed 20 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 9 with 30 rules applied. Total rules applied 4749 place count 1476 transition count 2450
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 4759 place count 1466 transition count 2450
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 30 Pre rules applied. Total rules applied 4759 place count 1466 transition count 2420
Deduced a syphon composed of 30 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 61 rules applied. Total rules applied 4820 place count 1435 transition count 2420
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 11 with 21 rules applied. Total rules applied 4841 place count 1414 transition count 2420
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4841 place count 1414 transition count 2419
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4843 place count 1413 transition count 2419
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 7 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 12 with 62 rules applied. Total rules applied 4905 place count 1382 transition count 2388
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 4925 place count 1362 transition count 2368
Iterating global reduction 12 with 20 rules applied. Total rules applied 4945 place count 1362 transition count 2368
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 4955 place count 1352 transition count 2358
Iterating global reduction 12 with 10 rules applied. Total rules applied 4965 place count 1352 transition count 2358
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4975 place count 1352 transition count 2348
Applied a total of 4975 rules in 2052 ms. Remains 1352 /3935 variables (removed 2583) and now considering 2348/4778 (removed 2430) transitions.
// Phase 1: matrix 2348 rows 1352 cols
[2024-06-01 12:36:34] [INFO ] Computed 222 invariants in 35 ms
[2024-06-01 12:36:36] [INFO ] Implicit Places using invariants in 2338 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 291, 309, 329, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 759, 760, 762, 779, 797, 817, 868, 869, 881, 882, 884, 901, 919, 939, 990, 991, 1003, 1004, 1006, 1023, 1041, 1061, 1112, 1113, 1125, 1126, 1128, 1145, 1163, 1183, 1234, 1235, 1238, 1249, 1250, 1251, 1269, 1290, 1291, 1292, 1293]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 2343 ms to find 89 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1263/3935 places, 2348/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 1263 transition count 2185
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 326 place count 1100 transition count 2185
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 326 place count 1100 transition count 2138
Deduced a syphon composed of 47 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 95 rules applied. Total rules applied 421 place count 1052 transition count 2138
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 433 place count 1048 transition count 2130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 441 place count 1040 transition count 2130
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 444 place count 1037 transition count 2127
Iterating global reduction 4 with 3 rules applied. Total rules applied 447 place count 1037 transition count 2127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 450 place count 1037 transition count 2124
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 8 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 602 place count 961 transition count 2048
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 606 place count 959 transition count 2049
Applied a total of 606 rules in 378 ms. Remains 959 /1263 variables (removed 304) and now considering 2049/2348 (removed 299) transitions.
// Phase 1: matrix 2049 rows 959 cols
[2024-06-01 12:36:36] [INFO ] Computed 128 invariants in 37 ms
[2024-06-01 12:36:38] [INFO ] Implicit Places using invariants in 1915 ms returned [88, 94, 99, 174, 180, 185, 264, 270, 275, 352, 358, 363, 440, 446, 451, 528, 534, 539, 616, 622, 627, 704, 710, 715, 792, 798, 803, 880, 886, 891, 956]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1919 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 928/3935 places, 2049/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 928 transition count 2048
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 927 transition count 2048
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 907 transition count 2028
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 907 transition count 2028
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 887 transition count 2008
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 887 transition count 2008
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 877 transition count 1998
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 877 transition count 1998
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 8 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 122 place count 867 transition count 1988
Applied a total of 122 rules in 353 ms. Remains 867 /928 variables (removed 61) and now considering 1988/2049 (removed 61) transitions.
// Phase 1: matrix 1988 rows 867 cols
[2024-06-01 12:36:39] [INFO ] Computed 97 invariants in 34 ms
[2024-06-01 12:36:40] [INFO ] Implicit Places using invariants in 1657 ms returned []
[2024-06-01 12:36:40] [INFO ] Invariant cache hit.
[2024-06-01 12:36:45] [INFO ] Implicit Places using invariants and state equation in 4682 ms returned []
Implicit Place search using SMT with State Equation took 6341 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 867/3935 places, 1988/4778 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 13392 ms. Remains : 867/3935 places, 1988/4778 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-13
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-13 finished in 13467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 3935 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 737 transitions
Trivial Post-agglo rules discarded 737 transitions
Performed 737 trivial Post agglomeration. Transition count delta: 737
Iterating post reduction 0 with 737 rules applied. Total rules applied 737 place count 3934 transition count 4040
Reduce places removed 737 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 742 rules applied. Total rules applied 1479 place count 3197 transition count 4035
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1482 place count 3194 transition count 4035
Performed 1064 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1064 Pre rules applied. Total rules applied 1482 place count 3194 transition count 2971
Deduced a syphon composed of 1064 places in 15 ms
Ensure Unique test removed 103 places
Reduce places removed 1167 places and 0 transitions.
Iterating global reduction 3 with 2231 rules applied. Total rules applied 3713 place count 2027 transition count 2971
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 3 with 74 rules applied. Total rules applied 3787 place count 2016 transition count 2908
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 3850 place count 1953 transition count 2908
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 3850 place count 1953 transition count 2867
Deduced a syphon composed of 41 places in 15 ms
Ensure Unique test removed 41 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 123 rules applied. Total rules applied 3973 place count 1871 transition count 2867
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 3973 place count 1871 transition count 2827
Deduced a syphon composed of 40 places in 14 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 4053 place count 1831 transition count 2827
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 4056 place count 1828 transition count 2812
Iterating global reduction 5 with 3 rules applied. Total rules applied 4059 place count 1828 transition count 2812
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4059 place count 1828 transition count 2811
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4061 place count 1827 transition count 2811
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4062 place count 1826 transition count 2803
Iterating global reduction 5 with 1 rules applied. Total rules applied 4063 place count 1826 transition count 2803
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4064 place count 1825 transition count 2795
Iterating global reduction 5 with 1 rules applied. Total rules applied 4065 place count 1825 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4066 place count 1824 transition count 2787
Iterating global reduction 5 with 1 rules applied. Total rules applied 4067 place count 1824 transition count 2787
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 4068 place count 1823 transition count 2779
Iterating global reduction 5 with 1 rules applied. Total rules applied 4069 place count 1823 transition count 2779
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 6 ms
Ensure Unique test removed 2 places
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 5 with 624 rules applied. Total rules applied 4693 place count 1510 transition count 2468
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4697 place count 1506 transition count 2464
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4702 place count 1505 transition count 2464
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4703 place count 1505 transition count 2463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4704 place count 1504 transition count 2463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4704 place count 1504 transition count 2462
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4706 place count 1503 transition count 2462
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4708 place count 1501 transition count 2460
Iterating global reduction 7 with 2 rules applied. Total rules applied 4710 place count 1501 transition count 2460
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 4712 place count 1501 transition count 2458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4713 place count 1500 transition count 2458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4715 place count 1499 transition count 2463
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4717 place count 1497 transition count 2461
Reduce places removed 19 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 28 rules applied. Total rules applied 4745 place count 1478 transition count 2452
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4754 place count 1469 transition count 2452
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 29 Pre rules applied. Total rules applied 4754 place count 1469 transition count 2423
Deduced a syphon composed of 29 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 11 with 59 rules applied. Total rules applied 4813 place count 1439 transition count 2423
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 11 with 20 rules applied. Total rules applied 4833 place count 1419 transition count 2423
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4833 place count 1419 transition count 2422
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4835 place count 1418 transition count 2422
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 6 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 4895 place count 1388 transition count 2392
Discarding 19 places :
Symmetric choice reduction at 12 with 19 rule applications. Total rules 4914 place count 1369 transition count 2373
Iterating global reduction 12 with 19 rules applied. Total rules applied 4933 place count 1369 transition count 2373
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 4943 place count 1359 transition count 2363
Iterating global reduction 12 with 10 rules applied. Total rules applied 4953 place count 1359 transition count 2363
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4963 place count 1359 transition count 2353
Applied a total of 4963 rules in 1936 ms. Remains 1359 /3935 variables (removed 2576) and now considering 2353/4778 (removed 2425) transitions.
// Phase 1: matrix 2353 rows 1359 cols
[2024-06-01 12:36:47] [INFO ] Computed 224 invariants in 36 ms
[2024-06-01 12:36:49] [INFO ] Implicit Places using invariants in 2532 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 622, 623, 635, 636, 638, 655, 673, 693, 744, 745, 757, 758, 760, 777, 795, 818, 873, 874, 886, 887, 888, 890, 907, 925, 945, 996, 997, 1009, 1010, 1012, 1029, 1047, 1067, 1119, 1120, 1132, 1133, 1135, 1152, 1170, 1190, 1241, 1242, 1245, 1256, 1257, 1258, 1276, 1297, 1298, 1299, 1300]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 2536 ms to find 90 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1269/3935 places, 2353/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 164 place count 1269 transition count 2189
Reduce places removed 164 places and 0 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 328 place count 1105 transition count 2189
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 328 place count 1105 transition count 2141
Deduced a syphon composed of 48 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 97 rules applied. Total rules applied 425 place count 1056 transition count 2141
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 438 place count 1051 transition count 2133
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 446 place count 1043 transition count 2133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 449 place count 1040 transition count 2130
Iterating global reduction 4 with 3 rules applied. Total rules applied 452 place count 1040 transition count 2130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 455 place count 1040 transition count 2127
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 5 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 609 place count 963 transition count 2050
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 613 place count 961 transition count 2051
Applied a total of 613 rules in 241 ms. Remains 961 /1269 variables (removed 308) and now considering 2051/2353 (removed 302) transitions.
// Phase 1: matrix 2051 rows 961 cols
[2024-06-01 12:36:50] [INFO ] Computed 128 invariants in 24 ms
[2024-06-01 12:36:51] [INFO ] Implicit Places using invariants in 1324 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 532, 537, 616, 622, 627, 704, 710, 715, 794, 800, 805, 882, 888, 893, 958]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1327 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 930/3935 places, 2051/4778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 930 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 929 transition count 2050
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 22 place count 909 transition count 2030
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 909 transition count 2030
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 62 place count 889 transition count 2010
Iterating global reduction 2 with 20 rules applied. Total rules applied 82 place count 889 transition count 2010
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 879 transition count 2000
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 879 transition count 2000
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 122 place count 869 transition count 1990
Applied a total of 122 rules in 314 ms. Remains 869 /930 variables (removed 61) and now considering 1990/2051 (removed 61) transitions.
// Phase 1: matrix 1990 rows 869 cols
[2024-06-01 12:36:51] [INFO ] Computed 97 invariants in 32 ms
[2024-06-01 12:36:53] [INFO ] Implicit Places using invariants in 1546 ms returned []
[2024-06-01 12:36:53] [INFO ] Invariant cache hit.
[2024-06-01 12:36:57] [INFO ] Implicit Places using invariants and state equation in 4010 ms returned []
Implicit Place search using SMT with State Equation took 5569 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 869/3935 places, 1990/4778 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 11927 ms. Remains : 869/3935 places, 1990/4778 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-14
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-14 finished in 11998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 3935 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3935/3935 places, 4778/4778 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3930 transition count 4761
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3930 transition count 4761
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 3926 transition count 4750
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 3926 transition count 4750
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 3926 transition count 4749
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 3925 transition count 4748
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 3925 transition count 4748
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 3924 transition count 4740
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 3924 transition count 4740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 3923 transition count 4732
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 3923 transition count 4732
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 3922 transition count 4731
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 3922 transition count 4731
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 3921 transition count 4723
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 3921 transition count 4723
Applied a total of 29 rules in 5519 ms. Remains 3921 /3935 variables (removed 14) and now considering 4723/4778 (removed 55) transitions.
// Phase 1: matrix 4723 rows 3921 cols
[2024-06-01 12:37:03] [INFO ] Computed 422 invariants in 80 ms
[2024-06-01 12:37:06] [INFO ] Implicit Places using invariants in 3607 ms returned []
[2024-06-01 12:37:06] [INFO ] Invariant cache hit.
[2024-06-01 12:37:34] [INFO ] Implicit Places using invariants and state equation in 27879 ms returned []
Implicit Place search using SMT with State Equation took 31496 ms to find 0 implicit places.
Running 4722 sub problems to find dead transitions.
[2024-06-01 12:37:34] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 239/239 constraints. Problems are: Problem set: 0 solved, 4722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3920/8644 variables, and 239 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30128 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, Generalized P Invariants (flows): 239/321 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 4722/4722 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4722 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3920 variables, 239/239 constraints. Problems are: Problem set: 0 solved, 4722 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 3920/8644 variables, and 239 constraints, problems are : Problem set: 0 solved, 4722 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 0/101 constraints, Generalized P Invariants (flows): 239/321 constraints, State Equation: 0/3921 constraints, PredecessorRefiner: 0/4722 constraints, Known Traps: 0/0 constraints]
After SMT, in 63278ms problems are : Problem set: 0 solved, 4722 unsolved
Search for dead transitions found 0 dead transitions in 63338ms
Starting structural reductions in LTL mode, iteration 1 : 3921/3935 places, 4723/4778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100380 ms. Remains : 3921/3935 places, 4723/4778 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-10b-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-10b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-10b-LTLCardinality-15 finished in 100674 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))))'
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&&F(!p1)) U G(!p0)))'
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))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&G(p1))))'
[2024-06-01 12:38:39] [INFO ] Flatten gal took : 235 ms
[2024-06-01 12:38:39] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 12:38:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3935 places, 4778 transitions and 14759 arcs took 43 ms.
Total runtime 1864092 ms.
There are residual formulas that ITS could not solve within timeout

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