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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 16K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 18:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716591391138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 22:56:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 22:56:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 22:56:32] [INFO ] Load time of PNML (sax parser for PT used): 655 ms
[2024-05-24 22:56:33] [INFO ] Transformed 12464 places.
[2024-05-24 22:56:33] [INFO ] Transformed 18463 transitions.
[2024-05-24 22:56:33] [INFO ] Parsed PT model containing 12464 places and 18463 transitions and 71462 arcs in 853 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Support contains 63 out of 12464 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12464/12464 places, 18463/18463 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 12424 transition count 18463
Discarding 3583 places :
Symmetric choice reduction at 1 with 3583 rule applications. Total rules 3623 place count 8841 transition count 14880
Iterating global reduction 1 with 3583 rules applied. Total rules applied 7206 place count 8841 transition count 14880
Discarding 3286 places :
Symmetric choice reduction at 1 with 3286 rule applications. Total rules 10492 place count 5555 transition count 11594
Iterating global reduction 1 with 3286 rules applied. Total rules applied 13778 place count 5555 transition count 11594
Discarding 530 places :
Symmetric choice reduction at 1 with 530 rule applications. Total rules 14308 place count 5025 transition count 8414
Iterating global reduction 1 with 530 rules applied. Total rules applied 14838 place count 5025 transition count 8414
Applied a total of 14838 rules in 3216 ms. Remains 5025 /12464 variables (removed 7439) and now considering 8414/18463 (removed 10049) transitions.
[2024-05-24 22:56:36] [INFO ] Flow matrix only has 7814 transitions (discarded 600 similar events)
// Phase 1: matrix 7814 rows 5025 cols
[2024-05-24 22:56:37] [INFO ] Computed 989 invariants in 607 ms
[2024-05-24 22:56:46] [INFO ] Implicit Places using invariants in 9871 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 30, 37, 46, 57, 70, 85, 102, 142, 165, 189, 213, 215, 217, 219, 221, 223, 225, 246, 265, 282, 297, 310, 321, 330, 337, 342, 345, 379, 382, 383, 384, 385, 386, 387, 388, 391, 396, 403, 412, 423, 436, 451, 468, 487, 508, 530, 552, 553, 554, 555, 556, 557, 558, 577, 594, 609, 622, 633, 642, 649, 654, 657, 659, 686, 693, 696, 697, 698, 699, 700, 701, 702, 704, 707, 712, 719, 728, 739, 752, 767, 784, 803, 823, 843, 844, 845, 846, 847, 848, 849, 866, 881, 894, 905, 914, 921, 926, 929, 931, 933, 960, 967, 970, 971, 973, 974, 975, 976, 978, 980, 983, 988, 995, 1007, 1018, 1031, 1046, 1063, 1081, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1120, 1133, 1144, 1153, 1160, 1165, 1168, 1170, 1172, 1174, 1201, 1208, 1211, 1212, 1213, 1214, 1215, 1217, 1219, 1221, 1223, 1226, 1231, 1238, 1247, 1260, 1273, 1288, 1304, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1339, 1350, 1359, 1366, 1371, 1374, 1376, 1378, 1380, 1382, 1409, 1416, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1427, 1429, 1431, 1433, 1436, 1441, 1448, 1457, 1468, 1481, 1495, 1509, 1510, 1511, 1513, 1514, 1515, 1528, 1537, 1544, 1549, 1552, 1554, 1556, 1558, 1560, 1562, 1589, 1596, 1599, 1600, 1602, 1603, 1604, 1605, 1607, 1609, 1611, 1613, 1615, 1618, 1623, 1630, 1640, 1653, 1665, 1677, 1678, 1679, 1680, 1681, 1682, 1683, 1692, 1699, 1704, 1707, 1709, 1711, 1713, 1715, 1717, 1719, 1746, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1764, 1766, 1768, 1770, 1772, 1774, 1777, 1782, 1789, 1798, 1808, 1818, 1821, 1822, 1823, 1824, 1825, 1834, 1839, 1842, 1844, 1846, 1848, 1850, 1852, 1854, 1856, 1883, 1890, 1893, 1894, 1895, 1896, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1911, 1915, 1918, 1923, 1930, 1938, 1946, 1947, 1948, 1949, 1950, 1951, 1952, 1957, 1960, 1962, 1964, 1966, 1968, 1970, 1972, 1974, 1976, 2003, 2010, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2021, 2023, 2025, 2027, 2029, 2031, 2033, 2035, 2038, 2043, 2049, 2055, 2056, 2057, 2058, 2059, 2060, 2061, 2064, 2066, 2068, 2070, 2072, 2074, 2076, 2078, 2080, 2082, 2109, 2116, 2119, 2121, 2122, 2123, 2124, 2125, 2127, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2143, 2146, 2152, 2156, 2157, 2158, 2159, 2160, 2161, 2162, 2164, 2166, 2168, 2170, 2172, 2174, 2176, 2178, 2180, 2182, 2216, 2219, 2220, 2221, 2222, 2223, 2225, 2227, 2229, 2232, 2234, 2236, 2239, 2241, 2243, 2245, 2247, 2252, 2255, 2256, 2257, 2259, 2260, 2261, 2263, 2265, 2267, 2269, 2271, 2273, 2275, 2277, 2281, 2283, 2310, 2312, 2316, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 2327, 2329, 2331, 2333, 2335, 2337, 2339, 2341, 2343, 2345, 2347, 2350, 2351, 2352, 2354, 2355, 2356, 2358, 2362, 2364, 2366, 2368, 2370, 2372, 2374, 2376, 2378, 2405, 2412, 2415, 2416, 2417, 2418, 2419, 2420, 2421, 2423, 2425, 2427, 2429, 2431, 2433, 2435, 2437, 2439, 2441, 2443, 2447, 2448, 2449, 2450, 2451, 2452, 2454, 2456, 2458, 2460, 2464, 2466, 2468, 2470, 2472, 2474, 2501, 2508, 2511, 2512, 2513, 2514, 2515, 2516, 2517, 2519, 2521, 2523, 2525, 2527, 2529, 2531, 2533, 2535, 2537, 2540, 2545, 2546, 2547, 2548, 2549, 2550, 2551, 2554, 2556, 2558, 2560, 2562, 2564, 2566, 2568, 2570, 2572, 2599, 2606, 2609, 2610, 2611, 2612, 2613, 2614, 2615, 2617, 2619, 2621, 2623, 2625, 2627, 2629, 2631, 2633, 2636, 2641, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2659, 2662, 2664, 2666, 2668, 2670, 2672, 2674, 2676, 2678, 2705, 2712, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2723, 2725, 2727, 2729, 2731, 2733, 2735, 2737, 2740, 2745, 2752, 2761, 2762, 2763, 2764, 2765, 2766, 2767, 2774, 2779, 2782, 2784, 2786, 2788, 2790, 2792, 2794, 2796, 2823, 2830, 2833, 2834, 2835, 2836, 2837, 2838, 2839, 2841, 2843, 2845, 2847, 2849, 2851, 2853, 2856, 2861, 2868, 2877, 2888, 2889, 2890, 2891, 2892, 2893, 2894, 2903, 2910, 2915, 2918, 2920, 2922, 2924, 2926, 2928, 2930, 2957, 2964, 2967, 2968, 2969, 2970, 2971, 2972, 2973, 2975, 2977, 2979, 2981, 2983, 2985, 2988, 2994, 3001, 3010, 3021, 3034, 3035, 3036, 3037, 3038, 3039, 3040, 3051, 3060, 3067, 3072, 3075, 3077, 3079, 3081, 3083, 3085, 3112, 3119, 3122, 3123, 3124, 3125, 3126, 3127, 3128, 3130, 3132, 3134, 3136, 3138, 3141, 3146, 3153, 3162, 3173, 3186, 3201, 3202, 3203, 3204, 3205, 3206, 3207, 3220, 3231, 3240, 3247, 3252, 3255, 3257, 3259, 3261, 3263, 3290, 3297, 3300, 3301, 3302, 3303, 3304, 3305, 3306, 3308, 3310, 3312, 3314, 3317, 3322, 3329, 3338, 3349, 3362, 3377, 3394, 3395, 3396, 3397, 3398, 3399, 3400, 3415, 3428, 3439, 3448, 3455, 3460, 3463, 3465, 3467, 3469, 3496, 3503, 3506, 3507, 3508, 3509, 3510, 3511, 3512, 3514, 3516, 3518, 3521, 3526, 3533, 3542, 3553, 3566, 3581, 3598, 3617, 3618, 3619, 3620, 3621, 3622, 3623, 3640, 3655, 3668, 3679, 3688, 3695, 3700, 3703, 3705, 3707, 3734, 3741, 3744, 3745, 3746, 3747, 3748, 3749, 3750, 3752, 3754, 3757, 3762, 3769, 3778, 3789, 3802, 3817, 3834, 3853, 3874, 3875, 3876, 3877, 3878, 3879, 3880, 3899, 3916, 3931, 3944, 3955, 3964, 3971, 3976, 3979, 3981, 4008, 4015, 4018, 4019, 4020, 4021, 4022, 4023, 4024, 4026, 4029, 4034, 4041, 4050, 4061, 4074, 4089, 4106, 4125, 4146, 4170, 4171, 4172, 4174, 4175, 4198, 4217, 4234, 4252, 4265, 4276, 4285, 4292, 4297, 4300, 4327, 4329, 4333, 4336, 4337, 4338, 4339, 4340, 4341, 4342, 4345, 4350, 4357, 4366, 4377, 4390, 4405, 4422, 4441, 4462, 4485, 4511, 4512, 4513, 4514, 4515, 4516, 4540, 4561, 4580, 4597, 4612, 4625, 4636, 4645, 4655, 4660, 4688]
[2024-05-24 22:56:46] [INFO ] Actually due to overlaps returned [686, 960, 1201, 1409, 1589, 1746, 1883, 2003, 2109, 2310, 2405, 2501, 2599, 2705, 2823, 2957, 3112, 3290, 3496, 3734, 4008, 4327, 4688, 4, 12, 14, 16, 18, 20, 22, 213, 215, 217, 219, 221, 223, 379, 382, 383, 384, 385, 386, 387, 468, 552, 553, 554, 555, 556, 557, 693, 696, 697, 698, 699, 700, 701, 767, 843, 844, 845, 846, 847, 848, 967, 970, 971, 973, 974, 975, 1031, 1099, 1100, 1101, 1102, 1103, 1104, 1208, 1211, 1212, 1213, 1214, 1215, 1260, 1320, 1321, 1322, 1323, 1324, 1325, 1416, 1419, 1420, 1421, 1422, 1423, 1424, 1457, 1509, 1510, 1511, 1513, 1514, 1596, 1599, 1600, 1602, 1603, 1604, 1630, 1677, 1678, 1679, 1680, 1681, 1682, 1756, 1757, 1758, 1759, 1760, 1761, 1782, 1818, 1821, 1822, 1823, 1824, 1890, 1893, 1894, 1895, 1896, 1897, 1918, 1946, 1947, 1948, 1949, 1950, 1951, 2010, 2013, 2014, 2015, 2016, 2017, 2018, 2035, 2055, 2056, 2057, 2058, 2059, 2060, 2116, 2119, 2121, 2122, 2123, 2124, 2156, 2157, 2158, 2159, 2160, 2161, 2216, 2219, 2220, 2221, 2222, 2223, 2245, 2255, 2256, 2257, 2259, 2260, 2312, 2316, 2319, 2320, 2321, 2322, 2323, 2324, 2343, 2350, 2351, 2352, 2354, 2355, 2412, 2415, 2416, 2417, 2418, 2419, 2420, 2439, 2447, 2448, 2449, 2450, 2451, 2508, 2511, 2512, 2513, 2514, 2515, 2516, 2535, 2545, 2546, 2547, 2548, 2549, 2550, 2606, 2609, 2610, 2611, 2612, 2613, 2614, 2633, 2648, 2649, 2650, 2651, 2652, 2653, 2712, 2715, 2716, 2717, 2718, 2719, 2720, 2740, 2761, 2762, 2763, 2764, 2765, 2766, 2830, 2833, 2834, 2835, 2836, 2837, 2838, 2861, 2888, 2889, 2890, 2891, 2892, 2893, 2964, 2967, 2968, 2969, 2970, 2971, 2972, 3001, 3034, 3035, 3036, 3037, 3038, 3039, 3119, 3122, 3123, 3124, 3125, 3126, 3127, 3162, 3201, 3202, 3203, 3204, 3205, 3206, 3297, 3300, 3301, 3302, 3303, 3304, 3305, 3349, 3394, 3395, 3396, 3397, 3398, 3399, 3503, 3506, 3507, 3508, 3509, 3510, 3511, 3566, 3617, 3618, 3619, 3620, 3621, 3622, 3741, 3744, 3745, 3746, 3747, 3748, 3749, 3817, 3874, 3875, 3876, 3877, 3878, 3879, 4015, 4018, 4019, 4020, 4021, 4022, 4023, 4106, 4170, 4171, 4172, 4174, 4329, 4333, 4336, 4337, 4338, 4339, 4340, 4341, 4441, 4511, 4512, 4513, 4514, 4515]
Discarding 358 places :
Implicit Place search using SMT only with invariants took 9964 ms to find 358 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4667/12464 places, 8414/18463 transitions.
Discarding 274 places :
Symmetric choice reduction at 0 with 274 rule applications. Total rules 274 place count 4393 transition count 8140
Iterating global reduction 0 with 274 rules applied. Total rules applied 548 place count 4393 transition count 8140
Discarding 274 places :
Symmetric choice reduction at 0 with 274 rule applications. Total rules 822 place count 4119 transition count 7866
Iterating global reduction 0 with 274 rules applied. Total rules applied 1096 place count 4119 transition count 7866
Discarding 273 places :
Symmetric choice reduction at 0 with 273 rule applications. Total rules 1369 place count 3846 transition count 7593
Iterating global reduction 0 with 273 rules applied. Total rules applied 1642 place count 3846 transition count 7593
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 1676 place count 3812 transition count 7389
Iterating global reduction 0 with 34 rules applied. Total rules applied 1710 place count 3812 transition count 7389
Applied a total of 1710 rules in 1679 ms. Remains 3812 /4667 variables (removed 855) and now considering 7389/8414 (removed 1025) transitions.
[2024-05-24 22:56:48] [INFO ] Flow matrix only has 6789 transitions (discarded 600 similar events)
// Phase 1: matrix 6789 rows 3812 cols
[2024-05-24 22:56:48] [INFO ] Computed 631 invariants in 159 ms
[2024-05-24 22:56:54] [INFO ] Implicit Places using invariants in 5793 ms returned [7, 17, 23, 30, 39, 50, 63, 78, 95, 135, 158, 182, 212, 233, 252, 269, 284, 297, 308, 317, 324, 329, 332, 367, 370, 375, 382, 391, 402, 415, 430, 465, 486, 508, 529, 548, 565, 580, 593, 604, 613, 620, 625, 628, 630, 640, 642, 645, 650, 657, 666, 677, 690, 721, 740, 760, 779, 796, 811, 824, 835, 844, 851, 856, 859, 861, 863, 875, 877, 879, 882, 887, 894, 906, 917, 944, 961, 979, 996, 1011, 1024, 1035, 1044, 1051, 1056, 1059, 1061, 1063, 1065, 1079, 1081, 1083, 1085, 1088, 1093, 1100, 1109, 1134, 1149, 1165, 1180, 1193, 1204, 1213, 1220, 1225, 1228, 1230, 1232, 1234, 1236, 1248, 1250, 1252, 1254, 1256, 1259, 1264, 1271, 1290, 1303, 1317, 1332, 1345, 1354, 1361, 1366, 1369, 1371, 1373, 1375, 1377, 1379, 1393, 1395, 1397, 1399, 1401, 1403, 1406, 1411, 1427, 1440, 1452, 1463, 1472, 1479, 1484, 1487, 1489, 1491, 1493, 1495, 1497, 1499, 1512, 1514, 1516, 1518, 1520, 1522, 1524, 1527, 1538, 1547, 1557, 1569, 1578, 1583, 1586, 1588, 1590, 1592, 1594, 1596, 1598, 1600, 1614, 1616, 1618, 1620, 1622, 1624, 1626, 1630, 1637, 1644, 1652, 1659, 1664, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1696, 1698, 1700, 1702, 1704, 1706, 1708, 1710, 1714, 1719, 1725, 1730, 1733, 1735, 1737, 1739, 1741, 1743, 1745, 1747, 1749, 1751, 1764, 1766, 1768, 1770, 1772, 1774, 1776, 1778, 1780, 1782, 1785, 1791, 1794, 1796, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1814, 1829, 1831, 1833, 1836, 1838, 1840, 1843, 1845, 1847, 1850, 1855, 1859, 1861, 1863, 1865, 1867, 1869, 1871, 1873, 1875, 1879, 1881, 1893, 1895, 1897, 1899, 1901, 1903, 1905, 1907, 1909, 1912, 1914, 1918, 1920, 1924, 1926, 1928, 1930, 1932, 1934, 1936, 1938, 1940, 1952, 1954, 1956, 1958, 1960, 1962, 1964, 1966, 1968, 1971, 1973, 1977, 1979, 1981, 1983, 1985, 1989, 1991, 1993, 1995, 1997, 1999, 2011, 2013, 2015, 2017, 2019, 2021, 2023, 2025, 2027, 2030, 2033, 2037, 2040, 2042, 2044, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2068, 2070, 2072, 2074, 2076, 2078, 2080, 2082, 2084, 2088, 2093, 2099, 2104, 2107, 2109, 2111, 2113, 2115, 2117, 2119, 2121, 2123, 2133, 2135, 2137, 2139, 2141, 2143, 2145, 2147, 2149, 2156, 2163, 2171, 2178, 2183, 2186, 2188, 2190, 2192, 2194, 2196, 2198, 2200, 2210, 2212, 2214, 2216, 2218, 2220, 2222, 2224, 2227, 2238, 2247, 2257, 2266, 2273, 2278, 2281, 2283, 2285, 2287, 2289, 2291, 2293, 2303, 2305, 2307, 2309, 2311, 2313, 2315, 2318, 2324, 2339, 2350, 2362, 2373, 2382, 2389, 2394, 2397, 2399, 2401, 2403, 2405, 2407, 2417, 2419, 2421, 2423, 2425, 2427, 2430, 2435, 2442, 2461, 2474, 2488, 2501, 2512, 2521, 2528, 2533, 2536, 2538, 2540, 2542, 2544, 2554, 2556, 2558, 2560, 2562, 2565, 2570, 2577, 2586, 2609, 2624, 2640, 2655, 2668, 2679, 2688, 2695, 2700, 2703, 2705, 2707, 2709, 2719, 2721, 2723, 2725, 2728, 2733, 2740, 2749, 2760, 2787, 2804, 2822, 2839, 2854, 2867, 2878, 2887, 2894, 2899, 2902, 2904, 2906, 2916, 2918, 2920, 2923, 2928, 2935, 2944, 2955, 2968, 2999, 3018, 3038, 3057, 3074, 3089, 3102, 3113, 3122, 3129, 3134, 3137, 3139, 3149, 3151, 3154, 3159, 3166, 3175, 3186, 3199, 3214, 3249, 3270, 3295, 3318, 3337, 3354, 3372, 3385, 3396, 3405, 3412, 3417, 3420, 3432, 3435, 3440, 3447, 3456, 3467, 3480, 3495, 3512, 3551, 3574, 3600, 3624, 3645, 3664, 3681, 3696, 3709, 3720, 3729, 3739, 3744]
Discarding 552 places :
Implicit Place search using SMT only with invariants took 5810 ms to find 552 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3260/12464 places, 7389/18463 transitions.
Applied a total of 0 rules in 285 ms. Remains 3260 /3260 variables (removed 0) and now considering 7389/7389 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 20980 ms. Remains : 3260/12464 places, 7389/18463 transitions.
Support contains 63 out of 3260 places after structural reductions.
[2024-05-24 22:56:55] [INFO ] Flatten gal took : 414 ms
[2024-05-24 22:56:55] [INFO ] Flatten gal took : 231 ms
[2024-05-24 22:56:55] [INFO ] Input system was already deterministic with 7389 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (645 resets) in 2904 ms. (13 steps per ms) remains 22/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 43 ms. (91 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 48 ms. (81 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 110 ms. (36 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 51 ms. (77 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
[2024-05-24 22:56:57] [INFO ] Flow matrix only has 6789 transitions (discarded 600 similar events)
// Phase 1: matrix 6789 rows 3260 cols
[2024-05-24 22:56:57] [INFO ] Computed 79 invariants in 151 ms
[2024-05-24 22:56:57] [INFO ] State equation strengthened by 2782 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 3103/3146 variables, 19/19 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-05-24 22:57:00] [INFO ] Deduced a trap composed of 1220 places in 2415 ms of which 222 ms to minimize.
[2024-05-24 22:57:02] [INFO ] Deduced a trap composed of 440 places in 2263 ms of which 22 ms to minimize.
SMT process timed out in 5581ms, After SMT, problems are : Problem set: 3 solved, 17 unsolved
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 7389/7389 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 3260 transition count 7368
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 3239 transition count 7368
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 42 place count 3239 transition count 7350
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 78 place count 3221 transition count 7350
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 3212 transition count 7321
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 3212 transition count 7321
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 96 place count 3212 transition count 7320
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 3211 transition count 7320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 3206 transition count 7290
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 3206 transition count 7290
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 4 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 176 place count 3172 transition count 7256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 180 place count 3168 transition count 7252
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 3168 transition count 7252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 188 place count 3164 transition count 7228
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 3164 transition count 7228
Free-agglomeration rule (complex) applied 284 times.
Iterating global reduction 2 with 284 rules applied. Total rules applied 476 place count 3164 transition count 9779
Reduce places removed 284 places and 0 transitions.
Iterating post reduction 2 with 284 rules applied. Total rules applied 760 place count 2880 transition count 9779
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 769 place count 2880 transition count 9779
Applied a total of 769 rules in 3708 ms. Remains 2880 /3260 variables (removed 380) and now considering 9779/7389 (removed -2390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3711 ms. Remains : 2880/3260 places, 9779/7389 transitions.
RANDOM walk for 40000 steps (1077 resets) in 1880 ms. (21 steps per ms) remains 14/17 properties
BEST_FIRST walk for 40004 steps (108 resets) in 193 ms. (206 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (109 resets) in 181 ms. (219 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (110 resets) in 185 ms. (215 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (107 resets) in 231 ms. (172 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (96 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (107 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (96 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (106 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (109 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (110 resets) in 255 ms. (156 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (96 resets) in 185 ms. (215 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (106 resets) in 183 ms. (217 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (106 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
[2024-05-24 22:57:07] [INFO ] Flow matrix only has 8917 transitions (discarded 862 similar events)
// Phase 1: matrix 8917 rows 2880 cols
[2024-05-24 22:57:07] [INFO ] Computed 79 invariants in 160 ms
[2024-05-24 22:57:07] [INFO ] State equation strengthened by 5552 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 2737/2761 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-24 22:57:10] [INFO ] Deduced a trap composed of 214 places in 2146 ms of which 21 ms to minimize.
[2024-05-24 22:57:12] [INFO ] Deduced a trap composed of 196 places in 2054 ms of which 19 ms to minimize.
[2024-05-24 22:57:14] [INFO ] Deduced a trap composed of 186 places in 2116 ms of which 19 ms to minimize.
[2024-05-24 22:57:17] [INFO ] Deduced a trap composed of 152 places in 2226 ms of which 21 ms to minimize.
[2024-05-24 22:57:19] [INFO ] Deduced a trap composed of 194 places in 2265 ms of which 19 ms to minimize.
[2024-05-24 22:57:21] [INFO ] Deduced a trap composed of 256 places in 2118 ms of which 17 ms to minimize.
[2024-05-24 22:57:23] [INFO ] Deduced a trap composed of 179 places in 2227 ms of which 18 ms to minimize.
[2024-05-24 22:57:26] [INFO ] Deduced a trap composed of 134 places in 2220 ms of which 18 ms to minimize.
[2024-05-24 22:57:28] [INFO ] Deduced a trap composed of 217 places in 2221 ms of which 19 ms to minimize.
[2024-05-24 22:57:30] [INFO ] Deduced a trap composed of 951 places in 2208 ms of which 18 ms to minimize.
[2024-05-24 22:57:32] [INFO ] Deduced a trap composed of 267 places in 2167 ms of which 18 ms to minimize.
[2024-05-24 22:57:35] [INFO ] Deduced a trap composed of 204 places in 2229 ms of which 19 ms to minimize.
[2024-05-24 22:57:37] [INFO ] Deduced a trap composed of 188 places in 2161 ms of which 18 ms to minimize.
[2024-05-24 22:57:39] [INFO ] Deduced a trap composed of 230 places in 2086 ms of which 18 ms to minimize.
[2024-05-24 22:57:41] [INFO ] Deduced a trap composed of 247 places in 2067 ms of which 17 ms to minimize.
[2024-05-24 22:57:43] [INFO ] Deduced a trap composed of 1101 places in 1860 ms of which 18 ms to minimize.
[2024-05-24 22:57:45] [INFO ] Deduced a trap composed of 171 places in 2058 ms of which 18 ms to minimize.
[2024-05-24 22:57:47] [INFO ] Deduced a trap composed of 629 places in 1953 ms of which 16 ms to minimize.
[2024-05-24 22:57:50] [INFO ] Deduced a trap composed of 178 places in 2132 ms of which 19 ms to minimize.
[2024-05-24 22:57:52] [INFO ] Deduced a trap composed of 155 places in 2113 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2761 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-24 22:57:54] [INFO ] Deduced a trap composed of 189 places in 2217 ms of which 19 ms to minimize.
SMT process timed out in 46923ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 2880 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2880/2880 places, 9779/9779 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2880 transition count 9778
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2879 transition count 9778
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2878 transition count 9777
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2878 transition count 9777
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 0 with 2 rules applied. Total rules applied 6 place count 2877 transition count 9776
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 31 place count 2877 transition count 9801
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 56 place count 2852 transition count 9801
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 2852 transition count 9801
Applied a total of 57 rules in 1940 ms. Remains 2852 /2880 variables (removed 28) and now considering 9801/9779 (removed -22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1942 ms. Remains : 2852/2880 places, 9801/9779 transitions.
RANDOM walk for 40000 steps (1102 resets) in 1622 ms. (24 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (109 resets) in 183 ms. (217 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (110 resets) in 181 ms. (219 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (97 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (107 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (98 resets) in 168 ms. (236 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (109 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (109 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (107 resets) in 202 ms. (197 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (96 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (111 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
[2024-05-24 22:57:57] [INFO ] Flow matrix only has 8916 transitions (discarded 885 similar events)
// Phase 1: matrix 8916 rows 2852 cols
[2024-05-24 22:57:57] [INFO ] Computed 79 invariants in 169 ms
[2024-05-24 22:57:57] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 2712/2730 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 22:58:00] [INFO ] Deduced a trap composed of 229 places in 1977 ms of which 17 ms to minimize.
[2024-05-24 22:58:02] [INFO ] Deduced a trap composed of 108 places in 2093 ms of which 18 ms to minimize.
[2024-05-24 22:58:04] [INFO ] Deduced a trap composed of 128 places in 2082 ms of which 18 ms to minimize.
[2024-05-24 22:58:06] [INFO ] Deduced a trap composed of 139 places in 1982 ms of which 18 ms to minimize.
[2024-05-24 22:58:08] [INFO ] Deduced a trap composed of 149 places in 2054 ms of which 17 ms to minimize.
[2024-05-24 22:58:10] [INFO ] Deduced a trap composed of 191 places in 2061 ms of which 17 ms to minimize.
[2024-05-24 22:58:12] [INFO ] Deduced a trap composed of 179 places in 1992 ms of which 19 ms to minimize.
[2024-05-24 22:58:14] [INFO ] Deduced a trap composed of 202 places in 1985 ms of which 18 ms to minimize.
[2024-05-24 22:58:16] [INFO ] Deduced a trap composed of 128 places in 2082 ms of which 17 ms to minimize.
[2024-05-24 22:58:18] [INFO ] Deduced a trap composed of 168 places in 1984 ms of which 16 ms to minimize.
[2024-05-24 22:58:21] [INFO ] Deduced a trap composed of 167 places in 2199 ms of which 19 ms to minimize.
[2024-05-24 22:58:22] [INFO ] Deduced a trap composed of 1052 places in 1855 ms of which 21 ms to minimize.
[2024-05-24 22:58:24] [INFO ] Deduced a trap composed of 715 places in 1879 ms of which 18 ms to minimize.
[2024-05-24 22:58:26] [INFO ] Deduced a trap composed of 782 places in 1801 ms of which 17 ms to minimize.
[2024-05-24 22:58:29] [INFO ] Deduced a trap composed of 766 places in 2075 ms of which 18 ms to minimize.
[2024-05-24 22:58:31] [INFO ] Deduced a trap composed of 358 places in 2007 ms of which 16 ms to minimize.
[2024-05-24 22:58:33] [INFO ] Deduced a trap composed of 202 places in 1971 ms of which 17 ms to minimize.
[2024-05-24 22:58:35] [INFO ] Deduced a trap composed of 208 places in 2068 ms of which 18 ms to minimize.
[2024-05-24 22:58:37] [INFO ] Deduced a trap composed of 266 places in 2090 ms of which 17 ms to minimize.
[2024-05-24 22:58:39] [INFO ] Deduced a trap composed of 283 places in 2036 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2730 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 22:58:41] [INFO ] Deduced a trap composed of 135 places in 2117 ms of which 17 ms to minimize.
[2024-05-24 22:58:43] [INFO ] Deduced a trap composed of 164 places in 2058 ms of which 18 ms to minimize.
[2024-05-24 22:58:46] [INFO ] Deduced a trap composed of 150 places in 2187 ms of which 18 ms to minimize.
[2024-05-24 22:58:48] [INFO ] Deduced a trap composed of 154 places in 2047 ms of which 17 ms to minimize.
[2024-05-24 22:58:50] [INFO ] Deduced a trap composed of 168 places in 2177 ms of which 18 ms to minimize.
[2024-05-24 22:58:52] [INFO ] Deduced a trap composed of 169 places in 2209 ms of which 18 ms to minimize.
[2024-05-24 22:58:54] [INFO ] Deduced a trap composed of 138 places in 2051 ms of which 16 ms to minimize.
[2024-05-24 22:58:56] [INFO ] Deduced a trap composed of 166 places in 2154 ms of which 17 ms to minimize.
[2024-05-24 22:58:59] [INFO ] Deduced a trap composed of 213 places in 2150 ms of which 19 ms to minimize.
[2024-05-24 22:59:01] [INFO ] Deduced a trap composed of 216 places in 2164 ms of which 18 ms to minimize.
[2024-05-24 22:59:03] [INFO ] Deduced a trap composed of 172 places in 2083 ms of which 18 ms to minimize.
[2024-05-24 22:59:06] [INFO ] Deduced a trap composed of 1353 places in 1916 ms of which 16 ms to minimize.
[2024-05-24 22:59:08] [INFO ] Deduced a trap composed of 845 places in 2091 ms of which 23 ms to minimize.
[2024-05-24 22:59:10] [INFO ] Deduced a trap composed of 237 places in 2088 ms of which 18 ms to minimize.
[2024-05-24 22:59:12] [INFO ] Deduced a trap composed of 213 places in 2179 ms of which 19 ms to minimize.
[2024-05-24 22:59:14] [INFO ] Deduced a trap composed of 150 places in 2171 ms of which 18 ms to minimize.
SMT process timed out in 77313ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 2852 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2852/2852 places, 9801/9801 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2852 transition count 9800
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2851 transition count 9800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2850 transition count 9799
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2850 transition count 9799
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 2850 transition count 9798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 2849 transition count 9798
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 2849 transition count 9798
Applied a total of 7 rules in 1675 ms. Remains 2849 /2852 variables (removed 3) and now considering 9798/9801 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1675 ms. Remains : 2849/2852 places, 9798/9801 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
Computed a total of 636 stabilizing places and 2188 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(X((X(G(p0))||G((p1&&X(G((G(p3)||p2)))))))))'
Support contains 5 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 7389/7389 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3241 transition count 7345
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 3241 transition count 7345
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 52 place count 3227 transition count 7281
Iterating global reduction 0 with 14 rules applied. Total rules applied 66 place count 3227 transition count 7281
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3223 transition count 7257
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3223 transition count 7257
Applied a total of 74 rules in 1253 ms. Remains 3223 /3260 variables (removed 37) and now considering 7257/7389 (removed 132) transitions.
[2024-05-24 22:59:18] [INFO ] Flow matrix only has 6657 transitions (discarded 600 similar events)
// Phase 1: matrix 6657 rows 3223 cols
[2024-05-24 22:59:18] [INFO ] Computed 79 invariants in 169 ms
[2024-05-24 22:59:22] [INFO ] Implicit Places using invariants in 4755 ms returned [104, 335, 988, 1206, 1254, 1348, 1394, 1426, 1528, 1559, 1568, 1582, 1617, 1652, 2746, 2747, 3025]
[2024-05-24 22:59:22] [INFO ] Actually due to overlaps returned [335, 1559, 988, 1206, 1254, 1394, 1426, 1528, 1568, 1582, 1617, 1652, 2746, 2747, 3025]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 4761 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3208/3260 places, 7257/7389 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3195 transition count 7244
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3195 transition count 7244
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 3182 transition count 7231
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 3182 transition count 7231
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 3169 transition count 7218
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 3169 transition count 7218
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 3157 transition count 7146
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 3157 transition count 7146
Applied a total of 102 rules in 1602 ms. Remains 3157 /3208 variables (removed 51) and now considering 7146/7257 (removed 111) transitions.
[2024-05-24 22:59:24] [INFO ] Flow matrix only has 6546 transitions (discarded 600 similar events)
// Phase 1: matrix 6546 rows 3157 cols
[2024-05-24 22:59:24] [INFO ] Computed 64 invariants in 158 ms
[2024-05-24 22:59:29] [INFO ] Implicit Places using invariants in 4868 ms returned [104, 1335]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4879 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3155/3260 places, 7146/7389 transitions.
Applied a total of 0 rules in 323 ms. Remains 3155 /3155 variables (removed 0) and now considering 7146/7146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12821 ms. Remains : 3155/3260 places, 7146/7389 transitions.
Stuttering acceptance computed with spot in 443 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-00
Product exploration explored 100000 steps with 1615 reset in 1041 ms.
Product exploration explored 100000 steps with 1616 reset in 994 ms.
Computed a total of 531 stabilizing places and 1945 stable transitions
Computed a total of 531 stabilizing places and 1945 stable transitions
Detected a total of 531/3155 stabilizing places and 1945/7146 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 40000 steps (644 resets) in 968 ms. (41 steps per ms) remains 9/17 properties
BEST_FIRST walk for 40002 steps (120 resets) in 217 ms. (183 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (120 resets) in 368 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (120 resets) in 297 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (120 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (120 resets) in 205 ms. (194 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (120 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (120 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (120 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (120 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
[2024-05-24 22:59:33] [INFO ] Flow matrix only has 6546 transitions (discarded 600 similar events)
// Phase 1: matrix 6546 rows 3155 cols
[2024-05-24 22:59:33] [INFO ] Computed 62 invariants in 133 ms
[2024-05-24 22:59:33] [INFO ] State equation strengthened by 2627 read => feed constraints.
Problem apf7 is UNSAT
Problem apf10 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem apf1 is UNSAT
Problem apf16 is UNSAT
At refinement iteration 1 (OVERLAPS) 3057/3062 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-05-24 22:59:36] [INFO ] Deduced a trap composed of 328 places in 2192 ms of which 20 ms to minimize.
[2024-05-24 22:59:38] [INFO ] Deduced a trap composed of 239 places in 2228 ms of which 20 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3062/9701 variables, and 6 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/47 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/3155 constraints, ReadFeed: 0/2627 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3057/3062 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3062 variables, 2/6 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-05-24 22:59:41] [INFO ] Deduced a trap composed of 323 places in 2223 ms of which 20 ms to minimize.
[2024-05-24 22:59:43] [INFO ] Deduced a trap composed of 293 places in 2089 ms of which 20 ms to minimize.
[2024-05-24 22:59:45] [INFO ] Deduced a trap composed of 363 places in 2130 ms of which 22 ms to minimize.
SMT process timed out in 12181ms, After SMT, problems are : Problem set: 5 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3155/3155 places, 7146/7146 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 3155 transition count 7123
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 3132 transition count 7123
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 46 place count 3132 transition count 7111
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 70 place count 3120 transition count 7111
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 124 place count 3093 transition count 7084
Free-agglomeration rule (complex) applied 293 times.
Iterating global reduction 2 with 293 rules applied. Total rules applied 417 place count 3093 transition count 9766
Reduce places removed 293 places and 0 transitions.
Iterating post reduction 2 with 293 rules applied. Total rules applied 710 place count 2800 transition count 9766
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 711 place count 2800 transition count 9766
Applied a total of 711 rules in 2035 ms. Remains 2800 /3155 variables (removed 355) and now considering 9766/7146 (removed -2620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2036 ms. Remains : 2800/3155 places, 9766/7146 transitions.
RANDOM walk for 40000 steps (1132 resets) in 1552 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (94 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (94 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (96 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 28718 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 4
Probabilistic random walk after 28718 steps, saw 12190 distinct states, run finished after 3004 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-24 22:59:51] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
// Phase 1: matrix 8880 rows 2800 cols
[2024-05-24 22:59:51] [INFO ] Computed 62 invariants in 155 ms
[2024-05-24 22:59:51] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2707 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 22:59:54] [INFO ] Deduced a trap composed of 111 places in 2264 ms of which 18 ms to minimize.
[2024-05-24 22:59:56] [INFO ] Deduced a trap composed of 258 places in 2272 ms of which 17 ms to minimize.
[2024-05-24 22:59:58] [INFO ] Deduced a trap composed of 146 places in 2172 ms of which 19 ms to minimize.
[2024-05-24 23:00:01] [INFO ] Deduced a trap composed of 176 places in 2285 ms of which 18 ms to minimize.
[2024-05-24 23:00:03] [INFO ] Deduced a trap composed of 260 places in 2276 ms of which 19 ms to minimize.
[2024-05-24 23:00:05] [INFO ] Deduced a trap composed of 173 places in 2250 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2707 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2707 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/2708 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2708 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 42/2750 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2750 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 42/2792 variables, 42/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2792 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/2800 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2800 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8880/11680 variables, 2800/2868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11680 variables, 5602/8470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11680 variables, 0/8470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/11680 variables, 0/8470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11680/11680 variables, and 8470 constraints, problems are : Problem set: 0 solved, 4 unsolved in 21651 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 2800/2800 constraints, ReadFeed: 5602/5602 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2707 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2707 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 23:00:16] [INFO ] Deduced a trap composed of 211 places in 2209 ms of which 19 ms to minimize.
[2024-05-24 23:00:18] [INFO ] Deduced a trap composed of 309 places in 2283 ms of which 20 ms to minimize.
[2024-05-24 23:00:20] [INFO ] Deduced a trap composed of 115 places in 2188 ms of which 18 ms to minimize.
[2024-05-24 23:00:22] [INFO ] Deduced a trap composed of 209 places in 2125 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2707 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2707 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/2708 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2708 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 42/2750 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 23:00:25] [INFO ] Deduced a trap composed of 5 places in 2121 ms of which 18 ms to minimize.
[2024-05-24 23:00:27] [INFO ] Deduced a trap composed of 39 places in 2195 ms of which 18 ms to minimize.
[2024-05-24 23:00:30] [INFO ] Deduced a trap composed of 70 places in 2205 ms of which 18 ms to minimize.
[2024-05-24 23:00:32] [INFO ] Deduced a trap composed of 70 places in 2123 ms of which 19 ms to minimize.
[2024-05-24 23:00:34] [INFO ] Deduced a trap composed of 115 places in 2156 ms of which 17 ms to minimize.
[2024-05-24 23:00:36] [INFO ] Deduced a trap composed of 200 places in 2142 ms of which 18 ms to minimize.
[2024-05-24 23:00:38] [INFO ] Deduced a trap composed of 98 places in 2073 ms of which 17 ms to minimize.
[2024-05-24 23:00:40] [INFO ] Deduced a trap composed of 123 places in 2118 ms of which 19 ms to minimize.
[2024-05-24 23:00:43] [INFO ] Deduced a trap composed of 123 places in 2101 ms of which 19 ms to minimize.
[2024-05-24 23:00:45] [INFO ] Deduced a trap composed of 275 places in 2174 ms of which 19 ms to minimize.
[2024-05-24 23:00:47] [INFO ] Deduced a trap composed of 158 places in 2156 ms of which 17 ms to minimize.
[2024-05-24 23:00:49] [INFO ] Deduced a trap composed of 145 places in 2163 ms of which 19 ms to minimize.
[2024-05-24 23:00:51] [INFO ] Deduced a trap composed of 145 places in 2127 ms of which 19 ms to minimize.
[2024-05-24 23:00:54] [INFO ] Deduced a trap composed of 145 places in 2155 ms of which 19 ms to minimize.
[2024-05-24 23:00:56] [INFO ] Deduced a trap composed of 316 places in 2084 ms of which 18 ms to minimize.
[2024-05-24 23:00:58] [INFO ] Deduced a trap composed of 194 places in 2062 ms of which 18 ms to minimize.
[2024-05-24 23:01:00] [INFO ] Deduced a trap composed of 145 places in 2094 ms of which 19 ms to minimize.
SMT process timed out in 68857ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 9766/9766 transitions.
Applied a total of 0 rules in 485 ms. Remains 2800 /2800 variables (removed 0) and now considering 9766/9766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 2800/2800 places, 9766/9766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2800/2800 places, 9766/9766 transitions.
Applied a total of 0 rules in 461 ms. Remains 2800 /2800 variables (removed 0) and now considering 9766/9766 (removed 0) transitions.
[2024-05-24 23:01:01] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-24 23:01:01] [INFO ] Invariant cache hit.
[2024-05-24 23:01:06] [INFO ] Implicit Places using invariants in 5101 ms returned []
[2024-05-24 23:01:06] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-24 23:01:06] [INFO ] Invariant cache hit.
[2024-05-24 23:01:10] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:01:40] [INFO ] Performed 372/2800 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:02:10] [INFO ] Performed 708/2800 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:02:40] [INFO ] Performed 976/2800 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 23:03:14] [INFO ] Performed 1173/2800 implicitness test of which 0 returned IMPLICIT in 124 seconds.
[2024-05-24 23:03:14] [INFO ] Timeout of Implicit test with SMT after 124 seconds.
[2024-05-24 23:03:14] [INFO ] Implicit Places using invariants and state equation in 128205 ms returned []
Implicit Place search using SMT with State Equation took 133310 ms to find 0 implicit places.
[2024-05-24 23:03:15] [INFO ] Redundant transitions in 1268 ms returned []
Running 9672 sub problems to find dead transitions.
[2024-05-24 23:03:16] [INFO ] Flow matrix only has 8880 transitions (discarded 886 similar events)
[2024-05-24 23:03:16] [INFO ] Invariant cache hit.
[2024-05-24 23:03:16] [INFO ] State equation strengthened by 5602 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2798 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9672 unsolved
SMT process timed out in 90820ms, After SMT, problems are : Problem set: 0 solved, 9672 unsolved
Search for dead transitions found 0 dead transitions in 90926ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226008 ms. Remains : 2800/2800 places, 9766/9766 transitions.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2 (NOT p3)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p3) (NOT p1) p2)), (G (OR (NOT p0) (NOT p3) (NOT p1) p2)), (G (AND (OR p0 p3 p2) (OR p0 p1))), (G (OR p0 (NOT p3) (NOT p1))), (G (OR p0 (NOT p3) (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p3) (NOT p1)))), (F (NOT (AND p0 p1 p2))), (F (NOT (OR (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p1))))), (F (NOT (AND (OR p0 p3) (OR p0 p1)))), (F (NOT (OR (NOT p3) (NOT p1)))), (F (NOT p0)), (F p3)]
Knowledge based reduction with 9 factoid took 473 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 251 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 3155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3155/3155 places, 7146/7146 transitions.
Applied a total of 0 rules in 285 ms. Remains 3155 /3155 variables (removed 0) and now considering 7146/7146 (removed 0) transitions.
[2024-05-24 23:04:48] [INFO ] Flow matrix only has 6546 transitions (discarded 600 similar events)
// Phase 1: matrix 6546 rows 3155 cols
[2024-05-24 23:04:48] [INFO ] Computed 62 invariants in 125 ms
[2024-05-24 23:04:52] [INFO ] Implicit Places using invariants in 4566 ms returned []
[2024-05-24 23:04:52] [INFO ] Flow matrix only has 6546 transitions (discarded 600 similar events)
[2024-05-24 23:04:52] [INFO ] Invariant cache hit.
[2024-05-24 23:04:55] [INFO ] State equation strengthened by 2627 read => feed constraints.
[2024-05-24 23:05:25] [INFO ] Performed 926/3155 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:05:58] [INFO ] Performed 1455/3155 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-24 23:06:28] [INFO ] Performed 1864/3155 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2024-05-24 23:06:58] [INFO ] Performed 2849/3155 implicitness test of which 0 returned IMPLICIT in 122 seconds.
[2024-05-24 23:06:58] [INFO ] Timeout of Implicit test with SMT after 122 seconds.
[2024-05-24 23:06:58] [INFO ] Implicit Places using invariants and state equation in 125285 ms returned []
Implicit Place search using SMT with State Equation took 129853 ms to find 0 implicit places.
Running 7121 sub problems to find dead transitions.
[2024-05-24 23:06:58] [INFO ] Flow matrix only has 6546 transitions (discarded 600 similar events)
[2024-05-24 23:06:58] [INFO ] Invariant cache hit.
[2024-05-24 23:06:58] [INFO ] State equation strengthened by 2627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3153 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7121 unsolved
SMT process timed out in 42961ms, After SMT, problems are : Problem set: 0 solved, 7121 unsolved
Search for dead transitions found 0 dead transitions in 43027ms
Finished structural reductions in LTL mode , in 1 iterations and 173189 ms. Remains : 3155/3155 places, 7146/7146 transitions.
Computed a total of 531 stabilizing places and 1945 stable transitions
Computed a total of 531 stabilizing places and 1945 stable transitions
Detected a total of 531/3155 stabilizing places and 1945/7146 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40000 steps (645 resets) in 511 ms. (78 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (120 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (120 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
[2024-05-24 23:07:41] [INFO ] Flow matrix only has 6546 transitions (discarded 600 similar events)
[2024-05-24 23:07:41] [INFO ] Invariant cache hit.
[2024-05-24 23:07:41] [INFO ] State equation strengthened by 2627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3033/3035 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3035 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/3062 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:07:44] [INFO ] Deduced a trap composed of 313 places in 2042 ms of which 20 ms to minimize.
[2024-05-24 23:07:46] [INFO ] Deduced a trap composed of 314 places in 2209 ms of which 20 ms to minimize.
[2024-05-24 23:07:48] [INFO ] Deduced a trap composed of 217 places in 2167 ms of which 21 ms to minimize.
SMT process timed out in 7126ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3155/3155 places, 7146/7146 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 3155 transition count 7122
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 3131 transition count 7122
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 3131 transition count 7110
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 3119 transition count 7110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 3118 transition count 7104
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 3118 transition count 7104
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 128 place count 3091 transition count 7077
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 3090 transition count 7076
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 3090 transition count 7076
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 3089 transition count 7070
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 3089 transition count 7070
Free-agglomeration rule (complex) applied 292 times.
Iterating global reduction 2 with 292 rules applied. Total rules applied 424 place count 3089 transition count 9763
Reduce places removed 292 places and 0 transitions.
Iterating post reduction 2 with 292 rules applied. Total rules applied 716 place count 2797 transition count 9763
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 717 place count 2797 transition count 9763
Applied a total of 717 rules in 2789 ms. Remains 2797 /3155 variables (removed 358) and now considering 9763/7146 (removed -2617) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2789 ms. Remains : 2797/3155 places, 9763/7146 transitions.
RANDOM walk for 40000 steps (1132 resets) in 1906 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (95 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 31953 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 2
Probabilistic random walk after 31953 steps, saw 13526 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-24 23:07:55] [INFO ] Flow matrix only has 8877 transitions (discarded 886 similar events)
// Phase 1: matrix 8877 rows 2797 cols
[2024-05-24 23:07:55] [INFO ] Computed 62 invariants in 178 ms
[2024-05-24 23:07:55] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2676/2678 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2678 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/2705 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:07:58] [INFO ] Deduced a trap composed of 97 places in 2106 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2705 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2705 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 38/2743 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2743 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/2785 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2785 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/2797 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2797 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8877/11674 variables, 2797/2860 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11674 variables, 5602/8462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11674 variables, 0/8462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/11674 variables, 0/8462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11674/11674 variables, and 8462 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7253 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 2797/2797 constraints, ReadFeed: 5602/5602 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2676/2678 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2678 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/2705 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2705 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2705 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/2743 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:08:05] [INFO ] Deduced a trap composed of 5 places in 2220 ms of which 18 ms to minimize.
[2024-05-24 23:08:08] [INFO ] Deduced a trap composed of 39 places in 2247 ms of which 18 ms to minimize.
[2024-05-24 23:08:10] [INFO ] Deduced a trap composed of 39 places in 2305 ms of which 18 ms to minimize.
[2024-05-24 23:08:12] [INFO ] Deduced a trap composed of 109 places in 2289 ms of which 18 ms to minimize.
[2024-05-24 23:08:14] [INFO ] Deduced a trap composed of 95 places in 2205 ms of which 18 ms to minimize.
[2024-05-24 23:08:17] [INFO ] Deduced a trap composed of 120 places in 2239 ms of which 18 ms to minimize.
[2024-05-24 23:08:19] [INFO ] Deduced a trap composed of 98 places in 2186 ms of which 17 ms to minimize.
[2024-05-24 23:08:21] [INFO ] Deduced a trap composed of 89 places in 2182 ms of which 17 ms to minimize.
[2024-05-24 23:08:23] [INFO ] Deduced a trap composed of 128 places in 2194 ms of which 18 ms to minimize.
[2024-05-24 23:08:26] [INFO ] Deduced a trap composed of 113 places in 2263 ms of which 16 ms to minimize.
[2024-05-24 23:08:28] [INFO ] Deduced a trap composed of 87 places in 2226 ms of which 18 ms to minimize.
[2024-05-24 23:08:30] [INFO ] Deduced a trap composed of 118 places in 2216 ms of which 18 ms to minimize.
[2024-05-24 23:08:32] [INFO ] Deduced a trap composed of 114 places in 2156 ms of which 18 ms to minimize.
[2024-05-24 23:08:35] [INFO ] Deduced a trap composed of 70 places in 2215 ms of which 19 ms to minimize.
[2024-05-24 23:08:37] [INFO ] Deduced a trap composed of 93 places in 2282 ms of which 18 ms to minimize.
[2024-05-24 23:08:39] [INFO ] Deduced a trap composed of 97 places in 2294 ms of which 18 ms to minimize.
[2024-05-24 23:08:42] [INFO ] Deduced a trap composed of 111 places in 2193 ms of which 17 ms to minimize.
[2024-05-24 23:08:44] [INFO ] Deduced a trap composed of 242 places in 2185 ms of which 18 ms to minimize.
[2024-05-24 23:08:46] [INFO ] Deduced a trap composed of 103 places in 2045 ms of which 18 ms to minimize.
[2024-05-24 23:08:48] [INFO ] Deduced a trap composed of 105 places in 2169 ms of which 18 ms to minimize.
SMT process timed out in 53179ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2797/2797 places, 9763/9763 transitions.
Applied a total of 0 rules in 480 ms. Remains 2797 /2797 variables (removed 0) and now considering 9763/9763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 2797/2797 places, 9763/9763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2797/2797 places, 9763/9763 transitions.
Applied a total of 0 rules in 471 ms. Remains 2797 /2797 variables (removed 0) and now considering 9763/9763 (removed 0) transitions.
[2024-05-24 23:08:49] [INFO ] Flow matrix only has 8877 transitions (discarded 886 similar events)
[2024-05-24 23:08:49] [INFO ] Invariant cache hit.
[2024-05-24 23:08:54] [INFO ] Implicit Places using invariants in 5189 ms returned [709]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5198 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2796/2797 places, 9763/9763 transitions.
Applied a total of 0 rules in 458 ms. Remains 2796 /2796 variables (removed 0) and now considering 9763/9763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6128 ms. Remains : 2796/2797 places, 9763/9763 transitions.
RANDOM walk for 40000 steps (1132 resets) in 2039 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (94 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 32367 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 2
Probabilistic random walk after 32367 steps, saw 13709 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-24 23:08:59] [INFO ] Flow matrix only has 8877 transitions (discarded 886 similar events)
// Phase 1: matrix 8877 rows 2796 cols
[2024-05-24 23:08:59] [INFO ] Computed 61 invariants in 168 ms
[2024-05-24 23:08:59] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2676/2678 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2678 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/2705 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:09:01] [INFO ] Deduced a trap composed of 98 places in 2105 ms of which 18 ms to minimize.
[2024-05-24 23:09:03] [INFO ] Deduced a trap composed of 134 places in 2079 ms of which 17 ms to minimize.
[2024-05-24 23:09:06] [INFO ] Deduced a trap composed of 208 places in 2083 ms of which 17 ms to minimize.
[2024-05-24 23:09:08] [INFO ] Deduced a trap composed of 170 places in 2114 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2705 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2705 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 37/2742 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:09:10] [INFO ] Deduced a trap composed of 5 places in 1951 ms of which 17 ms to minimize.
[2024-05-24 23:09:12] [INFO ] Deduced a trap composed of 170 places in 2042 ms of which 18 ms to minimize.
[2024-05-24 23:09:14] [INFO ] Deduced a trap composed of 39 places in 2082 ms of which 17 ms to minimize.
[2024-05-24 23:09:16] [INFO ] Deduced a trap composed of 199 places in 2082 ms of which 19 ms to minimize.
[2024-05-24 23:09:18] [INFO ] Deduced a trap composed of 193 places in 1995 ms of which 16 ms to minimize.
[2024-05-24 23:09:20] [INFO ] Deduced a trap composed of 70 places in 2034 ms of which 18 ms to minimize.
[2024-05-24 23:09:23] [INFO ] Deduced a trap composed of 188 places in 2025 ms of which 18 ms to minimize.
[2024-05-24 23:09:25] [INFO ] Deduced a trap composed of 98 places in 2040 ms of which 18 ms to minimize.
[2024-05-24 23:09:27] [INFO ] Deduced a trap composed of 231 places in 2092 ms of which 18 ms to minimize.
[2024-05-24 23:09:29] [INFO ] Deduced a trap composed of 214 places in 2135 ms of which 18 ms to minimize.
[2024-05-24 23:09:31] [INFO ] Deduced a trap composed of 187 places in 2040 ms of which 19 ms to minimize.
[2024-05-24 23:09:33] [INFO ] Deduced a trap composed of 104 places in 2219 ms of which 18 ms to minimize.
[2024-05-24 23:09:35] [INFO ] Deduced a trap composed of 123 places in 2015 ms of which 18 ms to minimize.
[2024-05-24 23:09:37] [INFO ] Deduced a trap composed of 123 places in 1977 ms of which 17 ms to minimize.
[2024-05-24 23:09:39] [INFO ] Deduced a trap composed of 70 places in 2044 ms of which 18 ms to minimize.
[2024-05-24 23:09:42] [INFO ] Deduced a trap composed of 226 places in 2060 ms of which 18 ms to minimize.
[2024-05-24 23:09:43] [INFO ] Deduced a trap composed of 200 places in 1856 ms of which 18 ms to minimize.
[2024-05-24 23:09:45] [INFO ] Deduced a trap composed of 197 places in 1829 ms of which 18 ms to minimize.
[2024-05-24 23:09:47] [INFO ] Deduced a trap composed of 211 places in 1908 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2742 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2742 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 42/2784 variables, 42/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:09:50] [INFO ] Deduced a trap composed of 260 places in 2059 ms of which 18 ms to minimize.
[2024-05-24 23:09:52] [INFO ] Deduced a trap composed of 125 places in 2272 ms of which 18 ms to minimize.
[2024-05-24 23:09:54] [INFO ] Deduced a trap composed of 119 places in 2254 ms of which 18 ms to minimize.
[2024-05-24 23:09:57] [INFO ] Deduced a trap composed of 120 places in 2187 ms of which 17 ms to minimize.
[2024-05-24 23:09:59] [INFO ] Deduced a trap composed of 96 places in 2230 ms of which 21 ms to minimize.
[2024-05-24 23:10:01] [INFO ] Deduced a trap composed of 124 places in 2252 ms of which 19 ms to minimize.
[2024-05-24 23:10:03] [INFO ] Deduced a trap composed of 123 places in 2261 ms of which 19 ms to minimize.
[2024-05-24 23:10:06] [INFO ] Deduced a trap composed of 133 places in 2255 ms of which 18 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2784 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2784 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/2796 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2796 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11673/11673 variables, and 2888 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75030 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2796/2796 constraints, ReadFeed: 0/5602 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2676/2678 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2678 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/2705 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2705 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:10:16] [INFO ] Deduced a trap composed of 177 places in 2125 ms of which 17 ms to minimize.
[2024-05-24 23:10:19] [INFO ] Deduced a trap composed of 243 places in 2110 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2705 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2705 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/2742 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2742 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:10:21] [INFO ] Deduced a trap composed of 196 places in 1949 ms of which 16 ms to minimize.
[2024-05-24 23:10:23] [INFO ] Deduced a trap composed of 197 places in 1892 ms of which 17 ms to minimize.
[2024-05-24 23:10:25] [INFO ] Deduced a trap composed of 197 places in 1949 ms of which 17 ms to minimize.
[2024-05-24 23:10:27] [INFO ] Deduced a trap composed of 199 places in 2002 ms of which 18 ms to minimize.
[2024-05-24 23:10:29] [INFO ] Deduced a trap composed of 226 places in 1981 ms of which 17 ms to minimize.
[2024-05-24 23:10:31] [INFO ] Deduced a trap composed of 198 places in 2013 ms of which 18 ms to minimize.
[2024-05-24 23:10:33] [INFO ] Deduced a trap composed of 197 places in 1897 ms of which 17 ms to minimize.
[2024-05-24 23:10:35] [INFO ] Deduced a trap composed of 201 places in 1929 ms of which 18 ms to minimize.
[2024-05-24 23:10:37] [INFO ] Deduced a trap composed of 197 places in 1943 ms of which 18 ms to minimize.
[2024-05-24 23:10:39] [INFO ] Deduced a trap composed of 201 places in 1964 ms of which 18 ms to minimize.
[2024-05-24 23:10:41] [INFO ] Deduced a trap composed of 200 places in 1933 ms of which 15 ms to minimize.
[2024-05-24 23:10:43] [INFO ] Deduced a trap composed of 198 places in 1989 ms of which 18 ms to minimize.
[2024-05-24 23:10:45] [INFO ] Deduced a trap composed of 199 places in 1897 ms of which 17 ms to minimize.
[2024-05-24 23:10:47] [INFO ] Deduced a trap composed of 198 places in 1985 ms of which 17 ms to minimize.
[2024-05-24 23:10:49] [INFO ] Deduced a trap composed of 222 places in 1994 ms of which 17 ms to minimize.
[2024-05-24 23:10:51] [INFO ] Deduced a trap composed of 202 places in 1920 ms of which 19 ms to minimize.
[2024-05-24 23:10:53] [INFO ] Deduced a trap composed of 202 places in 1963 ms of which 18 ms to minimize.
[2024-05-24 23:10:55] [INFO ] Deduced a trap composed of 199 places in 1963 ms of which 17 ms to minimize.
[2024-05-24 23:10:57] [INFO ] Deduced a trap composed of 197 places in 1884 ms of which 17 ms to minimize.
[2024-05-24 23:10:59] [INFO ] Deduced a trap composed of 200 places in 1956 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2742 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:11:01] [INFO ] Deduced a trap composed of 197 places in 1902 ms of which 18 ms to minimize.
[2024-05-24 23:11:03] [INFO ] Deduced a trap composed of 195 places in 1990 ms of which 18 ms to minimize.
[2024-05-24 23:11:05] [INFO ] Deduced a trap composed of 194 places in 1864 ms of which 17 ms to minimize.
[2024-05-24 23:11:06] [INFO ] Deduced a trap composed of 200 places in 1892 ms of which 18 ms to minimize.
[2024-05-24 23:11:08] [INFO ] Deduced a trap composed of 196 places in 1899 ms of which 18 ms to minimize.
[2024-05-24 23:11:10] [INFO ] Deduced a trap composed of 204 places in 1964 ms of which 17 ms to minimize.
[2024-05-24 23:11:12] [INFO ] Deduced a trap composed of 199 places in 1939 ms of which 18 ms to minimize.
[2024-05-24 23:11:14] [INFO ] Deduced a trap composed of 201 places in 1940 ms of which 18 ms to minimize.
[2024-05-24 23:11:16] [INFO ] Deduced a trap composed of 202 places in 2005 ms of which 18 ms to minimize.
[2024-05-24 23:11:18] [INFO ] Deduced a trap composed of 195 places in 1903 ms of which 17 ms to minimize.
[2024-05-24 23:11:20] [INFO ] Deduced a trap composed of 192 places in 1955 ms of which 16 ms to minimize.
[2024-05-24 23:11:22] [INFO ] Deduced a trap composed of 199 places in 2057 ms of which 18 ms to minimize.
[2024-05-24 23:11:25] [INFO ] Deduced a trap composed of 227 places in 2110 ms of which 18 ms to minimize.
[2024-05-24 23:11:27] [INFO ] Deduced a trap composed of 203 places in 2038 ms of which 18 ms to minimize.
[2024-05-24 23:11:29] [INFO ] Deduced a trap composed of 197 places in 1939 ms of which 17 ms to minimize.
[2024-05-24 23:11:31] [INFO ] Deduced a trap composed of 202 places in 1941 ms of which 17 ms to minimize.
SMT process timed out in 152166ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2796/2796 places, 9763/9763 transitions.
Applied a total of 0 rules in 496 ms. Remains 2796 /2796 variables (removed 0) and now considering 9763/9763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 2796/2796 places, 9763/9763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2796/2796 places, 9763/9763 transitions.
Applied a total of 0 rules in 472 ms. Remains 2796 /2796 variables (removed 0) and now considering 9763/9763 (removed 0) transitions.
[2024-05-24 23:11:32] [INFO ] Flow matrix only has 8877 transitions (discarded 886 similar events)
[2024-05-24 23:11:32] [INFO ] Invariant cache hit.
[2024-05-24 23:11:37] [INFO ] Implicit Places using invariants in 5135 ms returned []
[2024-05-24 23:11:37] [INFO ] Flow matrix only has 8877 transitions (discarded 886 similar events)
[2024-05-24 23:11:37] [INFO ] Invariant cache hit.
[2024-05-24 23:11:40] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:12:11] [INFO ] Performed 290/2796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:12:42] [INFO ] Performed 704/2796 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-24 23:13:12] [INFO ] Performed 1059/2796 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2024-05-24 23:13:45] [INFO ] Performed 1230/2796 implicitness test of which 0 returned IMPLICIT in 124 seconds.
[2024-05-24 23:13:45] [INFO ] Timeout of Implicit test with SMT after 124 seconds.
[2024-05-24 23:13:45] [INFO ] Implicit Places using invariants and state equation in 127837 ms returned []
Implicit Place search using SMT with State Equation took 132973 ms to find 0 implicit places.
[2024-05-24 23:13:46] [INFO ] Redundant transitions in 1332 ms returned []
Running 9669 sub problems to find dead transitions.
[2024-05-24 23:13:46] [INFO ] Flow matrix only has 8877 transitions (discarded 886 similar events)
[2024-05-24 23:13:46] [INFO ] Invariant cache hit.
[2024-05-24 23:13:46] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2794 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9669 unsolved
SMT process timed out in 88954ms, After SMT, problems are : Problem set: 0 solved, 9669 unsolved
Search for dead transitions found 0 dead transitions in 89036ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223847 ms. Remains : 2796/2796 places, 9763/9763 transitions.
Knowledge obtained : [(AND p1 p2 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1 p2)))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 286 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 328 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 1618 reset in 788 ms.
Product exploration explored 100000 steps with 1618 reset in 828 ms.
Applying partial POR strategy [true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 273 ms :[true, (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 3155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3155/3155 places, 7146/7146 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 3155 transition count 7146
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 23 place count 3155 transition count 7147
Deduced a syphon composed of 35 places in 4 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 35 place count 3155 transition count 7147
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 3143 transition count 7130
Deduced a syphon composed of 24 places in 3 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 3143 transition count 7130
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 51 places in 4 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 86 place count 3143 transition count 7130
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 3141 transition count 7128
Deduced a syphon composed of 49 places in 3 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 3141 transition count 7128
Deduced a syphon composed of 49 places in 4 ms
Applied a total of 90 rules in 2502 ms. Remains 3141 /3155 variables (removed 14) and now considering 7128/7146 (removed 18) transitions.
[2024-05-24 23:15:22] [INFO ] Redundant transitions in 773 ms returned []
Running 7103 sub problems to find dead transitions.
[2024-05-24 23:15:22] [INFO ] Flow matrix only has 6528 transitions (discarded 600 similar events)
// Phase 1: matrix 6528 rows 3141 cols
[2024-05-24 23:15:22] [INFO ] Computed 62 invariants in 125 ms
[2024-05-24 23:15:22] [INFO ] State equation strengthened by 2622 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3139 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7103 unsolved
SMT process timed out in 45148ms, After SMT, problems are : Problem set: 0 solved, 7103 unsolved
Search for dead transitions found 0 dead transitions in 45208ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3141/3155 places, 7128/7146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48506 ms. Remains : 3141/3155 places, 7128/7146 transitions.
Built C files in :
/tmp/ltsmin7870156159804362382
[2024-05-24 23:16:07] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7870156159804362382
Running compilation step : cd /tmp/ltsmin7870156159804362382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7870156159804362382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7870156159804362382;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 3155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3155/3155 places, 7146/7146 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3154 transition count 7140
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3154 transition count 7140
Applied a total of 2 rules in 731 ms. Remains 3154 /3155 variables (removed 1) and now considering 7140/7146 (removed 6) transitions.
[2024-05-24 23:16:11] [INFO ] Flow matrix only has 6540 transitions (discarded 600 similar events)
// Phase 1: matrix 6540 rows 3154 cols
[2024-05-24 23:16:11] [INFO ] Computed 62 invariants in 145 ms
[2024-05-24 23:16:15] [INFO ] Implicit Places using invariants in 4440 ms returned []
[2024-05-24 23:16:15] [INFO ] Flow matrix only has 6540 transitions (discarded 600 similar events)
[2024-05-24 23:16:15] [INFO ] Invariant cache hit.
[2024-05-24 23:16:18] [INFO ] State equation strengthened by 2622 read => feed constraints.
[2024-05-24 23:16:49] [INFO ] Performed 1043/3154 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:17:19] [INFO ] Performed 1621/3154 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:17:49] [INFO ] Performed 2464/3154 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 23:18:05] [INFO ] Implicit Places using invariants and state equation in 110232 ms returned [3139]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 114677 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3153/3155 places, 7140/7146 transitions.
Applied a total of 0 rules in 366 ms. Remains 3153 /3153 variables (removed 0) and now considering 7140/7140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115775 ms. Remains : 3153/3155 places, 7140/7146 transitions.
Built C files in :
/tmp/ltsmin13265823912452723821
[2024-05-24 23:18:06] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13265823912452723821
Running compilation step : cd /tmp/ltsmin13265823912452723821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13265823912452723821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13265823912452723821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 23:18:09] [INFO ] Flatten gal took : 215 ms
[2024-05-24 23:18:10] [INFO ] Flatten gal took : 197 ms
[2024-05-24 23:18:10] [INFO ] Time to serialize gal into /tmp/LTL9982884666650119340.gal : 65 ms
[2024-05-24 23:18:10] [INFO ] Time to serialize properties into /tmp/LTL6537505235490740195.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9982884666650119340.gal' '-t' 'CGAL' '-hoa' '/tmp/aut143386576702193952.hoa' '-atoms' '/tmp/LTL6537505235490740195.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL6537505235490740195.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut143386576702193952.hoa
Detected timeout of ITS tools.
[2024-05-24 23:18:25] [INFO ] Flatten gal took : 218 ms
[2024-05-24 23:18:25] [INFO ] Flatten gal took : 173 ms
[2024-05-24 23:18:25] [INFO ] Time to serialize gal into /tmp/LTL3455016208610514176.gal : 30 ms
[2024-05-24 23:18:25] [INFO ] Time to serialize properties into /tmp/LTL9187888853943289047.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3455016208610514176.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9187888853943289047.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G("(Node3HasTheLeafSetOfLx2ToReplaceNode7<1)")))||(G(("((Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14<1)||(Node15Notif...369
Formula 0 simplified : XX(XF!"(Node3HasTheLeafSetOfLx2ToReplaceNode7<1)" & F(!"((Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14<1)||(Node15NotifyThatHe...351
Detected timeout of ITS tools.
[2024-05-24 23:18:40] [INFO ] Flatten gal took : 174 ms
[2024-05-24 23:18:40] [INFO ] Applying decomposition
[2024-05-24 23:18:41] [INFO ] Flatten gal took : 179 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16471882847127128376.txt' '-o' '/tmp/graph16471882847127128376.bin' '-w' '/tmp/graph16471882847127128376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16471882847127128376.bin' '-l' '-1' '-v' '-w' '/tmp/graph16471882847127128376.weights' '-q' '0' '-e' '0.001'
[2024-05-24 23:18:41] [INFO ] Decomposing Gal with order
[2024-05-24 23:18:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 23:18:42] [INFO ] Removed a total of 5674 redundant transitions.
[2024-05-24 23:18:42] [INFO ] Flatten gal took : 792 ms
[2024-05-24 23:18:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4552 labels/synchronizations in 415 ms.
[2024-05-24 23:18:43] [INFO ] Time to serialize gal into /tmp/LTL11688024762841254390.gal : 63 ms
[2024-05-24 23:18:43] [INFO ] Time to serialize properties into /tmp/LTL2579717333538518481.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11688024762841254390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2579717333538518481.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((X(G("(i31.i5.u92.Node3HasTheLeafSetOfLx2ToReplaceNode7<1)")))||(G(("((i20.i2.u156.Node7ThinksNode15ShouldBeNodeMasterToReplace...446
Formula 0 simplified : XX(XF!"(i31.i5.u92.Node3HasTheLeafSetOfLx2ToReplaceNode7<1)" & F(!"((i20.i2.u156.Node7ThinksNode15ShouldBeNodeMasterToReplaceNode14<...428
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-00 finished in 1181845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 7389/7389 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 3260 transition count 7367
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 3238 transition count 7367
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 44 place count 3238 transition count 7345
Deduced a syphon composed of 22 places in 4 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 88 place count 3216 transition count 7345
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 103 place count 3201 transition count 7305
Iterating global reduction 2 with 15 rules applied. Total rules applied 118 place count 3201 transition count 7305
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 118 place count 3201 transition count 7302
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 3198 transition count 7302
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 134 place count 3188 transition count 7242
Iterating global reduction 2 with 10 rules applied. Total rules applied 144 place count 3188 transition count 7242
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 210 place count 3155 transition count 7209
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 215 place count 3150 transition count 7204
Iterating global reduction 2 with 5 rules applied. Total rules applied 220 place count 3150 transition count 7204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 225 place count 3145 transition count 7174
Iterating global reduction 2 with 5 rules applied. Total rules applied 230 place count 3145 transition count 7174
Applied a total of 230 rules in 2875 ms. Remains 3145 /3260 variables (removed 115) and now considering 7174/7389 (removed 215) transitions.
[2024-05-24 23:19:01] [INFO ] Flow matrix only has 6574 transitions (discarded 600 similar events)
// Phase 1: matrix 6574 rows 3145 cols
[2024-05-24 23:19:01] [INFO ] Computed 79 invariants in 151 ms
[2024-05-24 23:19:06] [INFO ] Implicit Places using invariants in 4833 ms returned [97, 310, 778, 955, 1171, 1217, 1308, 1354, 1384, 1483, 1513, 1521, 1535, 1567, 1600, 2684, 2685, 2960]
[2024-05-24 23:19:06] [INFO ] Actually due to overlaps returned [310, 1513, 778, 955, 1171, 1217, 1354, 1384, 1483, 1521, 1535, 1567, 1600, 2684, 2685, 2960]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 4839 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3129/3260 places, 7174/7389 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3119 transition count 7164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3119 transition count 7164
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 3109 transition count 7154
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 3109 transition count 7154
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 3100 transition count 7100
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 3100 transition count 7100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 3096 transition count 7096
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3092 transition count 7092
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3092 transition count 7092
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 3088 transition count 7068
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 3088 transition count 7068
Applied a total of 82 rules in 3191 ms. Remains 3088 /3129 variables (removed 41) and now considering 7068/7174 (removed 106) transitions.
[2024-05-24 23:19:09] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
// Phase 1: matrix 6468 rows 3088 cols
[2024-05-24 23:19:09] [INFO ] Computed 63 invariants in 124 ms
[2024-05-24 23:19:14] [INFO ] Implicit Places using invariants in 4557 ms returned [97, 1295]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4565 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3086/3260 places, 7068/7389 transitions.
Applied a total of 0 rules in 545 ms. Remains 3086 /3086 variables (removed 0) and now considering 7068/7068 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 16017 ms. Remains : 3086/3260 places, 7068/7389 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-01
Product exploration explored 100000 steps with 2294 reset in 952 ms.
Product exploration explored 100000 steps with 2296 reset in 998 ms.
Computed a total of 487 stabilizing places and 1892 stable transitions
Computed a total of 487 stabilizing places and 1892 stable transitions
Detected a total of 487/3086 stabilizing places and 1892/7068 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 97 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 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33800 steps (774 resets) in 460 ms. (73 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 130 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 143 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 3086 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3086/3086 places, 7068/7068 transitions.
Applied a total of 0 rules in 521 ms. Remains 3086 /3086 variables (removed 0) and now considering 7068/7068 (removed 0) transitions.
[2024-05-24 23:19:17] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
// Phase 1: matrix 6468 rows 3086 cols
[2024-05-24 23:19:18] [INFO ] Computed 61 invariants in 147 ms
[2024-05-24 23:19:22] [INFO ] Implicit Places using invariants in 4612 ms returned []
[2024-05-24 23:19:22] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
[2024-05-24 23:19:22] [INFO ] Invariant cache hit.
[2024-05-24 23:19:25] [INFO ] State equation strengthened by 2617 read => feed constraints.
[2024-05-24 23:19:55] [INFO ] Performed 1201/3086 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:20:25] [INFO ] Performed 1909/3086 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:20:55] [INFO ] Performed 3069/3086 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 23:20:56] [INFO ] Implicit Places using invariants and state equation in 94058 ms returned [3079]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98675 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3085/3086 places, 7068/7068 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3085 transition count 7067
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3084 transition count 7067
Applied a total of 2 rules in 541 ms. Remains 3084 /3085 variables (removed 1) and now considering 7067/7068 (removed 1) transitions.
[2024-05-24 23:20:57] [INFO ] Flow matrix only has 6467 transitions (discarded 600 similar events)
// Phase 1: matrix 6467 rows 3084 cols
[2024-05-24 23:20:57] [INFO ] Computed 60 invariants in 318 ms
[2024-05-24 23:21:01] [INFO ] Implicit Places using invariants in 4727 ms returned []
[2024-05-24 23:21:01] [INFO ] Flow matrix only has 6467 transitions (discarded 600 similar events)
[2024-05-24 23:21:01] [INFO ] Invariant cache hit.
[2024-05-24 23:21:05] [INFO ] State equation strengthened by 2617 read => feed constraints.
[2024-05-24 23:21:35] [INFO ] Performed 1160/3084 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:22:05] [INFO ] Performed 1982/3084 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:22:30] [INFO ] Implicit Places using invariants and state equation in 88195 ms returned []
Implicit Place search using SMT with State Equation took 92923 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3084/3086 places, 7067/7068 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192660 ms. Remains : 3084/3086 places, 7067/7068 transitions.
Computed a total of 485 stabilizing places and 1891 stable transitions
Computed a total of 485 stabilizing places and 1891 stable transitions
Detected a total of 485/3084 stabilizing places and 1891/7067 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 66 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 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 36303 steps (831 resets) in 469 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 138 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2297 reset in 963 ms.
Product exploration explored 100000 steps with 2297 reset in 951 ms.
Built C files in :
/tmp/ltsmin9837665008441126846
[2024-05-24 23:22:32] [INFO ] Too many transitions (7067) to apply POR reductions. Disabling POR matrices.
[2024-05-24 23:22:32] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9837665008441126846
Running compilation step : cd /tmp/ltsmin9837665008441126846;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9837665008441126846;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9837665008441126846;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 3084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3084/3084 places, 7067/7067 transitions.
Applied a total of 0 rules in 511 ms. Remains 3084 /3084 variables (removed 0) and now considering 7067/7067 (removed 0) transitions.
[2024-05-24 23:22:36] [INFO ] Flow matrix only has 6467 transitions (discarded 600 similar events)
[2024-05-24 23:22:36] [INFO ] Invariant cache hit.
[2024-05-24 23:22:40] [INFO ] Implicit Places using invariants in 4430 ms returned []
[2024-05-24 23:22:40] [INFO ] Flow matrix only has 6467 transitions (discarded 600 similar events)
[2024-05-24 23:22:40] [INFO ] Invariant cache hit.
[2024-05-24 23:22:44] [INFO ] State equation strengthened by 2617 read => feed constraints.
[2024-05-24 23:23:14] [INFO ] Performed 1200/3084 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:23:45] [INFO ] Performed 1983/3084 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-24 23:24:07] [INFO ] Implicit Places using invariants and state equation in 87091 ms returned []
Implicit Place search using SMT with State Equation took 91523 ms to find 0 implicit places.
[2024-05-24 23:24:08] [INFO ] Redundant transitions in 555 ms returned []
Running 7042 sub problems to find dead transitions.
[2024-05-24 23:24:08] [INFO ] Flow matrix only has 6467 transitions (discarded 600 similar events)
[2024-05-24 23:24:08] [INFO ] Invariant cache hit.
[2024-05-24 23:24:08] [INFO ] State equation strengthened by 2617 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3082 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7042 unsolved
SMT process timed out in 44843ms, After SMT, problems are : Problem set: 0 solved, 7042 unsolved
Search for dead transitions found 0 dead transitions in 44905ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 137520 ms. Remains : 3084/3084 places, 7067/7067 transitions.
Built C files in :
/tmp/ltsmin9305201997716566901
[2024-05-24 23:24:53] [INFO ] Too many transitions (7067) to apply POR reductions. Disabling POR matrices.
[2024-05-24 23:24:53] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9305201997716566901
Running compilation step : cd /tmp/ltsmin9305201997716566901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9305201997716566901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9305201997716566901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 23:24:56] [INFO ] Flatten gal took : 153 ms
[2024-05-24 23:24:56] [INFO ] Flatten gal took : 160 ms
[2024-05-24 23:24:56] [INFO ] Time to serialize gal into /tmp/LTL5843186807417360317.gal : 29 ms
[2024-05-24 23:24:56] [INFO ] Time to serialize properties into /tmp/LTL18327719216618971780.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5843186807417360317.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14331840637971377430.hoa' '-atoms' '/tmp/LTL18327719216618971780.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18327719216618971780.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14331840637971377430.hoa
Detected timeout of ITS tools.
[2024-05-24 23:25:12] [INFO ] Flatten gal took : 145 ms
[2024-05-24 23:25:12] [INFO ] Flatten gal took : 155 ms
[2024-05-24 23:25:12] [INFO ] Time to serialize gal into /tmp/LTL13118772291472957446.gal : 27 ms
[2024-05-24 23:25:12] [INFO ] Time to serialize properties into /tmp/LTL5318481203647082043.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13118772291472957446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5318481203647082043.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((Node18ManageTheCrashOfNode8<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"))))
Formula 0 simplified : FG!"((Node18ManageTheCrashOfNode8<1)||(Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
[2024-05-24 23:25:27] [INFO ] Flatten gal took : 136 ms
[2024-05-24 23:25:27] [INFO ] Applying decomposition
[2024-05-24 23:25:27] [INFO ] Flatten gal took : 145 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3151755512853534883.txt' '-o' '/tmp/graph3151755512853534883.bin' '-w' '/tmp/graph3151755512853534883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3151755512853534883.bin' '-l' '-1' '-v' '-w' '/tmp/graph3151755512853534883.weights' '-q' '0' '-e' '0.001'
[2024-05-24 23:25:27] [INFO ] Decomposing Gal with order
[2024-05-24 23:25:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 23:25:29] [INFO ] Removed a total of 6588 redundant transitions.
[2024-05-24 23:25:29] [INFO ] Flatten gal took : 848 ms
[2024-05-24 23:25:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 3507 labels/synchronizations in 362 ms.
[2024-05-24 23:25:29] [INFO ] Time to serialize gal into /tmp/LTL6681418723741257607.gal : 47 ms
[2024-05-24 23:25:29] [INFO ] Time to serialize properties into /tmp/LTL4211375420910763220.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6681418723741257607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4211375420910763220.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i34.u324.Node18ManageTheCrashOfNode8<1)||(i34.u327.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"))))
Formula 0 simplified : FG!"((i34.u324.Node18ManageTheCrashOfNode8<1)||(i34.u327.Lx2IsAtTheLeftExtremityOfTheLeafSet<1))"
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-01 finished in 406093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((!p0||(p1 U G(p2)))))) U G(!p2)))'
Support contains 8 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 7389/7389 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3241 transition count 7340
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 3241 transition count 7340
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 3228 transition count 7287
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 3228 transition count 7287
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 3223 transition count 7257
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 3223 transition count 7257
Applied a total of 74 rules in 1728 ms. Remains 3223 /3260 variables (removed 37) and now considering 7257/7389 (removed 132) transitions.
[2024-05-24 23:25:46] [INFO ] Flow matrix only has 6657 transitions (discarded 600 similar events)
// Phase 1: matrix 6657 rows 3223 cols
[2024-05-24 23:25:46] [INFO ] Computed 79 invariants in 126 ms
[2024-05-24 23:25:50] [INFO ] Implicit Places using invariants in 4381 ms returned [335, 806, 1205, 1253, 1346, 1392, 1424, 1526, 1566, 1580, 1615, 1650, 2744, 3025]
[2024-05-24 23:25:50] [INFO ] Actually due to overlaps returned [335, 806, 1205, 1253, 1392, 1424, 1526, 1566, 1580, 1615, 1650, 2744, 3025]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 4387 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3210/3260 places, 7257/7389 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3198 transition count 7245
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3198 transition count 7245
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 3186 transition count 7233
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 3186 transition count 7233
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 3174 transition count 7221
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 3174 transition count 7221
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 3163 transition count 7155
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 3163 transition count 7155
Applied a total of 94 rules in 2061 ms. Remains 3163 /3210 variables (removed 47) and now considering 7155/7257 (removed 102) transitions.
[2024-05-24 23:25:52] [INFO ] Flow matrix only has 6555 transitions (discarded 600 similar events)
// Phase 1: matrix 6555 rows 3163 cols
[2024-05-24 23:25:53] [INFO ] Computed 66 invariants in 155 ms
[2024-05-24 23:25:57] [INFO ] Implicit Places using invariants in 4369 ms returned [1333]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4380 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3162/3260 places, 7155/7389 transitions.
Applied a total of 0 rules in 373 ms. Remains 3162 /3162 variables (removed 0) and now considering 7155/7155 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12929 ms. Remains : 3162/3260 places, 7155/7389 transitions.
Stuttering acceptance computed with spot in 340 ms :[p2, (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), true, (NOT p2), (NOT p2), false, p2, false]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-02
Product exploration explored 100000 steps with 24766 reset in 1517 ms.
Product exploration explored 100000 steps with 24743 reset in 1559 ms.
Computed a total of 538 stabilizing places and 1954 stable transitions
Computed a total of 538 stabilizing places and 1954 stable transitions
Detected a total of 538/3162 stabilizing places and 1954/7155 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 407 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[p2, (AND p0 (NOT p2)), false, (AND p0 (NOT p2)), true, (NOT p2), (NOT p2), false, p2, false]
RANDOM walk for 40000 steps (647 resets) in 838 ms. (47 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40002 steps (120 resets) in 690 ms. (57 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (120 resets) in 662 ms. (60 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (120 resets) in 587 ms. (68 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (120 resets) in 602 ms. (66 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (120 resets) in 502 ms. (79 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (120 resets) in 460 ms. (86 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (120 resets) in 655 ms. (60 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (120 resets) in 527 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (120 resets) in 666 ms. (59 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (120 resets) in 627 ms. (63 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (120 resets) in 530 ms. (75 steps per ms) remains 11/11 properties
[2024-05-24 23:26:04] [INFO ] Flow matrix only has 6555 transitions (discarded 600 similar events)
// Phase 1: matrix 6555 rows 3162 cols
[2024-05-24 23:26:04] [INFO ] Computed 65 invariants in 133 ms
[2024-05-24 23:26:04] [INFO ] State equation strengthened by 2632 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem apf0 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf15 is UNSAT
At refinement iteration 1 (OVERLAPS) 2760/2768 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2768 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 250/3018 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3018 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 88/3106 variables, 6/9 constraints. Problems are: Problem set: 6 solved, 5 unsolved
[2024-05-24 23:26:07] [INFO ] Deduced a trap composed of 549 places in 2315 ms of which 21 ms to minimize.
[2024-05-24 23:26:09] [INFO ] Deduced a trap composed of 129 places in 2218 ms of which 20 ms to minimize.
SMT process timed out in 5690ms, After SMT, problems are : Problem set: 6 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 3162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3162/3162 places, 7155/7155 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 3162 transition count 7133
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 3140 transition count 7133
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 44 place count 3140 transition count 7121
Deduced a syphon composed of 12 places in 8 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 68 place count 3128 transition count 7121
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 122 place count 3101 transition count 7094
Free-agglomeration rule (complex) applied 288 times.
Iterating global reduction 2 with 288 rules applied. Total rules applied 410 place count 3101 transition count 6806
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 2 with 288 rules applied. Total rules applied 698 place count 2813 transition count 6806
Applied a total of 698 rules in 1494 ms. Remains 2813 /3162 variables (removed 349) and now considering 6806/7155 (removed 349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1494 ms. Remains : 2813/3162 places, 6806/7155 transitions.
RANDOM walk for 40000 steps (968 resets) in 2179 ms. (18 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (91 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (92 resets) in 248 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (93 resets) in 252 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (93 resets) in 263 ms. (151 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (89 resets) in 226 ms. (176 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 33001 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 5
Probabilistic random walk after 33001 steps, saw 13998 distinct states, run finished after 3002 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-24 23:26:15] [INFO ] Flow matrix only has 5921 transitions (discarded 885 similar events)
// Phase 1: matrix 5921 rows 2813 cols
[2024-05-24 23:26:15] [INFO ] Computed 65 invariants in 203 ms
[2024-05-24 23:26:15] [INFO ] State equation strengthened by 2632 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2684/2692 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2692 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 25/2717 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2717 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 40/2757 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2757 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 44/2801 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 12/2813 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2813 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 5921/8734 variables, 2813/2878 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/8734 variables, 2632/5510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/8734 variables, 0/5510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/8734 variables, 0/5510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8734/8734 variables, and 5510 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6175 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 2813/2813 constraints, ReadFeed: 2632/2632 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2684/2692 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2692 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 25/2717 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2717 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 40/2757 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 23:26:24] [INFO ] Deduced a trap composed of 5 places in 1693 ms of which 17 ms to minimize.
[2024-05-24 23:26:26] [INFO ] Deduced a trap composed of 147 places in 1768 ms of which 18 ms to minimize.
[2024-05-24 23:26:27] [INFO ] Deduced a trap composed of 140 places in 1763 ms of which 16 ms to minimize.
[2024-05-24 23:26:29] [INFO ] Deduced a trap composed of 165 places in 1643 ms of which 17 ms to minimize.
[2024-05-24 23:26:31] [INFO ] Deduced a trap composed of 166 places in 1750 ms of which 19 ms to minimize.
[2024-05-24 23:26:33] [INFO ] Deduced a trap composed of 166 places in 1773 ms of which 18 ms to minimize.
[2024-05-24 23:26:35] [INFO ] Deduced a trap composed of 163 places in 1770 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2757 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2757 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 44/2801 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2801 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 12/2813 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 23:26:38] [INFO ] Deduced a trap composed of 189 places in 2009 ms of which 18 ms to minimize.
[2024-05-24 23:26:39] [INFO ] Deduced a trap composed of 172 places in 1776 ms of which 18 ms to minimize.
[2024-05-24 23:26:41] [INFO ] Deduced a trap composed of 192 places in 1863 ms of which 17 ms to minimize.
[2024-05-24 23:26:43] [INFO ] Deduced a trap composed of 175 places in 1802 ms of which 18 ms to minimize.
[2024-05-24 23:26:45] [INFO ] Deduced a trap composed of 176 places in 1768 ms of which 19 ms to minimize.
[2024-05-24 23:26:47] [INFO ] Deduced a trap composed of 91 places in 1925 ms of which 17 ms to minimize.
[2024-05-24 23:26:49] [INFO ] Deduced a trap composed of 91 places in 1932 ms of which 18 ms to minimize.
[2024-05-24 23:26:51] [INFO ] Deduced a trap composed of 173 places in 1879 ms of which 18 ms to minimize.
[2024-05-24 23:26:53] [INFO ] Deduced a trap composed of 171 places in 1956 ms of which 18 ms to minimize.
[2024-05-24 23:26:55] [INFO ] Deduced a trap composed of 104 places in 1956 ms of which 18 ms to minimize.
[2024-05-24 23:26:57] [INFO ] Deduced a trap composed of 166 places in 1936 ms of which 18 ms to minimize.
[2024-05-24 23:26:59] [INFO ] Deduced a trap composed of 92 places in 2006 ms of which 18 ms to minimize.
[2024-05-24 23:27:01] [INFO ] Deduced a trap composed of 103 places in 1862 ms of which 18 ms to minimize.
[2024-05-24 23:27:03] [INFO ] Deduced a trap composed of 100 places in 1972 ms of which 18 ms to minimize.
[2024-05-24 23:27:05] [INFO ] Deduced a trap composed of 109 places in 1984 ms of which 17 ms to minimize.
[2024-05-24 23:27:07] [INFO ] Deduced a trap composed of 196 places in 1777 ms of which 18 ms to minimize.
SMT process timed out in 51908ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 2813 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 6806/6806 transitions.
Applied a total of 0 rules in 369 ms. Remains 2813 /2813 variables (removed 0) and now considering 6806/6806 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 2813/2813 places, 6806/6806 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2813/2813 places, 6806/6806 transitions.
Applied a total of 0 rules in 371 ms. Remains 2813 /2813 variables (removed 0) and now considering 6806/6806 (removed 0) transitions.
[2024-05-24 23:27:07] [INFO ] Flow matrix only has 5921 transitions (discarded 885 similar events)
[2024-05-24 23:27:07] [INFO ] Invariant cache hit.
[2024-05-24 23:27:11] [INFO ] Implicit Places using invariants in 3666 ms returned []
[2024-05-24 23:27:11] [INFO ] Flow matrix only has 5921 transitions (discarded 885 similar events)
[2024-05-24 23:27:11] [INFO ] Invariant cache hit.
[2024-05-24 23:27:13] [INFO ] State equation strengthened by 2632 read => feed constraints.
[2024-05-24 23:27:46] [INFO ] Performed 1180/2813 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-24 23:28:16] [INFO ] Performed 1840/2813 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-24 23:28:37] [INFO ] Implicit Places using invariants and state equation in 86188 ms returned []
Implicit Place search using SMT with State Equation took 89854 ms to find 0 implicit places.
[2024-05-24 23:28:38] [INFO ] Redundant transitions in 534 ms returned []
Running 6712 sub problems to find dead transitions.
[2024-05-24 23:28:38] [INFO ] Flow matrix only has 5921 transitions (discarded 885 similar events)
[2024-05-24 23:28:38] [INFO ] Invariant cache hit.
[2024-05-24 23:28:38] [INFO ] State equation strengthened by 2632 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2811 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 6712 unsolved
SMT process timed out in 44423ms, After SMT, problems are : Problem set: 0 solved, 6712 unsolved
Search for dead transitions found 0 dead transitions in 44480ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135263 ms. Remains : 2813/2813 places, 6806/6806 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p2) (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 (NOT p1))), (G (OR (NOT p2) (NOT p0) p1)), (G (OR p2 (NOT p0) (NOT p1))), (G (OR (NOT p0) (NOT p1))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p0 p1))), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1))))]
Knowledge based reduction with 18 factoid took 544 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 232 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Support contains 6 out of 3162 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3162/3162 places, 7155/7155 transitions.
Applied a total of 0 rules in 385 ms. Remains 3162 /3162 variables (removed 0) and now considering 7155/7155 (removed 0) transitions.
[2024-05-24 23:29:24] [INFO ] Flow matrix only has 6555 transitions (discarded 600 similar events)
// Phase 1: matrix 6555 rows 3162 cols
[2024-05-24 23:29:24] [INFO ] Computed 65 invariants in 139 ms
[2024-05-24 23:29:28] [INFO ] Implicit Places using invariants in 4432 ms returned []
[2024-05-24 23:29:28] [INFO ] Flow matrix only has 6555 transitions (discarded 600 similar events)
[2024-05-24 23:29:28] [INFO ] Invariant cache hit.
[2024-05-24 23:29:31] [INFO ] State equation strengthened by 2632 read => feed constraints.
[2024-05-24 23:30:02] [INFO ] Performed 1121/3162 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:30:32] [INFO ] Performed 1596/3162 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:31:02] [INFO ] Performed 2426/3162 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 23:31:19] [INFO ] Implicit Places using invariants and state equation in 110846 ms returned []
Implicit Place search using SMT with State Equation took 115280 ms to find 0 implicit places.
Running 7130 sub problems to find dead transitions.
[2024-05-24 23:31:19] [INFO ] Flow matrix only has 6555 transitions (discarded 600 similar events)
[2024-05-24 23:31:19] [INFO ] Invariant cache hit.
[2024-05-24 23:31:19] [INFO ] State equation strengthened by 2632 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3160 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7130 unsolved
SMT process timed out in 42527ms, After SMT, problems are : Problem set: 0 solved, 7130 unsolved
Search for dead transitions found 0 dead transitions in 42595ms
Finished structural reductions in LTL mode , in 1 iterations and 158271 ms. Remains : 3162/3162 places, 7155/7155 transitions.
Computed a total of 538 stabilizing places and 1954 stable transitions
Computed a total of 538 stabilizing places and 1954 stable transitions
Detected a total of 538/3162 stabilizing places and 1954/7155 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
RANDOM walk for 40000 steps (644 resets) in 1021 ms. (39 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (120 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2024-05-24 23:32:03] [INFO ] Flow matrix only has 6555 transitions (discarded 600 similar events)
[2024-05-24 23:32:03] [INFO ] Invariant cache hit.
[2024-05-24 23:32:03] [INFO ] State equation strengthened by 2632 read => feed constraints.
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) 2762/2764 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2764 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 250/3014 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3014 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/3106 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 44/3150 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3150 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/3162 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9717/9717 variables, and 3227 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2039 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 3162/3162 constraints, ReadFeed: 0/2632 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) 2762/2764 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2764 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 250/3014 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3014 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/3106 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:32:07] [INFO ] Deduced a trap composed of 240 places in 2112 ms of which 18 ms to minimize.
[2024-05-24 23:32:09] [INFO ] Deduced a trap composed of 150 places in 2166 ms of which 21 ms to minimize.
[2024-05-24 23:32:12] [INFO ] Deduced a trap composed of 103 places in 2228 ms of which 21 ms to minimize.
SMT process timed out in 9171ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3162/3162 places, 7155/7155 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 3162 transition count 7133
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 3140 transition count 7133
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 44 place count 3140 transition count 7120
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 70 place count 3127 transition count 7120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 3126 transition count 7119
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 3126 transition count 7119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 72 place count 3126 transition count 7118
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 74 place count 3125 transition count 7118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 3124 transition count 7112
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 3124 transition count 7112
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 128 place count 3098 transition count 7086
Free-agglomeration rule (complex) applied 294 times.
Iterating global reduction 2 with 294 rules applied. Total rules applied 422 place count 3098 transition count 9767
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 716 place count 2804 transition count 9767
Applied a total of 716 rules in 2457 ms. Remains 2804 /3162 variables (removed 358) and now considering 9767/7155 (removed -2612) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2457 ms. Remains : 2804/3162 places, 9767/7155 transitions.
RANDOM walk for 40000 steps (1132 resets) in 1703 ms. (23 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (92 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 32565 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 1
Probabilistic random walk after 32565 steps, saw 13752 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-24 23:32:18] [INFO ] Flow matrix only has 8881 transitions (discarded 886 similar events)
// Phase 1: matrix 8881 rows 2804 cols
[2024-05-24 23:32:18] [INFO ] Computed 65 invariants in 214 ms
[2024-05-24 23:32:18] [INFO ] State equation strengthened by 5602 read => feed constraints.
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) 2681/2683 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2683 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/2708 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2708 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/2748 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:32:20] [INFO ] Deduced a trap composed of 5 places in 1913 ms of which 18 ms to minimize.
[2024-05-24 23:32:22] [INFO ] Deduced a trap composed of 150 places in 1895 ms of which 18 ms to minimize.
[2024-05-24 23:32:24] [INFO ] Deduced a trap composed of 70 places in 1881 ms of which 18 ms to minimize.
[2024-05-24 23:32:26] [INFO ] Deduced a trap composed of 153 places in 1914 ms of which 17 ms to minimize.
[2024-05-24 23:32:28] [INFO ] Deduced a trap composed of 149 places in 1980 ms of which 18 ms to minimize.
[2024-05-24 23:32:30] [INFO ] Deduced a trap composed of 152 places in 1928 ms of which 18 ms to minimize.
[2024-05-24 23:32:32] [INFO ] Deduced a trap composed of 151 places in 1930 ms of which 19 ms to minimize.
[2024-05-24 23:32:34] [INFO ] Deduced a trap composed of 174 places in 2017 ms of which 18 ms to minimize.
[2024-05-24 23:32:36] [INFO ] Deduced a trap composed of 175 places in 2025 ms of which 19 ms to minimize.
[2024-05-24 23:32:38] [INFO ] Deduced a trap composed of 152 places in 2039 ms of which 18 ms to minimize.
[2024-05-24 23:32:40] [INFO ] Deduced a trap composed of 140 places in 1890 ms of which 18 ms to minimize.
[2024-05-24 23:32:42] [INFO ] Deduced a trap composed of 298 places in 2057 ms of which 19 ms to minimize.
[2024-05-24 23:32:44] [INFO ] Deduced a trap composed of 277 places in 1860 ms of which 17 ms to minimize.
[2024-05-24 23:32:46] [INFO ] Deduced a trap composed of 275 places in 1946 ms of which 18 ms to minimize.
[2024-05-24 23:32:48] [INFO ] Deduced a trap composed of 166 places in 2004 ms of which 19 ms to minimize.
[2024-05-24 23:32:50] [INFO ] Deduced a trap composed of 117 places in 2006 ms of which 17 ms to minimize.
[2024-05-24 23:32:53] [INFO ] Deduced a trap composed of 118 places in 1977 ms of which 18 ms to minimize.
[2024-05-24 23:32:55] [INFO ] Deduced a trap composed of 116 places in 2039 ms of which 18 ms to minimize.
[2024-05-24 23:32:57] [INFO ] Deduced a trap composed of 120 places in 2067 ms of which 18 ms to minimize.
[2024-05-24 23:32:59] [INFO ] Deduced a trap composed of 153 places in 1962 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2748 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:33:01] [INFO ] Deduced a trap composed of 150 places in 1991 ms of which 18 ms to minimize.
[2024-05-24 23:33:03] [INFO ] Deduced a trap composed of 148 places in 1921 ms of which 17 ms to minimize.
[2024-05-24 23:33:05] [INFO ] Deduced a trap composed of 151 places in 1902 ms of which 18 ms to minimize.
SMT process timed out in 46974ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 9767/9767 transitions.
Applied a total of 0 rules in 563 ms. Remains 2804 /2804 variables (removed 0) and now considering 9767/9767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 565 ms. Remains : 2804/2804 places, 9767/9767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 9767/9767 transitions.
Applied a total of 0 rules in 558 ms. Remains 2804 /2804 variables (removed 0) and now considering 9767/9767 (removed 0) transitions.
[2024-05-24 23:33:06] [INFO ] Flow matrix only has 8881 transitions (discarded 886 similar events)
[2024-05-24 23:33:06] [INFO ] Invariant cache hit.
[2024-05-24 23:33:11] [INFO ] Implicit Places using invariants in 5407 ms returned [88, 1349, 2395]
[2024-05-24 23:33:11] [INFO ] Actually due to overlaps returned [1349, 2395]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5418 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2802/2804 places, 9767/9767 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2801 transition count 9766
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2801 transition count 9766
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2800 transition count 9765
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2800 transition count 9765
Applied a total of 4 rules in 981 ms. Remains 2800 /2802 variables (removed 2) and now considering 9765/9767 (removed 2) transitions.
[2024-05-24 23:33:12] [INFO ] Flow matrix only has 8879 transitions (discarded 886 similar events)
// Phase 1: matrix 8879 rows 2800 cols
[2024-05-24 23:33:12] [INFO ] Computed 63 invariants in 165 ms
[2024-05-24 23:33:18] [INFO ] Implicit Places using invariants in 5280 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5289 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2799/2804 places, 9765/9767 transitions.
Applied a total of 0 rules in 508 ms. Remains 2799 /2799 variables (removed 0) and now considering 9765/9765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 12756 ms. Remains : 2799/2804 places, 9765/9767 transitions.
RANDOM walk for 40000 steps (1133 resets) in 1384 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (94 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 33483 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :0 out of 1
Probabilistic random walk after 33483 steps, saw 14122 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
[2024-05-24 23:33:21] [INFO ] Flow matrix only has 8879 transitions (discarded 886 similar events)
// Phase 1: matrix 8879 rows 2799 cols
[2024-05-24 23:33:22] [INFO ] Computed 62 invariants in 125 ms
[2024-05-24 23:33:22] [INFO ] State equation strengthened by 5602 read => feed constraints.
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) 76/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2640/2718 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2718 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/2787 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2787 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/2799 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2799 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8879/11678 variables, 2799/2861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/11678 variables, 5602/8463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/11678 variables, 0/8463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/11678 variables, 0/8463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11678/11678 variables, and 8463 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4816 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 2799/2799 constraints, ReadFeed: 5602/5602 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) 76/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2640/2718 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:33:29] [INFO ] Deduced a trap composed of 135 places in 1973 ms of which 17 ms to minimize.
[2024-05-24 23:33:31] [INFO ] Deduced a trap composed of 89 places in 2100 ms of which 17 ms to minimize.
[2024-05-24 23:33:33] [INFO ] Deduced a trap composed of 88 places in 2062 ms of which 19 ms to minimize.
[2024-05-24 23:33:35] [INFO ] Deduced a trap composed of 89 places in 1955 ms of which 17 ms to minimize.
[2024-05-24 23:33:37] [INFO ] Deduced a trap composed of 96 places in 2057 ms of which 18 ms to minimize.
[2024-05-24 23:33:39] [INFO ] Deduced a trap composed of 83 places in 2008 ms of which 18 ms to minimize.
[2024-05-24 23:33:41] [INFO ] Deduced a trap composed of 92 places in 2049 ms of which 17 ms to minimize.
[2024-05-24 23:33:43] [INFO ] Deduced a trap composed of 79 places in 2122 ms of which 18 ms to minimize.
[2024-05-24 23:33:46] [INFO ] Deduced a trap composed of 88 places in 2100 ms of which 18 ms to minimize.
[2024-05-24 23:33:48] [INFO ] Deduced a trap composed of 83 places in 2000 ms of which 17 ms to minimize.
[2024-05-24 23:33:50] [INFO ] Deduced a trap composed of 99 places in 1963 ms of which 18 ms to minimize.
[2024-05-24 23:33:52] [INFO ] Deduced a trap composed of 81 places in 2065 ms of which 19 ms to minimize.
[2024-05-24 23:33:54] [INFO ] Deduced a trap composed of 83 places in 2079 ms of which 19 ms to minimize.
[2024-05-24 23:33:56] [INFO ] Deduced a trap composed of 79 places in 2065 ms of which 18 ms to minimize.
[2024-05-24 23:33:58] [INFO ] Deduced a trap composed of 100 places in 1953 ms of which 17 ms to minimize.
[2024-05-24 23:34:00] [INFO ] Deduced a trap composed of 88 places in 1946 ms of which 18 ms to minimize.
[2024-05-24 23:34:02] [INFO ] Deduced a trap composed of 88 places in 2059 ms of which 19 ms to minimize.
[2024-05-24 23:34:04] [INFO ] Deduced a trap composed of 90 places in 2027 ms of which 18 ms to minimize.
[2024-05-24 23:34:06] [INFO ] Deduced a trap composed of 140 places in 1995 ms of which 18 ms to minimize.
[2024-05-24 23:34:08] [INFO ] Deduced a trap composed of 102 places in 1831 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2718 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:34:10] [INFO ] Deduced a trap composed of 95 places in 1938 ms of which 16 ms to minimize.
[2024-05-24 23:34:12] [INFO ] Deduced a trap composed of 98 places in 2111 ms of which 19 ms to minimize.
[2024-05-24 23:34:14] [INFO ] Deduced a trap composed of 93 places in 1998 ms of which 17 ms to minimize.
[2024-05-24 23:34:16] [INFO ] Deduced a trap composed of 90 places in 1945 ms of which 18 ms to minimize.
[2024-05-24 23:34:18] [INFO ] Deduced a trap composed of 95 places in 1986 ms of which 18 ms to minimize.
[2024-05-24 23:34:21] [INFO ] Deduced a trap composed of 99 places in 2115 ms of which 16 ms to minimize.
[2024-05-24 23:34:23] [INFO ] Deduced a trap composed of 97 places in 2197 ms of which 18 ms to minimize.
[2024-05-24 23:34:25] [INFO ] Deduced a trap composed of 100 places in 2123 ms of which 18 ms to minimize.
[2024-05-24 23:34:27] [INFO ] Deduced a trap composed of 98 places in 2238 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2718 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2718 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 69/2787 variables, 45/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:34:30] [INFO ] Deduced a trap composed of 5 places in 2283 ms of which 19 ms to minimize.
[2024-05-24 23:34:32] [INFO ] Deduced a trap composed of 105 places in 2484 ms of which 19 ms to minimize.
[2024-05-24 23:34:35] [INFO ] Deduced a trap composed of 159 places in 2259 ms of which 19 ms to minimize.
[2024-05-24 23:34:37] [INFO ] Deduced a trap composed of 87 places in 2128 ms of which 17 ms to minimize.
[2024-05-24 23:34:39] [INFO ] Deduced a trap composed of 139 places in 2074 ms of which 18 ms to minimize.
[2024-05-24 23:34:41] [INFO ] Deduced a trap composed of 137 places in 2455 ms of which 19 ms to minimize.
[2024-05-24 23:34:44] [INFO ] Deduced a trap composed of 92 places in 2411 ms of which 19 ms to minimize.
SMT process timed out in 82399ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2799/2799 places, 9765/9765 transitions.
Applied a total of 0 rules in 552 ms. Remains 2799 /2799 variables (removed 0) and now considering 9765/9765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 552 ms. Remains : 2799/2799 places, 9765/9765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2799/2799 places, 9765/9765 transitions.
Applied a total of 0 rules in 549 ms. Remains 2799 /2799 variables (removed 0) and now considering 9765/9765 (removed 0) transitions.
[2024-05-24 23:34:45] [INFO ] Flow matrix only has 8879 transitions (discarded 886 similar events)
[2024-05-24 23:34:45] [INFO ] Invariant cache hit.
[2024-05-24 23:34:50] [INFO ] Implicit Places using invariants in 5161 ms returned []
[2024-05-24 23:34:50] [INFO ] Flow matrix only has 8879 transitions (discarded 886 similar events)
[2024-05-24 23:34:50] [INFO ] Invariant cache hit.
[2024-05-24 23:34:53] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:35:24] [INFO ] Performed 313/2799 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:35:54] [INFO ] Performed 704/2799 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:36:25] [INFO ] Performed 921/2799 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 23:36:55] [INFO ] Performed 1171/2799 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2024-05-24 23:36:55] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2024-05-24 23:36:55] [INFO ] Implicit Places using invariants and state equation in 125016 ms returned []
Implicit Place search using SMT with State Equation took 130178 ms to find 0 implicit places.
[2024-05-24 23:36:56] [INFO ] Redundant transitions in 1136 ms returned []
Running 9671 sub problems to find dead transitions.
[2024-05-24 23:36:56] [INFO ] Flow matrix only has 8879 transitions (discarded 886 similar events)
[2024-05-24 23:36:56] [INFO ] Invariant cache hit.
[2024-05-24 23:36:56] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2797 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9671 unsolved
SMT process timed out in 89290ms, After SMT, problems are : Problem set: 0 solved, 9671 unsolved
Search for dead transitions found 0 dead transitions in 89376ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221275 ms. Remains : 2799/2799 places, 9765/9765 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (X (NOT p0))), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F p2)]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 235 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 220 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Product exploration explored 100000 steps with 24878 reset in 1439 ms.
Product exploration explored 100000 steps with 24974 reset in 1582 ms.
Applying partial POR strategy [false, false, false, true, true, false, true]
Stuttering acceptance computed with spot in 240 ms :[p2, p0, (AND p2 p0), p0, true, (AND p0 p2), p2]
Support contains 6 out of 3162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3162/3162 places, 7155/7155 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 3162 transition count 7155
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 22 place count 3162 transition count 7156
Deduced a syphon composed of 35 places in 3 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 35 place count 3162 transition count 7156
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 3151 transition count 7144
Deduced a syphon composed of 25 places in 4 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 3151 transition count 7144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 3150 transition count 7138
Deduced a syphon composed of 25 places in 4 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 3150 transition count 7138
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 52 places in 4 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 86 place count 3150 transition count 7138
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 3148 transition count 7136
Deduced a syphon composed of 50 places in 9 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 3148 transition count 7136
Deduced a syphon composed of 50 places in 3 ms
Applied a total of 90 rules in 2314 ms. Remains 3148 /3162 variables (removed 14) and now considering 7136/7155 (removed 19) transitions.
[2024-05-24 23:38:33] [INFO ] Redundant transitions in 777 ms returned []
Running 7111 sub problems to find dead transitions.
[2024-05-24 23:38:33] [INFO ] Flow matrix only has 6536 transitions (discarded 600 similar events)
// Phase 1: matrix 6536 rows 3148 cols
[2024-05-24 23:38:33] [INFO ] Computed 65 invariants in 135 ms
[2024-05-24 23:38:33] [INFO ] State equation strengthened by 2627 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.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 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.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 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 1.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 1.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 1.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 1.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 1.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 1.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 1.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 1.0)
(s782 0.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 0.0)
(s788 0.0)
(s789 1.0)
(s790 0.0)
(s791 1.0)
(s792 0.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 0.0)
(s798 1.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 1.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 1.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 1.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 1.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 1.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 1.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 1.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 1.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 1.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 1.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 1.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 1.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 1.0)
(s956 0.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 0.0)
(s963 0.0)
(s964 1.0)
(s965 0.0)
(s966 1.0)
(s967 0.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3146 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7111 unsolved
SMT process timed out in 46924ms, After SMT, problems are : Problem set: 0 solved, 7111 unsolved
Search for dead transitions found 0 dead transitions in 46981ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3148/3162 places, 7136/7155 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50088 ms. Remains : 3148/3162 places, 7136/7155 transitions.
Built C files in :
/tmp/ltsmin4393425005896621472
[2024-05-24 23:39:20] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4393425005896621472
Running compilation step : cd /tmp/ltsmin4393425005896621472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4393425005896621472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4393425005896621472;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 3162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3162/3162 places, 7155/7155 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3161 transition count 7154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3161 transition count 7154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3160 transition count 7148
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3160 transition count 7148
Applied a total of 4 rules in 1152 ms. Remains 3160 /3162 variables (removed 2) and now considering 7148/7155 (removed 7) transitions.
[2024-05-24 23:39:24] [INFO ] Flow matrix only has 6548 transitions (discarded 600 similar events)
// Phase 1: matrix 6548 rows 3160 cols
[2024-05-24 23:39:24] [INFO ] Computed 65 invariants in 184 ms
[2024-05-24 23:39:29] [INFO ] Implicit Places using invariants in 4352 ms returned [2702]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4357 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3159/3162 places, 7148/7155 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3158 transition count 7147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3158 transition count 7147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3157 transition count 7146
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3157 transition count 7146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3156 transition count 7145
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3156 transition count 7145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 3155 transition count 7139
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 3155 transition count 7139
Applied a total of 8 rules in 2032 ms. Remains 3155 /3159 variables (removed 4) and now considering 7139/7148 (removed 9) transitions.
[2024-05-24 23:39:31] [INFO ] Flow matrix only has 6539 transitions (discarded 600 similar events)
// Phase 1: matrix 6539 rows 3155 cols
[2024-05-24 23:39:31] [INFO ] Computed 64 invariants in 155 ms
[2024-05-24 23:39:35] [INFO ] Implicit Places using invariants in 4404 ms returned []
[2024-05-24 23:39:35] [INFO ] Flow matrix only has 6539 transitions (discarded 600 similar events)
[2024-05-24 23:39:35] [INFO ] Invariant cache hit.
[2024-05-24 23:39:38] [INFO ] State equation strengthened by 2622 read => feed constraints.
[2024-05-24 23:40:09] [INFO ] Performed 1120/3155 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:40:39] [INFO ] Performed 1719/3155 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:41:09] [INFO ] Performed 2703/3155 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 23:41:19] [INFO ] Implicit Places using invariants and state equation in 104137 ms returned [3140]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 108545 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3154/3162 places, 7139/7155 transitions.
Applied a total of 0 rules in 385 ms. Remains 3154 /3154 variables (removed 0) and now considering 7139/7139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 116475 ms. Remains : 3154/3162 places, 7139/7155 transitions.
Built C files in :
/tmp/ltsmin7829248638462047618
[2024-05-24 23:41:20] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7829248638462047618
Running compilation step : cd /tmp/ltsmin7829248638462047618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7829248638462047618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7829248638462047618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 23:41:23] [INFO ] Flatten gal took : 164 ms
[2024-05-24 23:41:23] [INFO ] Flatten gal took : 182 ms
[2024-05-24 23:41:23] [INFO ] Time to serialize gal into /tmp/LTL11949647279709465499.gal : 32 ms
[2024-05-24 23:41:23] [INFO ] Time to serialize properties into /tmp/LTL7419978572740611479.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11949647279709465499.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16458462676419431280.hoa' '-atoms' '/tmp/LTL7419978572740611479.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7419978572740611479.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16458462676419431280.hoa
Detected timeout of ITS tools.
[2024-05-24 23:41:39] [INFO ] Flatten gal took : 191 ms
[2024-05-24 23:41:39] [INFO ] Flatten gal took : 201 ms
[2024-05-24 23:41:39] [INFO ] Time to serialize gal into /tmp/LTL3421955998346993466.gal : 37 ms
[2024-05-24 23:41:39] [INFO ] Time to serialize properties into /tmp/LTL3273540857781550317.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3421955998346993466.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3273540857781550317.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(X(G((!("((Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(LeafSetOfLx5IsSentToNode4>=1))"))||(("((Node23HasAskedItsLeafSetToRx4...534
Formula 0 simplified : XXF("((Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(LeafSetOfLx5IsSentToNode4>=1))" & (!"((Node23HasAskedItsLeafSetToRx4ToReplac...514
Detected timeout of ITS tools.
[2024-05-24 23:41:54] [INFO ] Flatten gal took : 247 ms
[2024-05-24 23:41:54] [INFO ] Applying decomposition
[2024-05-24 23:41:54] [INFO ] Flatten gal took : 194 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15499728396805304565.txt' '-o' '/tmp/graph15499728396805304565.bin' '-w' '/tmp/graph15499728396805304565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15499728396805304565.bin' '-l' '-1' '-v' '-w' '/tmp/graph15499728396805304565.weights' '-q' '0' '-e' '0.001'
[2024-05-24 23:41:55] [INFO ] Decomposing Gal with order
[2024-05-24 23:41:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 23:41:55] [INFO ] Removed a total of 5677 redundant transitions.
[2024-05-24 23:41:56] [INFO ] Flatten gal took : 477 ms
[2024-05-24 23:41:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 3030 labels/synchronizations in 252 ms.
[2024-05-24 23:41:56] [INFO ] Time to serialize gal into /tmp/LTL9359259844533530604.gal : 55 ms
[2024-05-24 23:41:56] [INFO ] Time to serialize properties into /tmp/LTL54073930822615037.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9359259844533530604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL54073930822615037.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...252
Read 1 LTL properties
Checking formula 0 : !(((X(X(G((!("((i4.i0.i1.u6.Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(i4.i0.i1.u122.LeafSetOfLx5IsSentToNode4>=1))"))||(("((i4....631
Formula 0 simplified : XXF("((i4.i0.i1.u6.Node4HasAskedItsLeafSetToLx5ToReplaceNode9>=1)&&(i4.i0.i1.u122.LeafSetOfLx5IsSentToNode4>=1))" & (!"((i4.i1.i2.u2...611
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-02 finished in 986804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
Support contains 4 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 7389/7389 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 3260 transition count 7367
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 3238 transition count 7367
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 44 place count 3238 transition count 7345
Deduced a syphon composed of 22 places in 5 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 88 place count 3216 transition count 7345
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 104 place count 3200 transition count 7299
Iterating global reduction 2 with 16 rules applied. Total rules applied 120 place count 3200 transition count 7299
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 120 place count 3200 transition count 7296
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 3197 transition count 7296
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 136 place count 3187 transition count 7236
Iterating global reduction 2 with 10 rules applied. Total rules applied 146 place count 3187 transition count 7236
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 212 place count 3154 transition count 7203
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 217 place count 3149 transition count 7198
Iterating global reduction 2 with 5 rules applied. Total rules applied 222 place count 3149 transition count 7198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 227 place count 3144 transition count 7168
Iterating global reduction 2 with 5 rules applied. Total rules applied 232 place count 3144 transition count 7168
Applied a total of 232 rules in 2939 ms. Remains 3144 /3260 variables (removed 116) and now considering 7168/7389 (removed 221) transitions.
[2024-05-24 23:42:14] [INFO ] Flow matrix only has 6568 transitions (discarded 600 similar events)
// Phase 1: matrix 6568 rows 3144 cols
[2024-05-24 23:42:14] [INFO ] Computed 79 invariants in 205 ms
[2024-05-24 23:42:19] [INFO ] Implicit Places using invariants in 4754 ms returned [97, 310, 778, 955, 1171, 1217, 1308, 1354, 1384, 1483, 1513, 1521, 1535, 1567, 1600, 2683, 2684, 2959]
[2024-05-24 23:42:19] [INFO ] Actually due to overlaps returned [310, 1513, 778, 955, 1171, 1217, 1354, 1384, 1483, 1521, 1535, 1567, 1600, 2683, 2684, 2959]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 4759 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3128/3260 places, 7168/7389 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3118 transition count 7158
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3118 transition count 7158
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 3108 transition count 7148
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 3108 transition count 7148
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 3099 transition count 7094
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 3099 transition count 7094
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 3095 transition count 7090
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3091 transition count 7086
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3091 transition count 7086
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 3087 transition count 7062
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 3087 transition count 7062
Applied a total of 82 rules in 3317 ms. Remains 3087 /3128 variables (removed 41) and now considering 7062/7168 (removed 106) transitions.
[2024-05-24 23:42:22] [INFO ] Flow matrix only has 6462 transitions (discarded 600 similar events)
// Phase 1: matrix 6462 rows 3087 cols
[2024-05-24 23:42:22] [INFO ] Computed 63 invariants in 141 ms
[2024-05-24 23:42:27] [INFO ] Implicit Places using invariants in 4524 ms returned [97, 1295]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4529 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3085/3260 places, 7062/7389 transitions.
Applied a total of 0 rules in 554 ms. Remains 3085 /3085 variables (removed 0) and now considering 7062/7062 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 16100 ms. Remains : 3085/3260 places, 7062/7389 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C06-LTLFireability-03
Product exploration explored 100000 steps with 2297 reset in 1214 ms.
Product exploration explored 100000 steps with 2296 reset in 1145 ms.
Computed a total of 486 stabilizing places and 1886 stable transitions
Computed a total of 486 stabilizing places and 1886 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 103 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND p0 (NOT p1))]
RANDOM walk for 40000 steps (916 resets) in 658 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (128 resets) in 540 ms. (73 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (128 resets) in 475 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (128 resets) in 440 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (128 resets) in 484 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (128 resets) in 436 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (128 resets) in 370 ms. (107 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 30810 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 6
Probabilistic random walk after 30810 steps, saw 13044 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-24 23:42:34] [INFO ] Flow matrix only has 6462 transitions (discarded 600 similar events)
// Phase 1: matrix 6462 rows 3085 cols
[2024-05-24 23:42:34] [INFO ] Computed 61 invariants in 171 ms
[2024-05-24 23:42:34] [INFO ] State equation strengthened by 2612 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 2966/2970 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 23:42:36] [INFO ] Deduced a trap composed of 1564 places in 1980 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2970 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2970 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 27/2997 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 23:42:39] [INFO ] Deduced a trap composed of 105 places in 1929 ms of which 19 ms to minimize.
SMT process timed out in 5282ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3085/3085 places, 7062/7062 transitions.
Free-agglomeration rule (complex) applied 291 times.
Iterating global reduction 0 with 291 rules applied. Total rules applied 291 place count 3085 transition count 9761
Reduce places removed 291 places and 0 transitions.
Iterating post reduction 0 with 291 rules applied. Total rules applied 582 place count 2794 transition count 9761
Applied a total of 582 rules in 1368 ms. Remains 2794 /3085 variables (removed 291) and now considering 9761/7062 (removed -2699) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1368 ms. Remains : 2794/3085 places, 9761/7062 transitions.
RANDOM walk for 40000 steps (1132 resets) in 3546 ms. (11 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (94 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (95 resets) in 303 ms. (131 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (81 resets) in 334 ms. (119 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (94 resets) in 446 ms. (89 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (83 resets) in 293 ms. (136 steps per ms) remains 2/5 properties
[2024-05-24 23:42:42] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
// Phase 1: matrix 8875 rows 2794 cols
[2024-05-24 23:42:42] [INFO ] Computed 61 invariants in 125 ms
[2024-05-24 23:42:42] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2675/2679 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2679 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/2706 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:42:45] [INFO ] Deduced a trap composed of 96 places in 2155 ms of which 18 ms to minimize.
[2024-05-24 23:42:47] [INFO ] Deduced a trap composed of 337 places in 2195 ms of which 18 ms to minimize.
[2024-05-24 23:42:49] [INFO ] Deduced a trap composed of 97 places in 2046 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2706 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2706 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36/2742 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:42:52] [INFO ] Deduced a trap composed of 5 places in 2133 ms of which 17 ms to minimize.
[2024-05-24 23:42:54] [INFO ] Deduced a trap composed of 212 places in 2084 ms of which 19 ms to minimize.
[2024-05-24 23:42:56] [INFO ] Deduced a trap composed of 244 places in 2022 ms of which 18 ms to minimize.
[2024-05-24 23:42:58] [INFO ] Deduced a trap composed of 107 places in 2271 ms of which 20 ms to minimize.
[2024-05-24 23:43:00] [INFO ] Deduced a trap composed of 277 places in 2076 ms of which 17 ms to minimize.
[2024-05-24 23:43:02] [INFO ] Deduced a trap composed of 87 places in 2198 ms of which 18 ms to minimize.
[2024-05-24 23:43:05] [INFO ] Deduced a trap composed of 111 places in 2177 ms of which 16 ms to minimize.
[2024-05-24 23:43:07] [INFO ] Deduced a trap composed of 124 places in 2075 ms of which 15 ms to minimize.
[2024-05-24 23:43:09] [INFO ] Deduced a trap composed of 115 places in 2195 ms of which 18 ms to minimize.
[2024-05-24 23:43:11] [INFO ] Deduced a trap composed of 138 places in 2197 ms of which 18 ms to minimize.
[2024-05-24 23:43:13] [INFO ] Deduced a trap composed of 107 places in 2099 ms of which 17 ms to minimize.
[2024-05-24 23:43:16] [INFO ] Deduced a trap composed of 105 places in 2126 ms of which 18 ms to minimize.
[2024-05-24 23:43:18] [INFO ] Deduced a trap composed of 114 places in 2102 ms of which 17 ms to minimize.
[2024-05-24 23:43:20] [INFO ] Deduced a trap composed of 161 places in 2127 ms of which 18 ms to minimize.
[2024-05-24 23:43:22] [INFO ] Deduced a trap composed of 104 places in 2238 ms of which 18 ms to minimize.
[2024-05-24 23:43:24] [INFO ] Deduced a trap composed of 106 places in 2163 ms of which 15 ms to minimize.
[2024-05-24 23:43:26] [INFO ] Deduced a trap composed of 259 places in 2082 ms of which 18 ms to minimize.
[2024-05-24 23:43:29] [INFO ] Deduced a trap composed of 161 places in 2031 ms of which 18 ms to minimize.
SMT process timed out in 46739ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2794 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2794/2794 places, 9761/9761 transitions.
Applied a total of 0 rules in 576 ms. Remains 2794 /2794 variables (removed 0) and now considering 9761/9761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 576 ms. Remains : 2794/2794 places, 9761/9761 transitions.
RANDOM walk for 40000 steps (1132 resets) in 2052 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (79 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (80 resets) in 236 ms. (168 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 30850 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 2
Probabilistic random walk after 30850 steps, saw 13052 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-24 23:43:33] [INFO ] Flow matrix only has 8875 transitions (discarded 886 similar events)
[2024-05-24 23:43:33] [INFO ] Invariant cache hit.
[2024-05-24 23:43:33] [INFO ] State equation strengthened by 5602 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2675/2679 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2679 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/2706 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:43:35] [INFO ] Deduced a trap composed of 257 places in 1848 ms of which 15 ms to minimize.
[2024-05-24 23:43:37] [INFO ] Deduced a trap composed of 97 places in 2038 ms of which 18 ms to minimize.
[2024-05-24 23:43:39] [INFO ] Deduced a trap composed of 126 places in 2082 ms of which 19 ms to minimize.
[2024-05-24 23:43:42] [INFO ] Deduced a trap composed of 295 places in 2021 ms of which 17 ms to minimize.
[2024-05-24 23:43:44] [INFO ] Deduced a trap composed of 223 places in 2062 ms of which 17 ms to minimize.
[2024-05-24 23:43:46] [INFO ] Deduced a trap composed of 193 places in 2000 ms of which 18 ms to minimize.
[2024-05-24 23:43:48] [INFO ] Deduced a trap composed of 216 places in 1968 ms of which 17 ms to minimize.
[2024-05-24 23:43:50] [INFO ] Deduced a trap composed of 127 places in 2012 ms of which 17 ms to minimize.
[2024-05-24 23:43:52] [INFO ] Deduced a trap composed of 127 places in 2055 ms of which 16 ms to minimize.
[2024-05-24 23:43:54] [INFO ] Deduced a trap composed of 113 places in 2010 ms of which 15 ms to minimize.
[2024-05-24 23:43:56] [INFO ] Deduced a trap composed of 167 places in 2068 ms of which 17 ms to minimize.
[2024-05-24 23:43:58] [INFO ] Deduced a trap composed of 295 places in 1867 ms of which 17 ms to minimize.
[2024-05-24 23:44:00] [INFO ] Deduced a trap composed of 96 places in 2044 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2706 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2706 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36/2742 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:44:02] [INFO ] Deduced a trap composed of 5 places in 1976 ms of which 17 ms to minimize.
[2024-05-24 23:44:04] [INFO ] Deduced a trap composed of 212 places in 2045 ms of which 17 ms to minimize.
[2024-05-24 23:44:06] [INFO ] Deduced a trap composed of 115 places in 1985 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2742 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2742 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 40/2782 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2782 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/2794 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2794 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8875/11669 variables, 2794/2871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11669 variables, 5602/8473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/11669 variables, 0/8473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/11669 variables, 0/8473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11669/11669 variables, and 8473 constraints, problems are : Problem set: 0 solved, 2 unsolved in 44266 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2794/2794 constraints, ReadFeed: 5602/5602 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 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) 2675/2679 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2679 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/2706 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2706 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:44:20] [INFO ] Deduced a trap composed of 119 places in 2191 ms of which 18 ms to minimize.
[2024-05-24 23:44:22] [INFO ] Deduced a trap composed of 257 places in 2020 ms of which 17 ms to minimize.
[2024-05-24 23:44:24] [INFO ] Deduced a trap composed of 97 places in 2179 ms of which 19 ms to minimize.
[2024-05-24 23:44:26] [INFO ] Deduced a trap composed of 145 places in 2185 ms of which 18 ms to minimize.
[2024-05-24 23:44:29] [INFO ] Deduced a trap composed of 167 places in 2176 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2706 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2706 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 36/2742 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2742 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:44:31] [INFO ] Deduced a trap composed of 87 places in 2320 ms of which 19 ms to minimize.
[2024-05-24 23:44:33] [INFO ] Deduced a trap composed of 161 places in 2315 ms of which 18 ms to minimize.
[2024-05-24 23:44:36] [INFO ] Deduced a trap composed of 132 places in 2352 ms of which 18 ms to minimize.
[2024-05-24 23:44:38] [INFO ] Deduced a trap composed of 121 places in 2286 ms of which 19 ms to minimize.
[2024-05-24 23:44:41] [INFO ] Deduced a trap composed of 91 places in 2330 ms of which 18 ms to minimize.
[2024-05-24 23:44:43] [INFO ] Deduced a trap composed of 98 places in 2100 ms of which 17 ms to minimize.
[2024-05-24 23:44:45] [INFO ] Deduced a trap composed of 168 places in 2347 ms of which 18 ms to minimize.
[2024-05-24 23:44:48] [INFO ] Deduced a trap composed of 149 places in 2358 ms of which 19 ms to minimize.
[2024-05-24 23:44:50] [INFO ] Deduced a trap composed of 161 places in 2156 ms of which 17 ms to minimize.
[2024-05-24 23:44:52] [INFO ] Deduced a trap composed of 141 places in 2171 ms of which 18 ms to minimize.
[2024-05-24 23:44:54] [INFO ] Deduced a trap composed of 129 places in 2205 ms of which 18 ms to minimize.
[2024-05-24 23:44:57] [INFO ] Deduced a trap composed of 138 places in 2308 ms of which 18 ms to minimize.
[2024-05-24 23:44:59] [INFO ] Deduced a trap composed of 251 places in 2274 ms of which 19 ms to minimize.
[2024-05-24 23:45:01] [INFO ] Deduced a trap composed of 186 places in 2169 ms of which 18 ms to minimize.
[2024-05-24 23:45:03] [INFO ] Deduced a trap composed of 186 places in 2246 ms of which 17 ms to minimize.
[2024-05-24 23:45:06] [INFO ] Deduced a trap composed of 115 places in 2118 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2742 variables, 16/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2742 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 40/2782 variables, 40/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2782 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/2794 variables, 12/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2794 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8875/11669 variables, 2794/2892 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/11669 variables, 5602/8494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/11669 variables, 2/8496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 23:45:26] [INFO ] Deduced a trap composed of 317 places in 2075 ms of which 19 ms to minimize.
[2024-05-24 23:45:29] [INFO ] Deduced a trap composed of 112 places in 2179 ms of which 17 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/11669 variables, 2/8498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/11669 variables, 0/8498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/11669 variables, 0/8498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11669/11669 variables, and 8498 constraints, problems are : Problem set: 0 solved, 2 unsolved in 74396 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2794/2794 constraints, ReadFeed: 5602/5602 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 39/39 constraints]
After SMT, in 118732ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2612 steps, including 408 resets, run visited all 2 properties in 142 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 151 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 296 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p0]
Stuttering acceptance computed with spot in 43 ms :[p0]
Support contains 2 out of 3085 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 : 3085/3085 places, 7062/7062 transitions.
Applied a total of 0 rules in 546 ms. Remains 3085 /3085 variables (removed 0) and now considering 7062/7062 (removed 0) transitions.
[2024-05-24 23:45:33] [INFO ] Flow matrix only has 6462 transitions (discarded 600 similar events)
// Phase 1: matrix 6462 rows 3085 cols
[2024-05-24 23:45:33] [INFO ] Computed 61 invariants in 168 ms
[2024-05-24 23:45:37] [INFO ] Implicit Places using invariants in 4541 ms returned []
[2024-05-24 23:45:37] [INFO ] Flow matrix only has 6462 transitions (discarded 600 similar events)
[2024-05-24 23:45:37] [INFO ] Invariant cache hit.
[2024-05-24 23:45:40] [INFO ] State equation strengthened by 2612 read => feed constraints.
[2024-05-24 23:46:12] [INFO ] Performed 1290/3085 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:46:42] [INFO ] Performed 2294/3085 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:47:00] [INFO ] Implicit Places using invariants and state equation in 82927 ms returned [3063, 3078]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 87472 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3083/3085 places, 7062/7062 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 3083 transition count 7060
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3081 transition count 7060
Applied a total of 4 rules in 578 ms. Remains 3081 /3083 variables (removed 2) and now considering 7060/7062 (removed 2) transitions.
[2024-05-24 23:47:01] [INFO ] Flow matrix only has 6460 transitions (discarded 600 similar events)
// Phase 1: matrix 6460 rows 3081 cols
[2024-05-24 23:47:01] [INFO ] Computed 59 invariants in 187 ms
[2024-05-24 23:47:05] [INFO ] Implicit Places using invariants in 4492 ms returned []
[2024-05-24 23:47:05] [INFO ] Flow matrix only has 6460 transitions (discarded 600 similar events)
[2024-05-24 23:47:05] [INFO ] Invariant cache hit.
[2024-05-24 23:47:08] [INFO ] State equation strengthened by 2612 read => feed constraints.
[2024-05-24 23:47:38] [INFO ] Performed 1169/3081 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:48:08] [INFO ] Performed 1999/3081 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:48:32] [INFO ] Implicit Places using invariants and state equation in 86555 ms returned []
Implicit Place search using SMT with State Equation took 91048 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3081/3085 places, 7060/7062 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 179645 ms. Remains : 3081/3085 places, 7060/7062 transitions.
Computed a total of 482 stabilizing places and 1884 stable transitions
Computed a total of 482 stabilizing places and 1884 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p0]
RANDOM walk for 40000 steps (917 resets) in 850 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (128 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 36546 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :0 out of 1
Probabilistic random walk after 36546 steps, saw 15429 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
[2024-05-24 23:48:35] [INFO ] Flow matrix only has 6460 transitions (discarded 600 similar events)
[2024-05-24 23:48:35] [INFO ] Invariant cache hit.
[2024-05-24 23:48:35] [INFO ] State equation strengthened by 2612 read => feed constraints.
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) 2963/2965 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2965 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/2992 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:48:38] [INFO ] Deduced a trap composed of 352 places in 2057 ms of which 21 ms to minimize.
[2024-05-24 23:48:40] [INFO ] Deduced a trap composed of 242 places in 2105 ms of which 18 ms to minimize.
[2024-05-24 23:48:42] [INFO ] Deduced a trap composed of 258 places in 2037 ms of which 19 ms to minimize.
SMT process timed out in 6758ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3081/3081 places, 7060/7060 transitions.
Free-agglomeration rule (complex) applied 291 times.
Iterating global reduction 0 with 291 rules applied. Total rules applied 291 place count 3081 transition count 9759
Reduce places removed 291 places and 0 transitions.
Iterating post reduction 0 with 291 rules applied. Total rules applied 582 place count 2790 transition count 9759
Applied a total of 582 rules in 1240 ms. Remains 2790 /3081 variables (removed 291) and now considering 9759/7060 (removed -2699) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1240 ms. Remains : 2790/3081 places, 9759/7060 transitions.
RANDOM walk for 40000 steps (1133 resets) in 1857 ms. (21 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (93 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 31676 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 1
Probabilistic random walk after 31676 steps, saw 13384 distinct states, run finished after 3004 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-24 23:48:47] [INFO ] Flow matrix only has 8873 transitions (discarded 886 similar events)
// Phase 1: matrix 8873 rows 2790 cols
[2024-05-24 23:48:47] [INFO ] Computed 59 invariants in 163 ms
[2024-05-24 23:48:47] [INFO ] State equation strengthened by 5602 read => feed constraints.
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) 2672/2674 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2674 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/2701 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/2738 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2738 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2780 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2780 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/2790 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2790 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8873/11663 variables, 2790/2849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11663 variables, 5602/8451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11663 variables, 0/8451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/11663 variables, 0/8451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11663/11663 variables, and 8451 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4467 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 2790/2790 constraints, ReadFeed: 5602/5602 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) 2672/2674 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2674 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/2701 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:48:54] [INFO ] Deduced a trap composed of 201 places in 2060 ms of which 17 ms to minimize.
[2024-05-24 23:48:56] [INFO ] Deduced a trap composed of 140 places in 2077 ms of which 17 ms to minimize.
[2024-05-24 23:48:58] [INFO ] Deduced a trap composed of 94 places in 1971 ms of which 17 ms to minimize.
[2024-05-24 23:49:00] [INFO ] Deduced a trap composed of 122 places in 1947 ms of which 17 ms to minimize.
[2024-05-24 23:49:02] [INFO ] Deduced a trap composed of 716 places in 2045 ms of which 17 ms to minimize.
[2024-05-24 23:49:04] [INFO ] Deduced a trap composed of 164 places in 2076 ms of which 17 ms to minimize.
[2024-05-24 23:49:06] [INFO ] Deduced a trap composed of 157 places in 2020 ms of which 17 ms to minimize.
[2024-05-24 23:49:08] [INFO ] Deduced a trap composed of 688 places in 2008 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2701 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 37/2738 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:49:11] [INFO ] Deduced a trap composed of 5 places in 1988 ms of which 17 ms to minimize.
[2024-05-24 23:49:13] [INFO ] Deduced a trap composed of 39 places in 2011 ms of which 17 ms to minimize.
[2024-05-24 23:49:15] [INFO ] Deduced a trap composed of 191 places in 1963 ms of which 18 ms to minimize.
[2024-05-24 23:49:17] [INFO ] Deduced a trap composed of 190 places in 1964 ms of which 19 ms to minimize.
[2024-05-24 23:49:19] [INFO ] Deduced a trap composed of 70 places in 2038 ms of which 19 ms to minimize.
[2024-05-24 23:49:21] [INFO ] Deduced a trap composed of 186 places in 1994 ms of which 17 ms to minimize.
[2024-05-24 23:49:23] [INFO ] Deduced a trap composed of 98 places in 1993 ms of which 17 ms to minimize.
[2024-05-24 23:49:25] [INFO ] Deduced a trap composed of 123 places in 2023 ms of which 17 ms to minimize.
[2024-05-24 23:49:27] [INFO ] Deduced a trap composed of 213 places in 2015 ms of which 18 ms to minimize.
[2024-05-24 23:49:29] [INFO ] Deduced a trap composed of 123 places in 1971 ms of which 17 ms to minimize.
[2024-05-24 23:49:31] [INFO ] Deduced a trap composed of 192 places in 1990 ms of which 16 ms to minimize.
[2024-05-24 23:49:33] [INFO ] Deduced a trap composed of 89 places in 1975 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2738 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2738 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/2780 variables, 42/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:49:35] [INFO ] Deduced a trap composed of 197 places in 1843 ms of which 17 ms to minimize.
[2024-05-24 23:49:37] [INFO ] Deduced a trap composed of 98 places in 2066 ms of which 17 ms to minimize.
SMT process timed out in 50230ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2790/2790 places, 9759/9759 transitions.
Applied a total of 0 rules in 554 ms. Remains 2790 /2790 variables (removed 0) and now considering 9759/9759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 554 ms. Remains : 2790/2790 places, 9759/9759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2790/2790 places, 9759/9759 transitions.
Applied a total of 0 rules in 555 ms. Remains 2790 /2790 variables (removed 0) and now considering 9759/9759 (removed 0) transitions.
[2024-05-24 23:49:38] [INFO ] Flow matrix only has 8873 transitions (discarded 886 similar events)
[2024-05-24 23:49:38] [INFO ] Invariant cache hit.
[2024-05-24 23:49:43] [INFO ] Implicit Places using invariants in 5073 ms returned []
[2024-05-24 23:49:43] [INFO ] Flow matrix only has 8873 transitions (discarded 886 similar events)
[2024-05-24 23:49:43] [INFO ] Invariant cache hit.
[2024-05-24 23:49:48] [INFO ] State equation strengthened by 5602 read => feed constraints.
[2024-05-24 23:50:18] [INFO ] Performed 450/2790 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:50:48] [INFO ] Performed 851/2790 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:51:18] [INFO ] Performed 997/2790 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 23:51:51] [INFO ] Performed 1229/2790 implicitness test of which 0 returned IMPLICIT in 122 seconds.
[2024-05-24 23:51:51] [INFO ] Timeout of Implicit test with SMT after 122 seconds.
[2024-05-24 23:51:51] [INFO ] Implicit Places using invariants and state equation in 127307 ms returned []
Implicit Place search using SMT with State Equation took 132384 ms to find 0 implicit places.
[2024-05-24 23:51:52] [INFO ] Redundant transitions in 1156 ms returned []
Running 9665 sub problems to find dead transitions.
[2024-05-24 23:51:52] [INFO ] Flow matrix only has 8873 transitions (discarded 886 similar events)
[2024-05-24 23:51:52] [INFO ] Invariant cache hit.
[2024-05-24 23:51:52] [INFO ] State equation strengthened by 5602 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.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 0.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 1.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 1.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 0.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 1.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 1.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 1.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 1.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 1.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 1.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 1.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 1.0)
(s852 0.0)
(s853 0.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 0.0)
(s861 0.0)
(s862 1.0)
(s863 0.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 0.0)
(s872 0.0)
(s873 1.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 1.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 1.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 1.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 1.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 1.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 1.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 1.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 1.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 1.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 1.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 1.0)
(s978 0.0)
(s979 0.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 0.0)
(s988 0.0)
(s989 1.0)
(s990 0.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 0.0)
(s1000 0.0)
(s1001 1.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 1.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 1.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 1.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 1.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 1.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 1.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 1.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 1.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 1.0)
(s1078 0.0)
(s1079 0.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 0.0)
(s1089 0.0)
(s1090 1.0)
(s1091 0.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 0.0)
(s1102 0.0)
(s1103 1.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 1.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 1.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 1.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 1.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 1.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 1.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 1.0)
(s1156 0.0)
(s1157 0.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 0.0)
(s1168 0.0)
(s1169 1.0)
(s1170 0.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 0.0)
(s1182 0.0)
(s1183 1.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 1.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 1.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 1.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 1.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 1.0)
(s1216 0.0)
(s1217 0.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 0.0)
(s1229 0.0)
(s1230 1.0)
(s1231 0.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 0.0)
(s1244 0.0)
(s1245 1.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 1.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 1.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 1.0)
(s1262 0.0)
(s1263 0.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 0.0)
(s1276 0.0)
(s1277 1.0)
(s1278 0.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 0.0)
(s1292 0.0)
(s1293 1.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 1.0)
(s1298 0.0)
(s1299 0.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 0.0)
(s1313 0.0)
(s1314 1.0)
(s1315 0.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 0.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 0.0)
(s1346 0.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 0.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 0.0)
(s1403 0.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 0.0)
(s1433 0.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 0.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 0.0)
(s1462 0.0)
(s1463 1.0)
(s1464 0.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 0.0)
(s1479 0.0)
(s1480 1.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 1.0)
(s1485 0.0)
(s1486 0.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 0.0)
(s1499 0.0)
(s1500 1.0)
(s1501 0.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 0.0)
(s1515 0.0)
(s1516 1.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 1.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 1.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 1.0)
(s1533 0.0)
(s1534 0.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 0.0)
(s1546 0.0)
(s1547 1.0)
(s1548 0.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 0.0)
(s1561 0.0)
(s1562 1.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 1.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 1.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 1.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 1.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 1.0)
(s1595 0.0)
(s1596 0.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 0.0)
(s1607 0.0)
(s1608 1.0)
(s1609 0.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 0.0)
(s1621 0.0)
(s1622 1.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 1.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 1.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 1.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 1.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 1.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 1.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 1.0)
(s1675 0.0)
(s1676 0.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 0.0)
(s1686 0.0)
(s1687 1.0)
(s1688 0.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 0.0)
(s1699 0.0)
(s1700 1.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 1.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 1.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 1.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 1.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 1.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 1.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 1.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 1.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 1.0)
(s1777 0.0)
(s1778 0.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 0.0)
(s1787 0.0)
(s1788 1.0)
(s1789 0.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 0.0)
(s1799 0.0)
(s1800 1.0)
(s1801 0.0)
(s1802 0.0)
(s1803 0.0)
(s1804 0.0)
(s1805 1.0)
(s1806 0.0)
(s1807 0.0)
(s1808 0.0)
(s1809 0.0)
(s1810 0.0)
(s1811 0.0)
(s1812 1.0)
(s1813 0.0)
(s1814 0.0)
(s1815 0.0)
(s1816 0.0)
(s1817 0.0)
(s1818 0.0)
(s1819 0.0)
(s1820 0.0)
(s1821 1.0)
(s1822 0.0)
(s1823 0.0)
(s1824 0.0)
(s1825 0.0)
(s1826 0.0)
(s1827 0.0)
(s1828 0.0)
(s1829 0.0)
(s1830 0.0)
(s1831 0.0)
(s1832 1.0)
(s1833 0.0)
(s1834 0.0)
(s1835 0.0)
(s1836 0.0)
(s1837 0.0)
(s1838 0.0)
(s1839 0.0)
(s1840 0.0)
(s1841 0.0)
(s1842 0.0)
(s1843 0.0)
(s1844 0.0)
(s1845 1.0)
(s1846 0.0)
(s1847 0.0)
(s1848 0.0)
(s1849 0.0)
(s1850 0.0)
(s1851 0.0)
(s1852 0.0)
(s1853 0.0)
(s1854 0.0)
(s1855 0.0)
(s1856 0.0)
(s1857 0.0)
(s1858 0.0)
(s1859 1.0)
(s1860 0.0)
(s1861 0.0)
(s1862 0.0)
(s1863 0.0)
(s1864 0.0)
(s1865 0.0)
(s1866 0.0)
(s1867 0.0)
(s1868 0.0)
(s1869 0.0)
(s1870 0.0)
(s1871 0.0)
(s1872 1.0)
(s1873 0.0)
(s1874 0.0)
(s1875 0.0)
(s1876 0.0)
(s1877 0.0)
(s1878 0.0)
(s1879 0.0)
(s1880 0.0)
(s1881 0.0)
(s1882 0.0)
(s1883 1.0)
(s1884 0.0)
(s1885 0.0)
(s1886 0.0)
(s1887 0.0)
(s1888 0.0)
(s1889 0.0)
(s1890 0.0)
(s1891 0.0)
(s1892 1.0)
(s1893 0.0)
(s1894 0.0)
(s1895 0.0)
(s1896 0.0)
(s1897 0.0)
(s1898 0.0)
(s1899 1.0)
(s1900 0.0)
(s1901 0.0)
(s1902 0.0)
(s1903 0.0)
(s1904 1.0)
(s1905 0.0)
(s1906 0.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 0.0)
(s1916 0.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 0.0)
(s1925 0.0)
(s1926 1.0)
(s1927 0.0)
(s1928 0.0)
(s1929 0.0)
(s1930 0.0)
(s1931 1.0)
(s1932 0.0)
(s1933 0.0)
(s1934 0.0)
(s1935 0.0)
(s1936 0.0)
(s1937 0.0)
(s1938 1.0)
(s1939 0.0)
(s1940 0.0)
(s1941 0.0)
(s1942 0.0)
(s1943 0.0)
(s1944 0.0)
(s1945 0.0)
(s1946 0.0)
(s1947 1.0)
(s1948 0.0)
(s1949 0.0)
(s1950 0.0)
(s1951 0.0)
(s1952 0.0)
(s1953 0.0)
(s1954 0.0)
(s1955 0.0)
(s1956 0.0)
(s1957 0.0)
(s1958 1.0)
(s1959 0.0)
(s1960 0.0)
(s1961 0.0)
(s1962 0.0)
(s1963 0.0)
(s1964 0.0)
(s1965 0.0)
(s1966 0.0)
(s1967 0.0)
(s1968 0.0)
(s1969 0.0)
(s1970 0.0)
(s1971 1.0)
(s1972 0.0)
(s1973 0.0)
(s1974 0.0)
(s1975 0.0)
(s1976 0.0)
(s1977 0.0)
(s1978 0.0)
(s1979 0.0)
(s1980 0.0)
(s1981 0.0)
(s1982 0.0)
(s1983 0.0)
(s1984 0.0)
(s1985 0.0)
(s1986 1.0)
(s1987 0.0)
(s1988 0.0)
(s1989 0.0)
(s1990 0.0)
(s1991 0.0)
(s1992 0.0)
(s1993 0.0)
(s1994 0.0)
(s1995 0.0)
(s1996 0.0)
(s1997 0.0)
(s1998 0.0)
(s1999 0.0)
(s2000 0.0)
(s2001 0.0)
(s2002 1.0)
(s2003 0.0)
(s2004 0.0)
(s2005 0.0)
(s2006 0.0)
(s2007 0.0)
(s2008 0.0)
(s2009 0.0)
(s2010 0.0)
(s2011 0.0)
(s2012 0.0)
(s2013 0.0)
(s2014 0.0)
(s2015 0.0)
(s2016 0.0)
(s2017 1.0)
(s2018 0.0)
(s2019 0.0)
(s2020 0.0)
(s2021 0.0)
(s2022 0.0)
(s2023 0.0)
(s2024 0.0)
(s2025 0.0)
(s2026 0.0)
(s2027 0.0)
(s2028 0.0)
(s2029 0.0)
(s2030 1.0)
(s2031 0.0)
(s2032 0.0)
(s2033 0.0)
(s2034 0.0)
(s2035 0.0)
(s2036 0.0)
(s2037 0.0)
(s2038 0.0)
(s2039 0.0)
(s2040 0.0)
(s2041 1.0)
(s2042 0.0)
(s2043 0.0)
(s2044 0.0)
(s2045 0.0)
(s2046 0.0)
(s2047 0.0)
(s2048 0.0)
(s2049 0.0)
(s2050 1.0)
(s2051 0.0)
(s2052 0.0)
(s2053 0.0)
(s2054 0.0)
(s2055 0.0)
(s2056 0.0)
(s2057 1.0)
(s2058 0.0)
(s2059 0.0)
(s2060 0.0)
(s2061 0.0)
(s2062 1.0)
(s2063 0.0)
(s2064 0.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 0.0)
(s2073 0.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 0.0)
(s2081 0.0)
(s2082 1.0)
(s2083 0.0)
(s2084 0.0)
(s2085 0.0)
(s2086 0.0)
(s2087 1.0)
(s2088 0.0)
(s2089 0.0)
(s2090 0.0)
(s2091 0.0)
(s2092 0.0)
(s2093 0.0)
(s2094 1.0)
(s2095 0.0)
(s2096 0.0)
(s2097 0.0)
(s2098 0.0)
(s2099 0.0)
(s2100 0.0)
(s2101 0.0)
(s2102 0.0)
(s2103 1.0)
(s2104 0.0)
(s2105 0.0)
(s2106 0.0)
(s2107 0.0)
(s2108 0.0)
(s2109 0.0)
(s2110 0.0)
(s2111 0.0)
(s2112 0.0)
(s2113 0.0)
(s2114 1.0)
(s2115 0.0)
(s2116 0.0)
(s2117 0.0)
(s2118 0.0)
(s2119 0.0)
(s2120 0.0)
(s2121 0.0)
(s2122 0.0)
(s2123 0.0)
(s2124 0.0)
(s2125 0.0)
(s2126 0.0)
(s2127 1.0)
(s2128 0.0)
(s2129 0.0)
(s2130 0.0)
(s2131 0.0)
(s2132 0.0)
(s2133 0.0)
(s2134 0.0)
(s2135 0.0)
(s2136 0.0)
(s2137 0.0)
(s2138 0.0)
(s2139 0.0)
(s2140 0.0)
(s2141 0.0)
(s2142 1.0)
(s2143 0.0)
(s2144 0.0)
(s2145 0.0)
(s2146 0.0)
(s2147 0.0)
(s2148 0.0)
(s2149 0.0)
(s2150 0.0)
(s2151 0.0)
(s2152 0.0)
(s2153 0.0)
(s2154 0.0)
(s2155 0.0)
(s2156 0.0)
(s2157 0.0)
(s2158 0.0)
(s2159 1.0)
(s2160 0.0)
(s2161 0.0)
(s2162 0.0)
(s2163 0.0)
(s2164 0.0)
(s2165 0.0)
(s2166 0.0)
(s2167 0.0)
(s2168 0.0)
(s2169 0.0)
(s2170 0.0)
(s2171 0.0)
(s2172 0.0)
(s2173 0.0)
(s2174 0.0)
(s2175 0.0)
(s2176 0.0)
(s2177 1.0)
(s2178 0.0)
(s2179 0.0)
(s2180 0.0)
(s2181 0.0)
(s2182 0.0)
(s2183 0.0)
(s2184 0.0)
(s2185 0.0)
(s2186 0.0)
(s2187 0.0)
(s2188 0.0)
(s2189 0.0)
(s2190 0.0)
(s2191 0.0)
(s2192 0.0)
(s2193 0.0)
(s2194 1.0)
(s2195 0.0)
(s2196 0.0)
(s2197 0.0)
(s2198 0.0)
(s2199 0.0)
(s2200 0.0)
(s2201 0.0)
(s2202 0.0)
(s2203 0.0)
(s2204 0.0)
(s2205 0.0)
(s2206 0.0)
(s2207 0.0)
(s2208 0.0)
(s2209 1.0)
(s2210 0.0)
(s2211 0.0)
(s2212 0.0)
(s2213 0.0)
(s2214 0.0)
(s2215 0.0)
(s2216 0.0)
(s2217 0.0)
(s2218 0.0)
(s2219 0.0)
(s2220 0.0)
(s2221 0.0)
(s2222 1.0)
(s2223 0.0)
(s2224 0.0)
(s2225 0.0)
(s2226 0.0)
(s2227 0.0)
(s2228 0.0)
(s2229 0.0)
(s2230 0.0)
(s2231 0.0)
(s2232 0.0)
(s2233 1.0)
(s2234 0.0)
(s2235 0.0)
(s2236 0.0)
(s2237 0.0)
(s2238 0.0)
(s2239 0.0)
(s2240 0.0)
(s2241 0.0)
(s2242 1.0)
(s2243 0.0)
(s2244 0.0)
(s2245 0.0)
(s2246 0.0)
(s2247 0.0)
(s2248 0.0)
(s2249 1.0)
(s2250 0.0)
(s2251 0.0)
(s2252 0.0)
(s2253 0.0)
(s2254 1.0)
(s2255 0.0)
(s2256 0.0)
(s2257 1.0)
(s2258 1.0)
(s2259 1.0)
(s2260 1.0)
(s2261 1.0)
(s2262 1.0)
(s2263 0.0)
(s2264 0.0)
(s2265 1.0)
(s2266 1.0)
(s2267 1.0)
(s2268 1.0)
(s2269 1.0)
(s2270 0.0)
(s2271 0.0)
(s2272 1.0)
(s2273 0.0)
(s2274 0.0)
(s2275 0.0)
(s2276 0.0)
(s2277 1.0)
(s2278 0.0)
(s2279 0.0)
(s2280 0.0)
(s2281 0.0)
(s2282 0.0)
(s2283 0.0)
(s2284 1.0)
(s2285 0.0)
(s2286 0.0)
(s2287 0.0)
(s2288 0.0)
(s2289 0.0)
(s2290 0.0)
(s2291 0.0)
(s2292 0.0)
(s2293 1.0)
(s2294 0.0)
(s2295 0.0)
(s2296 0.0)
(s2297 0.0)
(s2298 0.0)
(s2299 0.0)
(s2300 0.0)
(s2301 0.0)
(s2302 0.0)
(s2303 0.0)
(s2304 1.0)
(s2305 0.0)
(s2306 0.0)
(s2307 0.0)
(s2308 0.0)
(s2309 0.0)
(s2310 0.0)
(s2311 0.0)
(s2312 0.0)
(s2313 0.0)
(s2314 0.0)
(s2315 0.0)
(s2316 0.0)
(s2317 1.0)
(s2318 0.0)
(s2319 0.0)
(s2320 0.0)
(s2321 0.0)
(s2322 0.0)
(s2323 0.0)
(s2324 0.0)
(s2325 0.0)
(s2326 0.0)
(s2327 0.0)
(s2328 0.0)
(s2329 0.0)
(s2330 0.0)
(s2331 0.0)
(s2332 1.0)
(s2333 0.0)
(s2334 0.0)
(s2335 0.0)
(s2336 0.0)
(s2337 0.0)
(s2338 0.0)
(s2339 0.0)
(s2340 0.0)
(s2341 0.0)
(s2342 0.0)
(s2343 0.0)
(s2344 0.0)
(s2345 0.0)
(s2346 0.0)
(s2347 0.0)
(s2348 0.0)
(s2349 1.0)
(s2350 0.0)
(s2351 0.0)
(s2352 0.0)
(s2353 0.0)
(s2354 0.0)
(s2355 0.0)
(s2356 0.0)
(s2357 0.0)
(s2358 0.0)
(s2359 0.0)
(s2360 0.0)
(s2361 0.0)
(s2362 0.0)
(s2363 0.0)
(s2364 0.0)
(s2365 0.0)
(s2366 0.0)
(s2367 0.0)
(s2368 1.0)
(s2369 0.0)
(s2370 0.0)
(s2371 0.0)
(s2372 0.0)
(s2373 0.0)
(s2374 0.0)
(s2375 0.0)
(s2376 0.0)
(s2377 0.0)
(s2378 0.0)
(s2379 0.0)
(s2380 0.0)
(s2381 0.0)
(s2382 0.0)
(s2383 0.0)
(s2384 0.0)
(s2385 0.0)
(s2386 0.0)
(s2387 0.0)
(s2388 1.0)
(s2389 0.0)
(s2390 0.0)
(s2391 0.0)
(s2392 0.0)
(s2393 0.0)
(s2394 0.0)
(s2395 0.0)
(s2396 0.0)
(s2397 0.0)
(s2398 0.0)
(s2399 0.0)
(s2400 0.0)
(s2401 0.0)
(s2402 0.0)
(s2403 0.0)
(s2404 0.0)
(s2405 0.0)
(s2406 0.0)
(s2407 1.0)
(s2408 0.0)
(s2409 0.0)
(s2410 0.0)
(s2411 0.0)
(s2412 0.0)
(s2413 0.0)
(s2414 0.0)
(s2415 0.0)
(s2416 0.0)
(s2417 0.0)
(s2418 0.0)
(s2419 0.0)
(s2420 0.0)
(s2421 0.0)
(s2422 0.0)
(s2423 0.0)
(s2424 1.0)
(s2425 0.0)
(s2426 0.0)
(s2427 0.0)
(s2428 0.0)
(s2429 0.0)
(s2430 0.0)
(s2431 0.0)
(s2432 0.0)
(s2433 0.0)
(s2434 0.0)
(s2435 0.0)
(s2436 0.0)
(s2437 0.0)
(s2438 0.0)
(s2439 1.0)
(s2440 0.0)
(s2441 0.0)
(s2442 0.0)
(s2443 0.0)
(s2444 0.0)
(s2445 0.0)
(s2446 0.0)
(s2447 0.0)
(s2448 0.0)
(s2449 0.0)
(s2450 0.0)
(s2451 0.0)
(s2452 1.0)
(s2453 0.0)
(s2454 0.0)
(s2455 0.0)
(s2456 0.0)
(s2457 0.0)
(s2458 0.0)
(s2459 0.0)
(s2460 0.0)
(s2461 0.0)
(s2462 0.0)
(s2463 1.0)
(s2464 0.0)
(s2465 0.0)
(s2466 0.0)
(s2467 0.0)
(s2468 0.0)
(s2469 0.0)
(s2470 0.0)
(s2471 0.0)
(s2472 1.0)
(s2473 0.0)
(s2474 0.0)
(s2475 0.0)
(s2476 0.0)
(s2477 0.0)
(s2478 0.0)
(s2479 1.0)
(s2480 0.0)
(s2481 0.0)
(s2482 0.0)
(s2483 0.0)
(s2484 1.0)
(s2485 0.0)
(s2486 0.0)
(s2487 1.0)
(s2488 1.0)
(s2489 1.0)
(s2490 1.0)
(s2491 0.0)
(s2492 1.0)
(s2493 1.0)
(s2494 1.0)
(s2495 1.0)
(s2496 0.0)
(s2497 0.0)
(s2498 1.0)
(s2499 timeout
0.0)
(s2500 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2788 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9665 unsolved
SMT process timed out in 94114ms, After SMT, problems are : Problem set: 0 solved, 9665 unsolved
Search for dead transitions found 0 dead transitions in 94218ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228351 ms. Remains : 2790/2790 places, 9759/9759 transitions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 44 ms :[p0]
Stuttering acceptance computed with spot in 40 ms :[p0]
Product exploration explored 100000 steps with 2296 reset in 1141 ms.
Product exploration explored 100000 steps with 2296 reset in 1173 ms.
Built C files in :
/tmp/ltsmin4811559168386561872
[2024-05-24 23:53:29] [INFO ] Too many transitions (7060) to apply POR reductions. Disabling POR matrices.
[2024-05-24 23:53:29] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4811559168386561872
Running compilation step : cd /tmp/ltsmin4811559168386561872;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4811559168386561872;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4811559168386561872;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 3081 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3081/3081 places, 7060/7060 transitions.
Applied a total of 0 rules in 545 ms. Remains 3081 /3081 variables (removed 0) and now considering 7060/7060 (removed 0) transitions.
[2024-05-24 23:53:32] [INFO ] Flow matrix only has 6460 transitions (discarded 600 similar events)
// Phase 1: matrix 6460 rows 3081 cols
[2024-05-24 23:53:32] [INFO ] Computed 59 invariants in 162 ms
[2024-05-24 23:53:37] [INFO ] Implicit Places using invariants in 4672 ms returned []
[2024-05-24 23:53:37] [INFO ] Flow matrix only has 6460 transitions (discarded 600 similar events)
[2024-05-24 23:53:37] [INFO ] Invariant cache hit.
[2024-05-24 23:53:39] [INFO ] State equation strengthened by 2612 read => feed constraints.
[2024-05-24 23:54:10] [INFO ] Performed 1121/3081 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:54:40] [INFO ] Performed 2048/3081 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:55:04] [INFO ] Implicit Places using invariants and state equation in 87072 ms returned []
Implicit Place search using SMT with State Equation took 91748 ms to find 0 implicit places.
[2024-05-24 23:55:05] [INFO ] Redundant transitions in 607 ms returned []
Running 7035 sub problems to find dead transitions.
[2024-05-24 23:55:05] [INFO ] Flow matrix only has 6460 transitions (discarded 600 similar events)
[2024-05-24 23:55:05] [INFO ] Invariant cache hit.
[2024-05-24 23:55:05] [INFO ] State equation strengthened by 2612 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3079 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7035 unsolved
SMT process timed out in 44996ms, After SMT, problems are : Problem set: 0 solved, 7035 unsolved
Search for dead transitions found 0 dead transitions in 45054ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 137976 ms. Remains : 3081/3081 places, 7060/7060 transitions.
Built C files in :
/tmp/ltsmin10656023571439540621
[2024-05-24 23:55:50] [INFO ] Too many transitions (7060) to apply POR reductions. Disabling POR matrices.
[2024-05-24 23:55:50] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10656023571439540621
Running compilation step : cd /tmp/ltsmin10656023571439540621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10656023571439540621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10656023571439540621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 23:55:53] [INFO ] Flatten gal took : 150 ms
[2024-05-24 23:55:53] [INFO ] Flatten gal took : 154 ms
[2024-05-24 23:55:53] [INFO ] Time to serialize gal into /tmp/LTL15063354257937381672.gal : 31 ms
[2024-05-24 23:55:53] [INFO ] Time to serialize properties into /tmp/LTL3433563941206372572.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15063354257937381672.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13383647543958938437.hoa' '-atoms' '/tmp/LTL3433563941206372572.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3433563941206372572.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13383647543958938437.hoa
Detected timeout of ITS tools.
[2024-05-24 23:56:09] [INFO ] Flatten gal took : 155 ms
[2024-05-24 23:56:09] [INFO ] Flatten gal took : 162 ms
[2024-05-24 23:56:09] [INFO ] Time to serialize gal into /tmp/LTL8135784484051213991.gal : 29 ms
[2024-05-24 23:56:09] [INFO ] Time to serialize properties into /tmp/LTL15425883382907646816.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8135784484051213991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15425883382907646816.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((Node3ThinksNode14ShouldBeNodeMasterToReplaceNode13<1)||(Node14NotifyThatHeIsActive<1))"))||(G("((NodesCanDetectThatNode10Ha...232
Formula 0 simplified : G(F!"((Node3ThinksNode14ShouldBeNodeMasterToReplaceNode13<1)||(Node14NotifyThatHeIsActive<1))" & F!"((NodesCanDetectThatNode10HasCra...224
Detected timeout of ITS tools.
[2024-05-24 23:56:24] [INFO ] Flatten gal took : 160 ms
[2024-05-24 23:56:24] [INFO ] Applying decomposition
[2024-05-24 23:56:24] [INFO ] Flatten gal took : 181 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12341298638802557827.txt' '-o' '/tmp/graph12341298638802557827.bin' '-w' '/tmp/graph12341298638802557827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12341298638802557827.bin' '-l' '-1' '-v' '-w' '/tmp/graph12341298638802557827.weights' '-q' '0' '-e' '0.001'
[2024-05-24 23:56:24] [INFO ] Decomposing Gal with order
[2024-05-24 23:56:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 23:56:25] [INFO ] Removed a total of 6649 redundant transitions.
[2024-05-24 23:56:26] [INFO ] Flatten gal took : 779 ms
[2024-05-24 23:56:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 5604 labels/synchronizations in 297 ms.
[2024-05-24 23:56:26] [INFO ] Time to serialize gal into /tmp/LTL2391435959908442659.gal : 46 ms
[2024-05-24 23:56:26] [INFO ] Time to serialize properties into /tmp/LTL14502346366282112273.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2391435959908442659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14502346366282112273.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i11.u93.Node3ThinksNode14ShouldBeNodeMasterToReplaceNode13<1)||(i16.u175.Node14NotifyThatHeIsActive<1))"))||(G("((i16.u179....267
Formula 0 simplified : G(F!"((i11.u93.Node3ThinksNode14ShouldBeNodeMasterToReplaceNode13<1)||(i16.u175.Node14NotifyThatHeIsActive<1))" & F!"((i16.u179.Node...259

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S24C06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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