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.r136-tall-171631131800027.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 DatabaseWithMutex-COL-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631131800027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.1K Apr 11 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 11 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 20:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 19:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 38K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716328022203

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-21 21:47:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:47:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:47:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 21:47:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 21:47:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2024-05-21 21:47:03] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 3260 PT places and 3200.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 21:47:04] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 8 ms.
[2024-05-21 21:47:04] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 3 formulas.
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40043 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/26 properties
BEST_FIRST walk for 40003 steps (8 resets) in 363 ms. (109 steps per ms) remains 1/1 properties
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 21:47:04] [INFO ] Computed 4 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/11 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Int declared 2/19 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 186ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 21:47:04] [INFO ] Flatten gal took : 12 ms
[2024-05-21 21:47:04] [INFO ] Flatten gal took : 2 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2024-05-21 21:47:04] [INFO ] Unfolded HLPN to a Petri net with 3260 places and 3200 transitions 23200 arcs in 68 ms.
[2024-05-21 21:47:04] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 3260 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 41 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-21 21:47:05] [INFO ] Computed 460 invariants in 205 ms
[2024-05-21 21:47:05] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-05-21 21:47:05] [INFO ] Invariant cache hit.
[2024-05-21 21:47:08] [INFO ] Implicit Places using invariants and state equation in 2206 ms returned []
Implicit Place search using SMT with State Equation took 3142 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:47:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32368ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32440ms
Finished structural reductions in LTL mode , in 1 iterations and 35666 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Support contains 3260 out of 3260 places after structural reductions.
[2024-05-21 21:47:41] [INFO ] Flatten gal took : 447 ms
[2024-05-21 21:47:41] [INFO ] Flatten gal took : 263 ms
[2024-05-21 21:47:41] [INFO ] Input system was already deterministic with 3200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1565 ms. (25 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
[2024-05-21 21:47:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 494/514 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 887/1401 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1401 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:47:42] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1401 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1401 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1402 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1840/3242 variables, 400/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3242 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/3260 variables, 18/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3260 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3200/6460 variables, 3260/3721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/6460 variables, 0/3721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/6460 variables, 0/3721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6460/6460 variables, and 3721 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 401/401 constraints, State Equation: 3260/3260 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 494/514 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 887/1401 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1401 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1401 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1401 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1402 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1402 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1840/3242 variables, 400/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3242 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/3260 variables, 18/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3260 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3200/6460 variables, 3260/3721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6460/6460 variables, and 3722 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3842 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 401/401 constraints, State Equation: 3260/3260 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 8929ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 420 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 800 transitions
Trivial Post-agglo rules discarded 800 transitions
Performed 800 trivial Post agglomeration. Transition count delta: 800
Iterating post reduction 1 with 1220 rules applied. Total rules applied 1620 place count 2840 transition count 2000
Reduce places removed 800 places and 0 transitions.
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 400
Iterating post reduction 2 with 1200 rules applied. Total rules applied 2820 place count 2040 transition count 1600
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 3 with 400 rules applied. Total rules applied 3220 place count 1640 transition count 1600
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 400 Pre rules applied. Total rules applied 3220 place count 1640 transition count 1200
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 4 with 800 rules applied. Total rules applied 4020 place count 1240 transition count 1200
Free-agglomeration rule applied 400 times.
Iterating global reduction 4 with 400 rules applied. Total rules applied 4420 place count 1240 transition count 800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 4 with 400 rules applied. Total rules applied 4820 place count 840 transition count 800
Applied a total of 4820 rules in 4067 ms. Remains 840 /3260 variables (removed 2420) and now considering 800/3200 (removed 2400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4068 ms. Remains : 840/3260 places, 800/3200 transitions.
RANDOM walk for 804 steps (0 resets) in 35 ms. (22 steps per ms) remains 0/1 properties
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(p1))))'
Support contains 800 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 94 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:47:56] [INFO ] Invariant cache hit.
[2024-05-21 21:47:58] [INFO ] Implicit Places using invariants in 2357 ms returned []
[2024-05-21 21:47:58] [INFO ] Invariant cache hit.
[2024-05-21 21:48:05] [INFO ] Implicit Places using invariants and state equation in 7358 ms returned []
Implicit Place search using SMT with State Equation took 9722 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:48:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32286ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32321ms
Finished structural reductions in LTL mode , in 1 iterations and 42150 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 4 ms.
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-01 finished in 42603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 125 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:48:38] [INFO ] Invariant cache hit.
[2024-05-21 21:48:39] [INFO ] Implicit Places using invariants in 1254 ms returned []
[2024-05-21 21:48:39] [INFO ] Invariant cache hit.
[2024-05-21 21:48:44] [INFO ] Implicit Places using invariants and state equation in 4928 ms returned []
Implicit Place search using SMT with State Equation took 6189 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:48:44] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.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)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.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 0.0)
(s820 1.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 0.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 0.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.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 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.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 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.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 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.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 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.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 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.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 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 0.0)
(s1239 1.0)
(s1240 1.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 1.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 1.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 1.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 1.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 1.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 1.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 1.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 1.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 1.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 1.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 1.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 1.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 1.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 1.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 1.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 1.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 1.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 1.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 1.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.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 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.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 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.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 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.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 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.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 0.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 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 1.0)
(s2081 1.0)
(s2082 1.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 1.0)
(s2100 1.0)
(s2101 1.0)
(s2102 1.0)
(s2103 1.0)
(s2104 1.0)
(s2105 1.0)
(s2106 1.0)
(s2107 1.0)
(s2108 1.0)
(s2109 1.0)
(s2110 1.0)
(s2111 1.0)
(s2112 1.0)
(s2113 1.0)
(s2114 1.0)
(s2115 1.0)
(s2116 1.0)
(s2117 1.0)
(s2118 1.0)
(s2119 1.0)
(s2120 1.0)
(s2121 1.0)
(s2122 1.0)
(s2123 1.0)
(s2124 1.0)
(s2125 1.0)
(s2126 1.0)
(s2127 1.0)
(s2128 1.0)
(s2129 1.0)
(s2130 1.0)
(s2131 1.0)
(s2132 1.0)
(s2133 1.0)
(s2134 1.0)
(s2135 1.0)
(s2136 1.0)
(s2137 1.0)
(s2138 1.0)
(s2139 1.0)
(s2140 1.0)
(s2141 1.0)
(s2142 1.0)
(s2143 1.0)
(s2144 1.0)
(s2145 1.0)
(s2146 1.0)
(s2147 1.0)
(s2148 1.0)
(s2149 1.0)
(s2150 1.0)
(s2151 1.0)
(s2152 1.0)
(s2153 1.0)
(s2154 1.0)
(s2155 1.0)
(s2156 1.0)
(s2157 1.0)
(s2158 1.0)
(s2159 1.0)
(s2160 1.0)
(s2161 1.0)
(s2162 1.0)
(s2163 1.0)
(s2164 1.0)
(s2165 1.0)
(s2166 1.0)
(s2167 1.0)
(s2168 1.0)
(s2169 1.0)
(s2170 1.0)
(s2171 1.0)
(s2172 1.0)
(s2173 1.0)
(s2174 1.0)
(s2175 1.0)
(s2176 1.0)
(s2177 1.0)
(s2178 1.0)
(s2179 1.0)
(s2180 1.0)
(s2181 1.0)
(s2182 1.0)
(s2183 1.0)
(s2184 1.0)
(s2185 1.0)
(s2186 1.0)
(s2187 1.0)
(s2188 1.0)
(s2189 1.0)
(s2190 1.0)
(s2191 1.0)
(s2192 1.0)
(s2193 1.0)
(s2194 1.0)
(s2195 1.0)
(s2196 1.0)
(s2197 1.0)
(s2198 1.0)
(s2199 1.0)
(s2200 1.0)
(s2201 1.0)
(s2202 1.0)
(s2203 1.0)
(s2204 1.0)
(s2205 1.0)
(s2206 1.0)
(s2207 1.0)
(s2208 1.0)
(s2209 1.0)
(s2210 1.0)
(s2211 1.0)
(s2212 1.0)
(s2213 1.0)
(s2214 1.0)
(s2215 1.0)
(s2216 1.0)
(s2217 1.0)
(s2218 1.0)
(s2219 1.0)
(s2220 1.0)
(s2221 1.0)
(s2222 1.0)
(s2223 1.0)
(s2224 1.0)
(s2225 1.0)
(s2226 1.0)
(s2227 1.0)
(s2228 1.0)
(s2229 1.0)
(s2230 1.0)
(s2231 1.0)
(s2232 1.0)
(s2233 1.0)
(s2234 1.0)
(s2235 1.0)
(s2236 1.0)
(s2237 1.0)
(s2238 1.0)
(s2239 1.0)
(s2240 1.0)
(s2241 1.0)
(s2242 1.0)
(s2243 1.0)
(s2244 1.0)
(s2245 1.0)
(s2246 1.0)
(s2247 1.0)
(s2248 1.0)
(s2249 1.0)
(s2250 1.0)
(s2251 1.0)
(s2252 1.0)
(s2253 1.0)
(s2254 1.0)
(s2255 1.0)
(s2256 1.0)
(s2257 1.0)
(s2258 1.0)
(s2259 1.0)
(s2260 1.0)
(s2261 1.0)
(s2262 1.0)
(s2263 1.0)
(s2264 1.0)
(s2265 1.0)
(s2266 1.0)
(s2267 1.0)
(s2268 1.0)
(s2269 1.0)
(s2270 1.0)
(s2271 1.0)
(s2272 1.0)
(s2273 1.0)
(s2274 1.0)
(s2275 1.0)
(s2276 1.0)
(s2277 1.0)
(s2278 1.0)
(s2279 1.0)
(s2280 1.0)
(s2281 1.0)
(s2282 1.0)
(s2283 1.0)
(s2284 1.0)
(s2285 1.0)
(s2286 1.0)
(s2287 1.0)
(s2288 1.0)
(s2289 1.0)
(s2290 1.0)
(s2291 1.0)
(s2292 1.0)
(s2293 1.0)
(s2294 1.0)
(s2295 1.0)
(s2296 1.0)
(s2297 1.0)
(s2298 1.0)
(s2299 1.0)
(s2300 1.0)
(s2301 1.0)
(s2302 1.0)
(s2303 1.0)
(s2304 1.0)
(s2305 1.0)
(s2306 1.0)
(s2307 1.0)
(s2308 1.0)
(s2309 1.0)
(s2310 1.0)
(s2311 1.0)
(s2312 1.0)
(s2313 1.0)
(s2314 1.0)
(s2315 1.0)
(s2316 1.0)
(s2317 1.0)
(s2318 1.0)
(s2319 1.0)
(s2320 1.0)
(s2321 1.0)
(s2322 1.0)
(s2323 1.0)
(s2324 1.0)
(s2325 1.0)
(s2326 1.0)
(s2327 1.0)
(s2328 1.0)
(s2329 1.0)
(s2330 1.0)
(s2331 1.0)
(s2332 1.0)
(s2333 1.0)
(s2334 1.0)
(s2335 1.0)
(s2336 1.0)
(s2337 1.0)
(s2338 1.0)
(s2339 1.0)
(s2340 1.0)
(s2341 1.0)
(s2342 1.0)
(s2343 1.0)
(s2344 1.0)
(s2345 1.0)
(s2346 1.0)
(s2347 1.0)
(s2348 1.0)
(s2349 1.0)
(s2350 1.0)
(s2351 1.0)
(s2352 1.0)
(s2353 1.0)
(s2354 1.0)
(s2355 1.0)
(s2356 1.0)
(s2357 1.0)
(s2358 1.0)
(s2359 1.0)
(s2360 1.0)
(s2361 1.0)
(s2362 1.0)
(s2363 1.0)
(s2364 1.0)
(s2365 1.0)
(s2366 1.0)
(s2367 1.0)
(s2368 1.0)
(s2369 1.0)
(s2370 1.0)
(s2371 1.0)
(s2372 1.0)
(s2373 1.0)
(s2374 1.0)
(s2375 1.0)
(s2376 1.0)
(s2377 1.0)
(s2378 1.0)
(s2379 1.0)
(s2380 1.0)
(s2381 1.0)
(s2382 1.0)
(s2383 1.0)
(s2384 1.0)
(s2385 1.0)
(s2386 1.0)
(s2387 1.0)
(s2388 1.0)
(s2389 1.0)
(s2390 1.0)
(s2391 1.0)
(s2392 1.0)
(s2393 1.0)
(s2394 1.0)
(s2395 1.0)
(s2396 1.0)
(s2397 1.0)
(s2398 1.0)
(s2399 1.0)
(s2400 1.0)
(s2401 1.0)
(s2402 1.0)
(s2403 1.0)
(s2404 1.0)
(s2405 1.0)
(s2406 1.0)
(s2407 1.0)
(s2408 1.0)
(s2409 1.0)
(s2410 1.0)
(s2411 1.0)
(s2412 1.0)
(s2413 1.0)
(s2414 1.0)
(s2415 1.0)
(s2416 1.0)
(s2417 1.0)
(s2418 1.0)
(s2419 1.0)
(s2420 1.0)
(s2421 0.0)
(s2422 0.0)
(s2423 0.0)
(s2424 0.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 0.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 0.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 0.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 0.0)
(s2473 0.0)
(s2474 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32083ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32115ms
Finished structural reductions in LTL mode , in 1 iterations and 38441 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-03 finished in 38686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||G(!p1))))'
Support contains 800 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 165 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:49:17] [INFO ] Invariant cache hit.
[2024-05-21 21:49:18] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2024-05-21 21:49:18] [INFO ] Invariant cache hit.
[2024-05-21 21:49:23] [INFO ] Implicit Places using invariants and state equation in 5255 ms returned []
Implicit Place search using SMT with State Equation took 6624 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:49:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 31925ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 31957ms
Finished structural reductions in LTL mode , in 1 iterations and 38762 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 2460 ms.
Product exploration explored 100000 steps with 50000 reset in 2286 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 36 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-05 finished in 47392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 420 out of 3260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 400 transitions
Trivial Post-agglo rules discarded 400 transitions
Performed 400 trivial Post agglomeration. Transition count delta: 400
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 3260 transition count 2800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 800 place count 2860 transition count 2800
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 800 Pre rules applied. Total rules applied 800 place count 2860 transition count 2000
Deduced a syphon composed of 800 places in 1 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 2 with 1600 rules applied. Total rules applied 2400 place count 2060 transition count 2000
Applied a total of 2400 rules in 411 ms. Remains 2060 /3260 variables (removed 1200) and now considering 2000/3200 (removed 1200) transitions.
// Phase 1: matrix 2000 rows 2060 cols
[2024-05-21 21:50:05] [INFO ] Computed 460 invariants in 57 ms
[2024-05-21 21:50:08] [INFO ] Implicit Places using invariants in 3687 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 3700 ms to find 400 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1660/3260 places, 2000/3200 transitions.
Applied a total of 0 rules in 74 ms. Remains 1660 /1660 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4185 ms. Remains : 1660/3260 places, 2000/3200 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 2488 ms.
Product exploration explored 100000 steps with 0 reset in 2661 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 :[(NOT p0)]
RANDOM walk for 148 steps (0 resets) in 9 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 2000 rows 1660 cols
[2024-05-21 21:50:15] [INFO ] Computed 60 invariants in 111 ms
[2024-05-21 21:50:19] [INFO ] [Real]Absence check using 54 positive place invariants in 17 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-06 finished in 14704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)&&p0))||X(X(G(p2)))))'
Support contains 1220 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 80 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-21 21:50:19] [INFO ] Computed 460 invariants in 52 ms
[2024-05-21 21:50:20] [INFO ] Implicit Places using invariants in 1298 ms returned []
[2024-05-21 21:50:20] [INFO ] Invariant cache hit.
[2024-05-21 21:50:25] [INFO ] Implicit Places using invariants and state equation in 4909 ms returned []
Implicit Place search using SMT with State Equation took 6210 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:50:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 31934ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 31963ms
Finished structural reductions in LTL mode , in 1 iterations and 38270 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-08
Product exploration explored 100000 steps with 3797 reset in 4286 ms.
Product exploration explored 100000 steps with 3803 reset in 4314 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 121 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 1011 steps (0 resets) in 278 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 16 factoid took 270 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
[2024-05-21 21:51:29] [INFO ] Invariant cache hit.
[2024-05-21 21:51:39] [INFO ] [Real]Absence check using 59 positive place invariants in 158 ms returned sat
[2024-05-21 21:51:41] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 1791 ms returned sat
[2024-05-21 21:51:44] [INFO ] [Real]Absence check using state equation in 3368 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1220 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 75 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:51:45] [INFO ] Invariant cache hit.
[2024-05-21 21:51:46] [INFO ] Implicit Places using invariants in 1205 ms returned []
[2024-05-21 21:51:46] [INFO ] Invariant cache hit.
[2024-05-21 21:51:50] [INFO ] Implicit Places using invariants and state equation in 4673 ms returned []
Implicit Place search using SMT with State Equation took 5885 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:51:50] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32122ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32154ms
Finished structural reductions in LTL mode , in 1 iterations and 38120 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
RANDOM walk for 1135 steps (0 resets) in 118 ms. (9 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
[2024-05-21 21:52:24] [INFO ] Invariant cache hit.
[2024-05-21 21:52:33] [INFO ] [Real]Absence check using 59 positive place invariants in 171 ms returned sat
[2024-05-21 21:52:35] [INFO ] [Real]Absence check using 59 positive and 401 generalized place invariants in 1649 ms returned sat
[2024-05-21 21:52:39] [INFO ] [Real]Absence check using state equation in 3967 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3792 reset in 3935 ms.
Product exploration explored 100000 steps with 3798 reset in 3964 ms.
Built C files in :
/tmp/ltsmin14691973767187539302
[2024-05-21 21:52:47] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14691973767187539302
Running compilation step : cd /tmp/ltsmin14691973767187539302;'/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/ltsmin14691973767187539302;'/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/ltsmin14691973767187539302;'/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 1220 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 77 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:52:50] [INFO ] Invariant cache hit.
[2024-05-21 21:52:51] [INFO ] Implicit Places using invariants in 1168 ms returned []
[2024-05-21 21:52:51] [INFO ] Invariant cache hit.
[2024-05-21 21:52:56] [INFO ] Implicit Places using invariants and state equation in 5068 ms returned []
Implicit Place search using SMT with State Equation took 6238 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:52:57] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 31867ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 31894ms
Finished structural reductions in LTL mode , in 1 iterations and 38217 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Built C files in :
/tmp/ltsmin11117521885636509533
[2024-05-21 21:53:28] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11117521885636509533
Running compilation step : cd /tmp/ltsmin11117521885636509533;'/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/ltsmin11117521885636509533;'/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/ltsmin11117521885636509533;'/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-21 21:53:32] [INFO ] Flatten gal took : 202 ms
[2024-05-21 21:53:32] [INFO ] Flatten gal took : 195 ms
[2024-05-21 21:53:32] [INFO ] Time to serialize gal into /tmp/LTL14263771027904054209.gal : 64 ms
[2024-05-21 21:53:32] [INFO ] Time to serialize properties into /tmp/LTL16290959651294843626.prop : 4 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/LTL14263771027904054209.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6358160391661978498.hoa' '-atoms' '/tmp/LTL16290959651294843626.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/LTL16290959651294843626.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6358160391661978498.hoa
Detected timeout of ITS tools.
[2024-05-21 21:53:48] [INFO ] Flatten gal took : 325 ms
[2024-05-21 21:53:48] [INFO ] Flatten gal took : 206 ms
[2024-05-21 21:53:48] [INFO ] Time to serialize gal into /tmp/LTL3206322492145404685.gal : 26 ms
[2024-05-21 21:53:48] [INFO ] Time to serialize properties into /tmp/LTL14507957272781426777.ltl : 5 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/LTL3206322492145404685.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14507957272781426777.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(("(((((((((((Acknowledge_0+Acknowledge_1)+(Acknowledge_2+Acknowledge_3))+((Acknowledge_4+Acknowledge_5)+(Acknowledge_6+Acknowled...29528
Formula 0 simplified : G(!"(((((((((((Acknowledge_0+Acknowledge_1)+(Acknowledge_2+Acknowledge_3))+((Acknowledge_4+Acknowledge_5)+(Acknowledge_6+Acknowledge...29514
Detected timeout of ITS tools.
[2024-05-21 21:54:03] [INFO ] Flatten gal took : 179 ms
[2024-05-21 21:54:03] [INFO ] Applying decomposition
[2024-05-21 21:54:04] [INFO ] Flatten gal took : 177 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/graph7330044874030283709.txt' '-o' '/tmp/graph7330044874030283709.bin' '-w' '/tmp/graph7330044874030283709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7330044874030283709.bin' '-l' '-1' '-v' '-w' '/tmp/graph7330044874030283709.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:54:06] [INFO ] Decomposing Gal with order
[2024-05-21 21:54:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:54:07] [INFO ] Removed a total of 8340 redundant transitions.
[2024-05-21 21:54:08] [INFO ] Flatten gal took : 1495 ms
[2024-05-21 21:54:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 680 labels/synchronizations in 232 ms.
[2024-05-21 21:54:09] [INFO ] Time to serialize gal into /tmp/LTL9182802871363400861.gal : 53 ms
[2024-05-21 21:54:09] [INFO ] Time to serialize properties into /tmp/LTL15149923647236342674.ltl : 3 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/LTL9182802871363400861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15149923647236342674.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(("(((((((((((gu420.Acknowledge_0+gu420.Acknowledge_1)+(gu420.Acknowledge_2+gu420.Acknowledge_3))+((gu420.Acknowledge_4+gu420.Ack...41768
Formula 0 simplified : G(!"(((((((((((gu420.Acknowledge_0+gu420.Acknowledge_1)+(gu420.Acknowledge_2+gu420.Acknowledge_3))+((gu420.Acknowledge_4+gu420.Ackno...41754
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-08 finished in 245267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(G(p1)))))'
Support contains 1200 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 67 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:54:24] [INFO ] Invariant cache hit.
[2024-05-21 21:54:30] [INFO ] Implicit Places using invariants in 6037 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 6061 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 87 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6217 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-09 finished in 6385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||G(p0)))))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 89 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:54:30] [INFO ] Invariant cache hit.
[2024-05-21 21:54:33] [INFO ] Implicit Places using invariants in 2447 ms returned []
[2024-05-21 21:54:33] [INFO ] Invariant cache hit.
[2024-05-21 21:54:40] [INFO ] Implicit Places using invariants and state equation in 7128 ms returned []
Implicit Place search using SMT with State Equation took 9579 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:54:40] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.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)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
SMT process timed out in 32248ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 32278ms
Finished structural reductions in LTL mode , in 1 iterations and 41960 ms. Remains : 3260/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-10 finished in 42154 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(F((p0&&((p1&&X(p1)) U X(p2)))))))'
Support contains 840 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 85 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:55:13] [INFO ] Invariant cache hit.
[2024-05-21 21:55:19] [INFO ] Implicit Places using invariants in 5918 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5934 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 60 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6079 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-12
Product exploration explored 100000 steps with 559 reset in 3005 ms.
Product exploration explored 100000 steps with 553 reset in 2989 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1566 ms. (25 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 775 ms. (51 steps per ms) remains 1/1 properties
// Phase 1: matrix 3200 rows 2860 cols
[2024-05-21 21:55:29] [INFO ] Computed 60 invariants in 221 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2008/2848 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2848 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2848 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/2860 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2860 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6060/6060 variables, and 2920 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2242 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 2860/2860 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2008/2848 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2848 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:55:34] [INFO ] Deduced a trap composed of 31 places in 2546 ms of which 33 ms to minimize.
[2024-05-21 21:55:37] [INFO ] Deduced a trap composed of 32 places in 2701 ms of which 17 ms to minimize.
SMT process timed out in 8498ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 840 out of 2860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Free-agglomeration rule applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2860 transition count 2800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 800 place count 2460 transition count 2800
Applied a total of 800 rules in 222 ms. Remains 2460 /2860 variables (removed 400) and now considering 2800/3200 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 2460/2860 places, 2800/3200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1563 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1041 ms. (38 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 151385 steps, run timeout after 3004 ms. (steps per millisecond=50 ) properties seen :0 out of 1
Probabilistic random walk after 151385 steps, saw 150895 distinct states, run finished after 3009 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 2800 rows 2460 cols
[2024-05-21 21:55:41] [INFO ] Computed 60 invariants in 192 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1610/2450 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2450 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2450 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/2460 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2460 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2800/5260 variables, 2460/2520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5260 variables, 0/2520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/5260 variables, 0/2520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5260/5260 variables, and 2520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1761 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 2460/2460 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1610/2450 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2450 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:55:45] [INFO ] Deduced a trap composed of 31 places in 1707 ms of which 13 ms to minimize.
[2024-05-21 21:55:47] [INFO ] Deduced a trap composed of 93 places in 1804 ms of which 13 ms to minimize.
[2024-05-21 21:55:49] [INFO ] Deduced a trap composed of 31 places in 1739 ms of which 14 ms to minimize.
[2024-05-21 21:55:51] [INFO ] Deduced a trap composed of 31 places in 1694 ms of which 14 ms to minimize.
[2024-05-21 21:55:52] [INFO ] Deduced a trap composed of 31 places in 1713 ms of which 14 ms to minimize.
[2024-05-21 21:55:54] [INFO ] Deduced a trap composed of 31 places in 1754 ms of which 14 ms to minimize.
[2024-05-21 21:55:56] [INFO ] Deduced a trap composed of 31 places in 1758 ms of which 14 ms to minimize.
[2024-05-21 21:55:58] [INFO ] Deduced a trap composed of 31 places in 1788 ms of which 14 ms to minimize.
[2024-05-21 21:55:59] [INFO ] Deduced a trap composed of 31 places in 1730 ms of which 13 ms to minimize.
[2024-05-21 21:56:01] [INFO ] Deduced a trap composed of 31 places in 1735 ms of which 13 ms to minimize.
[2024-05-21 21:56:03] [INFO ] Deduced a trap composed of 31 places in 1692 ms of which 13 ms to minimize.
[2024-05-21 21:56:05] [INFO ] Deduced a trap composed of 31 places in 1671 ms of which 13 ms to minimize.
[2024-05-21 21:56:06] [INFO ] Deduced a trap composed of 31 places in 1673 ms of which 13 ms to minimize.
[2024-05-21 21:56:08] [INFO ] Deduced a trap composed of 31 places in 1694 ms of which 14 ms to minimize.
[2024-05-21 21:56:10] [INFO ] Deduced a trap composed of 31 places in 1652 ms of which 13 ms to minimize.
[2024-05-21 21:56:12] [INFO ] Deduced a trap composed of 31 places in 1696 ms of which 13 ms to minimize.
[2024-05-21 21:56:13] [INFO ] Deduced a trap composed of 31 places in 1717 ms of which 15 ms to minimize.
[2024-05-21 21:56:15] [INFO ] Deduced a trap composed of 31 places in 1680 ms of which 13 ms to minimize.
[2024-05-21 21:56:17] [INFO ] Deduced a trap composed of 31 places in 1681 ms of which 14 ms to minimize.
[2024-05-21 21:56:19] [INFO ] Deduced a trap composed of 31 places in 1646 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2450 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:56:20] [INFO ] Deduced a trap composed of 31 places in 1719 ms of which 14 ms to minimize.
[2024-05-21 21:56:22] [INFO ] Deduced a trap composed of 31 places in 1663 ms of which 13 ms to minimize.
[2024-05-21 21:56:24] [INFO ] Deduced a trap composed of 31 places in 1770 ms of which 14 ms to minimize.
[2024-05-21 21:56:26] [INFO ] Deduced a trap composed of 31 places in 1722 ms of which 14 ms to minimize.
[2024-05-21 21:56:27] [INFO ] Deduced a trap composed of 31 places in 1588 ms of which 13 ms to minimize.
[2024-05-21 21:56:29] [INFO ] Deduced a trap composed of 31 places in 1653 ms of which 12 ms to minimize.
SMT process timed out in 47905ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 840 out of 2460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2460/2460 places, 2800/2800 transitions.
Applied a total of 0 rules in 83 ms. Remains 2460 /2460 variables (removed 0) and now considering 2800/2800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2460/2460 places, 2800/2800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2460/2460 places, 2800/2800 transitions.
Applied a total of 0 rules in 70 ms. Remains 2460 /2460 variables (removed 0) and now considering 2800/2800 (removed 0) transitions.
[2024-05-21 21:56:29] [INFO ] Invariant cache hit.
[2024-05-21 21:56:31] [INFO ] Implicit Places using invariants in 1888 ms returned []
[2024-05-21 21:56:31] [INFO ] Invariant cache hit.
[2024-05-21 21:57:03] [INFO ] Performed 1994/2460 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 21:57:08] [INFO ] Implicit Places using invariants and state equation in 36712 ms returned []
Implicit Place search using SMT with State Equation took 38603 ms to find 0 implicit places.
[2024-05-21 21:57:08] [INFO ] Redundant transitions in 146 ms returned []
Running 2400 sub problems to find dead transitions.
[2024-05-21 21:57:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2420 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2420/5260 variables, and 20 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2460 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2420 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2420/5260 variables, and 20 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2460 constraints, PredecessorRefiner: 0/2400 constraints, Known Traps: 0/0 constraints]
After SMT, in 61546ms problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 61569ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100421 ms. Remains : 2460/2460 places, 2800/2800 transitions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 416 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
// Phase 1: matrix 3200 rows 2860 cols
[2024-05-21 21:58:11] [INFO ] Computed 60 invariants in 211 ms
[2024-05-21 21:58:17] [INFO ] [Real]Absence check using 53 positive place invariants in 224 ms returned sat
[2024-05-21 21:58:17] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 118 ms returned sat
[2024-05-21 21:58:26] [INFO ] [Real]Absence check using state equation in 8205 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-21 21:58:26] [INFO ] Invariant cache hit.
[2024-05-21 21:58:31] [INFO ] [Real]Absence check using 53 positive place invariants in 230 ms returned sat
[2024-05-21 21:58:31] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 273 ms returned sat
[2024-05-21 21:58:41] [INFO ] [Real]Absence check using state equation in 9573 ms returned unknown
Could not prove EG (NOT p2)
Support contains 840 out of 2860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Applied a total of 0 rules in 58 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 21:58:41] [INFO ] Invariant cache hit.
[2024-05-21 21:58:43] [INFO ] Implicit Places using invariants in 2126 ms returned []
[2024-05-21 21:58:43] [INFO ] Invariant cache hit.
[2024-05-21 21:59:16] [INFO ] Performed 1999/2860 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 21:59:26] [INFO ] Implicit Places using invariants and state equation in 42856 ms returned []
Implicit Place search using SMT with State Equation took 44993 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 21:59:26] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6060 variables, and 39 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 39/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 2800/2800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:00:00] [INFO ] Deduced a trap composed of 31 places in 762 ms of which 8 ms to minimize.
[2024-05-21 22:00:01] [INFO ] Deduced a trap composed of 31 places in 694 ms of which 8 ms to minimize.
[2024-05-21 22:00:02] [INFO ] Deduced a trap composed of 31 places in 653 ms of which 7 ms to minimize.
[2024-05-21 22:00:03] [INFO ] Deduced a trap composed of 31 places in 565 ms of which 6 ms to minimize.
[2024-05-21 22:00:03] [INFO ] Deduced a trap composed of 31 places in 549 ms of which 7 ms to minimize.
[2024-05-21 22:00:04] [INFO ] Deduced a trap composed of 31 places in 509 ms of which 6 ms to minimize.
[2024-05-21 22:00:04] [INFO ] Deduced a trap composed of 31 places in 455 ms of which 6 ms to minimize.
[2024-05-21 22:00:05] [INFO ] Deduced a trap composed of 31 places in 382 ms of which 5 ms to minimize.
[2024-05-21 22:00:05] [INFO ] Deduced a trap composed of 31 places in 397 ms of which 5 ms to minimize.
[2024-05-21 22:00:05] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 5 ms to minimize.
[2024-05-21 22:00:06] [INFO ] Deduced a trap composed of 31 places in 403 ms of which 4 ms to minimize.
[2024-05-21 22:00:06] [INFO ] Deduced a trap composed of 31 places in 409 ms of which 4 ms to minimize.
[2024-05-21 22:00:07] [INFO ] Deduced a trap composed of 31 places in 414 ms of which 5 ms to minimize.
[2024-05-21 22:00:07] [INFO ] Deduced a trap composed of 31 places in 411 ms of which 5 ms to minimize.
[2024-05-21 22:00:08] [INFO ] Deduced a trap composed of 31 places in 411 ms of which 5 ms to minimize.
[2024-05-21 22:00:08] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 4 ms to minimize.
[2024-05-21 22:00:09] [INFO ] Deduced a trap composed of 31 places in 366 ms of which 4 ms to minimize.
[2024-05-21 22:00:09] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 4 ms to minimize.
[2024-05-21 22:00:09] [INFO ] Deduced a trap composed of 31 places in 338 ms of which 4 ms to minimize.
[2024-05-21 22:00:10] [INFO ] Deduced a trap composed of 31 places in 359 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2840 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:00:11] [INFO ] Deduced a trap composed of 31 places in 776 ms of which 8 ms to minimize.
[2024-05-21 22:00:12] [INFO ] Deduced a trap composed of 31 places in 751 ms of which 7 ms to minimize.
[2024-05-21 22:00:13] [INFO ] Deduced a trap composed of 31 places in 738 ms of which 8 ms to minimize.
[2024-05-21 22:00:14] [INFO ] Deduced a trap composed of 31 places in 691 ms of which 8 ms to minimize.
[2024-05-21 22:00:14] [INFO ] Deduced a trap composed of 31 places in 736 ms of which 7 ms to minimize.
[2024-05-21 22:00:15] [INFO ] Deduced a trap composed of 31 places in 671 ms of which 7 ms to minimize.
[2024-05-21 22:00:16] [INFO ] Deduced a trap composed of 31 places in 677 ms of which 7 ms to minimize.
[2024-05-21 22:00:17] [INFO ] Deduced a trap composed of 31 places in 669 ms of which 7 ms to minimize.
[2024-05-21 22:00:17] [INFO ] Deduced a trap composed of 31 places in 671 ms of which 7 ms to minimize.
[2024-05-21 22:00:18] [INFO ] Deduced a trap composed of 31 places in 675 ms of which 7 ms to minimize.
[2024-05-21 22:00:19] [INFO ] Deduced a trap composed of 31 places in 664 ms of which 7 ms to minimize.
[2024-05-21 22:00:19] [INFO ] Deduced a trap composed of 31 places in 618 ms of which 7 ms to minimize.
[2024-05-21 22:00:20] [INFO ] Deduced a trap composed of 31 places in 665 ms of which 8 ms to minimize.
[2024-05-21 22:00:21] [INFO ] Deduced a trap composed of 62 places in 667 ms of which 7 ms to minimize.
[2024-05-21 22:00:22] [INFO ] Deduced a trap composed of 31 places in 669 ms of which 7 ms to minimize.
[2024-05-21 22:00:22] [INFO ] Deduced a trap composed of 31 places in 660 ms of which 7 ms to minimize.
[2024-05-21 22:00:23] [INFO ] Deduced a trap composed of 31 places in 650 ms of which 7 ms to minimize.
[2024-05-21 22:00:24] [INFO ] Deduced a trap composed of 31 places in 662 ms of which 6 ms to minimize.
[2024-05-21 22:00:24] [INFO ] Deduced a trap composed of 31 places in 647 ms of which 7 ms to minimize.
[2024-05-21 22:00:25] [INFO ] Deduced a trap composed of 31 places in 667 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2840 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:00:27] [INFO ] Deduced a trap composed of 31 places in 754 ms of which 8 ms to minimize.
[2024-05-21 22:00:27] [INFO ] Deduced a trap composed of 31 places in 770 ms of which 8 ms to minimize.
[2024-05-21 22:00:28] [INFO ] Deduced a trap composed of 31 places in 790 ms of which 8 ms to minimize.
SMT process timed out in 62573ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 62599ms
Finished structural reductions in LTL mode , in 1 iterations and 107657 ms. Remains : 2860/2860 places, 3200/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 978 ms. (40 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 531 ms. (75 steps per ms) remains 1/1 properties
[2024-05-21 22:00:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2008/2848 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2848 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2848 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/2860 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2860 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6060/6060 variables, and 2920 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2063 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 2860/2860 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2008/2848 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2848 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:00:36] [INFO ] Deduced a trap composed of 31 places in 1922 ms of which 17 ms to minimize.
[2024-05-21 22:00:38] [INFO ] Deduced a trap composed of 31 places in 1851 ms of which 16 ms to minimize.
[2024-05-21 22:00:40] [INFO ] Deduced a trap composed of 31 places in 1901 ms of which 16 ms to minimize.
SMT process timed out in 8369ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 840 out of 2860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Free-agglomeration rule applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2860 transition count 2800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 800 place count 2460 transition count 2800
Applied a total of 800 rules in 206 ms. Remains 2460 /2860 variables (removed 400) and now considering 2800/3200 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 2460/2860 places, 2800/3200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1125 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 146447 steps, run timeout after 3002 ms. (steps per millisecond=48 ) properties seen :0 out of 1
Probabilistic random walk after 146447 steps, saw 145973 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 2800 rows 2460 cols
[2024-05-21 22:00:44] [INFO ] Computed 60 invariants in 209 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1610/2450 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2450 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2450 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/2460 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2460 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2800/5260 variables, 2460/2520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5260 variables, 0/2520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/5260 variables, 0/2520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5260/5260 variables, and 2520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 2460/2460 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1610/2450 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2450 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:00:48] [INFO ] Deduced a trap composed of 31 places in 1797 ms of which 15 ms to minimize.
[2024-05-21 22:00:50] [INFO ] Deduced a trap composed of 93 places in 1715 ms of which 14 ms to minimize.
[2024-05-21 22:00:52] [INFO ] Deduced a trap composed of 31 places in 1776 ms of which 18 ms to minimize.
[2024-05-21 22:00:53] [INFO ] Deduced a trap composed of 31 places in 1800 ms of which 13 ms to minimize.
[2024-05-21 22:00:55] [INFO ] Deduced a trap composed of 31 places in 1733 ms of which 14 ms to minimize.
[2024-05-21 22:00:57] [INFO ] Deduced a trap composed of 31 places in 1716 ms of which 14 ms to minimize.
[2024-05-21 22:00:59] [INFO ] Deduced a trap composed of 31 places in 1734 ms of which 18 ms to minimize.
[2024-05-21 22:01:00] [INFO ] Deduced a trap composed of 31 places in 1765 ms of which 15 ms to minimize.
[2024-05-21 22:01:02] [INFO ] Deduced a trap composed of 31 places in 1723 ms of which 14 ms to minimize.
[2024-05-21 22:01:04] [INFO ] Deduced a trap composed of 31 places in 1687 ms of which 14 ms to minimize.
[2024-05-21 22:01:06] [INFO ] Deduced a trap composed of 31 places in 1700 ms of which 13 ms to minimize.
[2024-05-21 22:01:07] [INFO ] Deduced a trap composed of 31 places in 1638 ms of which 13 ms to minimize.
[2024-05-21 22:01:09] [INFO ] Deduced a trap composed of 31 places in 1659 ms of which 14 ms to minimize.
[2024-05-21 22:01:11] [INFO ] Deduced a trap composed of 31 places in 1741 ms of which 14 ms to minimize.
[2024-05-21 22:01:13] [INFO ] Deduced a trap composed of 31 places in 1665 ms of which 13 ms to minimize.
[2024-05-21 22:01:14] [INFO ] Deduced a trap composed of 31 places in 1678 ms of which 13 ms to minimize.
[2024-05-21 22:01:16] [INFO ] Deduced a trap composed of 31 places in 1643 ms of which 13 ms to minimize.
[2024-05-21 22:01:18] [INFO ] Deduced a trap composed of 31 places in 1668 ms of which 13 ms to minimize.
[2024-05-21 22:01:19] [INFO ] Deduced a trap composed of 31 places in 1669 ms of which 13 ms to minimize.
[2024-05-21 22:01:21] [INFO ] Deduced a trap composed of 31 places in 1644 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2450 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:01:23] [INFO ] Deduced a trap composed of 31 places in 1650 ms of which 13 ms to minimize.
[2024-05-21 22:01:25] [INFO ] Deduced a trap composed of 31 places in 1664 ms of which 13 ms to minimize.
[2024-05-21 22:01:26] [INFO ] Deduced a trap composed of 31 places in 1640 ms of which 22 ms to minimize.
[2024-05-21 22:01:28] [INFO ] Deduced a trap composed of 31 places in 1650 ms of which 14 ms to minimize.
[2024-05-21 22:01:30] [INFO ] Deduced a trap composed of 31 places in 1600 ms of which 12 ms to minimize.
[2024-05-21 22:01:31] [INFO ] Deduced a trap composed of 31 places in 1624 ms of which 14 ms to minimize.
SMT process timed out in 47638ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 840 out of 2460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2460/2460 places, 2800/2800 transitions.
Applied a total of 0 rules in 79 ms. Remains 2460 /2460 variables (removed 0) and now considering 2800/2800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 2460/2460 places, 2800/2800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2460/2460 places, 2800/2800 transitions.
Applied a total of 0 rules in 73 ms. Remains 2460 /2460 variables (removed 0) and now considering 2800/2800 (removed 0) transitions.
[2024-05-21 22:01:31] [INFO ] Invariant cache hit.
[2024-05-21 22:01:33] [INFO ] Implicit Places using invariants in 1878 ms returned []
[2024-05-21 22:01:33] [INFO ] Invariant cache hit.
[2024-05-21 22:02:06] [INFO ] Performed 1976/2460 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 22:02:12] [INFO ] Implicit Places using invariants and state equation in 38232 ms returned []
Implicit Place search using SMT with State Equation took 40112 ms to find 0 implicit places.
[2024-05-21 22:02:12] [INFO ] Redundant transitions in 135 ms returned []
Running 2400 sub problems to find dead transitions.
[2024-05-21 22:02:12] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2420 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2420/5260 variables, and 20 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2460 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2420 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2420/5260 variables, and 20 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 20/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2460 constraints, PredecessorRefiner: 0/2400 constraints, Known Traps: 0/0 constraints]
After SMT, in 61576ms problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 61601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101947 ms. Remains : 2460/2460 places, 2800/2800 transitions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 402 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
// Phase 1: matrix 3200 rows 2860 cols
[2024-05-21 22:03:14] [INFO ] Computed 60 invariants in 217 ms
[2024-05-21 22:03:21] [INFO ] [Real]Absence check using 53 positive place invariants in 225 ms returned sat
[2024-05-21 22:03:21] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 123 ms returned sat
[2024-05-21 22:03:29] [INFO ] [Real]Absence check using state equation in 8014 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-21 22:03:30] [INFO ] Invariant cache hit.
[2024-05-21 22:03:34] [INFO ] [Real]Absence check using 53 positive place invariants in 222 ms returned sat
[2024-05-21 22:03:35] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 266 ms returned sat
[2024-05-21 22:03:45] [INFO ] [Real]Absence check using state equation in 9766 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 558 reset in 2938 ms.
Product exploration explored 100000 steps with 553 reset in 2988 ms.
Built C files in :
/tmp/ltsmin9627355066510271264
[2024-05-21 22:03:51] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9627355066510271264
Running compilation step : cd /tmp/ltsmin9627355066510271264;'/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/ltsmin9627355066510271264;'/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/ltsmin9627355066510271264;'/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 840 out of 2860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Applied a total of 0 rules in 62 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 22:03:54] [INFO ] Invariant cache hit.
[2024-05-21 22:03:56] [INFO ] Implicit Places using invariants in 2047 ms returned []
[2024-05-21 22:03:56] [INFO ] Invariant cache hit.
[2024-05-21 22:04:29] [INFO ] Performed 1963/2860 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 22:04:43] [INFO ] Implicit Places using invariants and state equation in 46561 ms returned []
Implicit Place search using SMT with State Equation took 48624 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 22:04:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6060 variables, and 39 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 39/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 2800/2800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:05:18] [INFO ] Deduced a trap composed of 31 places in 762 ms of which 8 ms to minimize.
[2024-05-21 22:05:18] [INFO ] Deduced a trap composed of 31 places in 698 ms of which 7 ms to minimize.
[2024-05-21 22:05:19] [INFO ] Deduced a trap composed of 31 places in 626 ms of which 7 ms to minimize.
[2024-05-21 22:05:20] [INFO ] Deduced a trap composed of 31 places in 580 ms of which 6 ms to minimize.
[2024-05-21 22:05:20] [INFO ] Deduced a trap composed of 31 places in 538 ms of which 6 ms to minimize.
[2024-05-21 22:05:21] [INFO ] Deduced a trap composed of 31 places in 506 ms of which 6 ms to minimize.
[2024-05-21 22:05:21] [INFO ] Deduced a trap composed of 31 places in 477 ms of which 6 ms to minimize.
[2024-05-21 22:05:22] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 5 ms to minimize.
[2024-05-21 22:05:22] [INFO ] Deduced a trap composed of 31 places in 416 ms of which 5 ms to minimize.
[2024-05-21 22:05:23] [INFO ] Deduced a trap composed of 31 places in 419 ms of which 5 ms to minimize.
[2024-05-21 22:05:23] [INFO ] Deduced a trap composed of 31 places in 463 ms of which 5 ms to minimize.
[2024-05-21 22:05:24] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 5 ms to minimize.
[2024-05-21 22:05:24] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 5 ms to minimize.
[2024-05-21 22:05:25] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 5 ms to minimize.
[2024-05-21 22:05:25] [INFO ] Deduced a trap composed of 31 places in 444 ms of which 5 ms to minimize.
[2024-05-21 22:05:25] [INFO ] Deduced a trap composed of 31 places in 379 ms of which 5 ms to minimize.
[2024-05-21 22:05:26] [INFO ] Deduced a trap composed of 31 places in 387 ms of which 4 ms to minimize.
[2024-05-21 22:05:26] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 4 ms to minimize.
[2024-05-21 22:05:27] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 4 ms to minimize.
[2024-05-21 22:05:27] [INFO ] Deduced a trap composed of 31 places in 358 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2840 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:05:29] [INFO ] Deduced a trap composed of 31 places in 778 ms of which 10 ms to minimize.
[2024-05-21 22:05:29] [INFO ] Deduced a trap composed of 31 places in 779 ms of which 7 ms to minimize.
[2024-05-21 22:05:30] [INFO ] Deduced a trap composed of 31 places in 773 ms of which 8 ms to minimize.
[2024-05-21 22:05:31] [INFO ] Deduced a trap composed of 31 places in 723 ms of which 7 ms to minimize.
[2024-05-21 22:05:32] [INFO ] Deduced a trap composed of 31 places in 704 ms of which 7 ms to minimize.
[2024-05-21 22:05:33] [INFO ] Deduced a trap composed of 31 places in 743 ms of which 8 ms to minimize.
[2024-05-21 22:05:33] [INFO ] Deduced a trap composed of 31 places in 699 ms of which 7 ms to minimize.
[2024-05-21 22:05:34] [INFO ] Deduced a trap composed of 31 places in 666 ms of which 7 ms to minimize.
[2024-05-21 22:05:35] [INFO ] Deduced a trap composed of 31 places in 639 ms of which 7 ms to minimize.
[2024-05-21 22:05:35] [INFO ] Deduced a trap composed of 31 places in 655 ms of which 7 ms to minimize.
[2024-05-21 22:05:36] [INFO ] Deduced a trap composed of 31 places in 657 ms of which 7 ms to minimize.
[2024-05-21 22:05:37] [INFO ] Deduced a trap composed of 31 places in 651 ms of which 7 ms to minimize.
[2024-05-21 22:05:38] [INFO ] Deduced a trap composed of 31 places in 634 ms of which 6 ms to minimize.
[2024-05-21 22:05:38] [INFO ] Deduced a trap composed of 62 places in 664 ms of which 7 ms to minimize.
[2024-05-21 22:05:39] [INFO ] Deduced a trap composed of 31 places in 641 ms of which 8 ms to minimize.
[2024-05-21 22:05:40] [INFO ] Deduced a trap composed of 31 places in 647 ms of which 7 ms to minimize.
[2024-05-21 22:05:40] [INFO ] Deduced a trap composed of 31 places in 653 ms of which 7 ms to minimize.
[2024-05-21 22:05:41] [INFO ] Deduced a trap composed of 31 places in 667 ms of which 6 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 31 places in 650 ms of which 7 ms to minimize.
[2024-05-21 22:05:42] [INFO ] Deduced a trap composed of 31 places in 635 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2840 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:05:44] [INFO ] Deduced a trap composed of 31 places in 762 ms of which 15 ms to minimize.
[2024-05-21 22:05:45] [INFO ] Deduced a trap composed of 31 places in 756 ms of which 8 ms to minimize.
[2024-05-21 22:05:46] [INFO ] Deduced a trap composed of 31 places in 762 ms of which 8 ms to minimize.
SMT process timed out in 63042ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 63094ms
Finished structural reductions in LTL mode , in 1 iterations and 111787 ms. Remains : 2860/2860 places, 3200/3200 transitions.
Built C files in :
/tmp/ltsmin13849120862929858047
[2024-05-21 22:05:46] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13849120862929858047
Running compilation step : cd /tmp/ltsmin13849120862929858047;'/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/ltsmin13849120862929858047;'/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/ltsmin13849120862929858047;'/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-21 22:05:49] [INFO ] Flatten gal took : 193 ms
[2024-05-21 22:05:49] [INFO ] Flatten gal took : 235 ms
[2024-05-21 22:05:49] [INFO ] Time to serialize gal into /tmp/LTL5039026779670312094.gal : 73 ms
[2024-05-21 22:05:49] [INFO ] Time to serialize properties into /tmp/LTL18049716284205978055.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/LTL5039026779670312094.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4402833279888444629.hoa' '-atoms' '/tmp/LTL18049716284205978055.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...318
Loading property file /tmp/LTL18049716284205978055.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4402833279888444629.hoa
Detected timeout of ITS tools.
[2024-05-21 22:06:05] [INFO ] Flatten gal took : 172 ms
[2024-05-21 22:06:05] [INFO ] Flatten gal took : 164 ms
[2024-05-21 22:06:05] [INFO ] Time to serialize gal into /tmp/LTL11475809001354613804.gal : 23 ms
[2024-05-21 22:06:05] [INFO ] Time to serialize properties into /tmp/LTL5896532280752984621.ltl : 2 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/LTL11475809001354613804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5896532280752984621.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 : !((X(X(F(("((((((Mutex_0+Mutex_1)+(Mutex_2+Mutex_3))+((Mutex_4+Mutex_5)+(Mutex_6+Mutex_7)))+(((Mutex_8+Mutex_9)+(Mutex_10+Mutex_11))+(...13920
Formula 0 simplified : XXG(!"((((((Mutex_0+Mutex_1)+(Mutex_2+Mutex_3))+((Mutex_4+Mutex_5)+(Mutex_6+Mutex_7)))+(((Mutex_8+Mutex_9)+(Mutex_10+Mutex_11))+((Mu...13909
Detected timeout of ITS tools.
[2024-05-21 22:06:20] [INFO ] Flatten gal took : 168 ms
[2024-05-21 22:06:20] [INFO ] Applying decomposition
[2024-05-21 22:06:20] [INFO ] Flatten gal took : 162 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/graph14452662897367683850.txt' '-o' '/tmp/graph14452662897367683850.bin' '-w' '/tmp/graph14452662897367683850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14452662897367683850.bin' '-l' '-1' '-v' '-w' '/tmp/graph14452662897367683850.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:06:21] [INFO ] Decomposing Gal with order
[2024-05-21 22:06:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:06:22] [INFO ] Removed a total of 760 redundant transitions.
[2024-05-21 22:06:22] [INFO ] Flatten gal took : 905 ms
[2024-05-21 22:06:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 95 ms.
[2024-05-21 22:06:23] [INFO ] Time to serialize gal into /tmp/LTL13269928261432949219.gal : 74 ms
[2024-05-21 22:06:23] [INFO ] Time to serialize properties into /tmp/LTL2697031473475211994.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/LTL13269928261432949219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2697031473475211994.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 : !((X(X(F(("((((((gu20.Mutex_0+gu20.Mutex_1)+(gu20.Mutex_2+gu20.Mutex_3))+((gu20.Mutex_4+gu20.Mutex_5)+(gu20.Mutex_6+gu20.Mutex_7)))+((...18420
Formula 0 simplified : XXG(!"((((((gu20.Mutex_0+gu20.Mutex_1)+(gu20.Mutex_2+gu20.Mutex_3))+((gu20.Mutex_4+gu20.Mutex_5)+(gu20.Mutex_6+gu20.Mutex_7)))+(((gu...18409
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-12 finished in 685307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((p1&&X(F(!p1))))))'
Support contains 420 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 118 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-21 22:06:38] [INFO ] Computed 460 invariants in 37 ms
[2024-05-21 22:06:44] [INFO ] Implicit Places using invariants in 5996 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 6021 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 82 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6222 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 202 ms :[p1, (NOT p0), (AND p1 (NOT p0)), (NOT p0), true]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 1687 ms.
Product exploration explored 100000 steps with 50000 reset in 1772 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-13 finished in 10124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 800 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 97 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 22:06:48] [INFO ] Invariant cache hit.
[2024-05-21 22:06:53] [INFO ] Implicit Places using invariants in 4566 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 4594 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 67 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4758 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 251 steps with 0 reset in 15 ms.
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-14 finished in 4857 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(F((!(p0 U p1)||!p0)))&&F(p2)))))'
Support contains 820 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 86 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 22:06:53] [INFO ] Invariant cache hit.
[2024-05-21 22:06:58] [INFO ] Implicit Places using invariants in 5323 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5337 ms to find 400 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 59 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5482 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), (NOT p2)]
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-15
Product exploration explored 100000 steps with 162 reset in 2726 ms.
Product exploration explored 100000 steps with 160 reset in 2810 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 838 steps (0 resets) in 30 ms. (27 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 61 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 420 out of 2860 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 : 2860/2860 places, 3200/3200 transitions.
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 400 Pre rules applied. Total rules applied 0 place count 2860 transition count 2800
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 0 with 800 rules applied. Total rules applied 800 place count 2460 transition count 2800
Applied a total of 800 rules in 276 ms. Remains 2460 /2860 variables (removed 400) and now considering 2800/3200 (removed 400) transitions.
// Phase 1: matrix 2800 rows 2460 cols
[2024-05-21 22:07:07] [INFO ] Computed 60 invariants in 221 ms
[2024-05-21 22:07:10] [INFO ] Implicit Places using invariants in 2513 ms returned []
[2024-05-21 22:07:10] [INFO ] Invariant cache hit.
[2024-05-21 22:07:43] [INFO ] Performed 1566/2460 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 22:07:49] [INFO ] Implicit Places using invariants and state equation in 39324 ms returned []
Implicit Place search using SMT with State Equation took 41841 ms to find 0 implicit places.
[2024-05-21 22:07:49] [INFO ] Redundant transitions in 167 ms returned []
Running 2400 sub problems to find dead transitions.
[2024-05-21 22:07:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2440 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2440/5260 variables, and 39 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2460 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2440 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:08:23] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:08:23] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-21 22:08:23] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2024-05-21 22:08:23] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-21 22:08:23] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2024-05-21 22:08:23] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:08:25] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:08:25] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:08:25] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2440 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:08:26] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2024-05-21 22:08:27] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:08:27] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:08:27] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:08:27] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:08:27] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:08:27] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:08:27] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:08:27] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2440 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:08:28] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:08:28] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 22:08:28] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:08:28] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 5 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:08:30] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:08:30] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:08:30] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:08:30] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:08:30] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2440 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:08:31] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:08:31] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:08:31] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:08:31] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:08:31] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:08:31] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:08:31] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:08:33] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 22:08:33] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2440 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:08:34] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:08:34] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:08:34] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:08:34] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 22:08:34] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:08:34] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 2 ms to minimize.
[2024-05-21 22:08:34] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:08:36] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:08:36] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2440 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:08:37] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:08:37] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:08:37] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-05-21 22:08:37] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-05-21 22:08:37] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 4 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:08:38] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:08:39] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:08:39] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:08:39] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2440 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:08:41] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:08:41] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:08:42] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:08:43] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:08:43] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:08:43] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:08:43] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:08:43] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:08:43] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:08:43] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2440 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:08:45] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-05-21 22:08:45] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:08:46] [INFO ] Deduced a trap composed of 29 places in 1284 ms of which 12 ms to minimize.
[2024-05-21 22:08:48] [INFO ] Deduced a trap composed of 29 places in 1168 ms of which 11 ms to minimize.
[2024-05-21 22:08:49] [INFO ] Deduced a trap composed of 29 places in 1177 ms of which 12 ms to minimize.
[2024-05-21 22:08:50] [INFO ] Deduced a trap composed of 29 places in 1132 ms of which 11 ms to minimize.
[2024-05-21 22:08:51] [INFO ] Deduced a trap composed of 29 places in 1162 ms of which 11 ms to minimize.
SMT process timed out in 61858ms, After SMT, problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 61881ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2460/2860 places, 2800/3200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104191 ms. Remains : 2460/2860 places, 2800/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 825 steps (0 resets) in 50 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 84 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 84 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 194 reset in 2841 ms.
Product exploration explored 100000 steps with 191 reset in 2939 ms.
Built C files in :
/tmp/ltsmin15006833020042815859
[2024-05-21 22:09:00] [INFO ] Too many transitions (2800) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:09:00] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15006833020042815859
Running compilation step : cd /tmp/ltsmin15006833020042815859;'/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/ltsmin15006833020042815859;'/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/ltsmin15006833020042815859;'/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 420 out of 2460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2460/2460 places, 2800/2800 transitions.
Applied a total of 0 rules in 93 ms. Remains 2460 /2460 variables (removed 0) and now considering 2800/2800 (removed 0) transitions.
[2024-05-21 22:09:03] [INFO ] Invariant cache hit.
[2024-05-21 22:09:05] [INFO ] Implicit Places using invariants in 2193 ms returned []
[2024-05-21 22:09:05] [INFO ] Invariant cache hit.
[2024-05-21 22:09:39] [INFO ] Performed 1529/2460 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 22:09:47] [INFO ] Implicit Places using invariants and state equation in 41895 ms returned []
Implicit Place search using SMT with State Equation took 44089 ms to find 0 implicit places.
[2024-05-21 22:09:47] [INFO ] Redundant transitions in 83 ms returned []
Running 2400 sub problems to find dead transitions.
[2024-05-21 22:09:47] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2440 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2440/5260 variables, and 39 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2460 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2440 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:10:21] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:10:21] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:10:21] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:10:21] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:10:21] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:10:21] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:21] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:10:22] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2440 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:10:23] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:23] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:10:23] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:10:23] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:23] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:10:24] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:10:25] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:10:25] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:25] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2440 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:10:26] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:10:27] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 5 ms to minimize.
[2024-05-21 22:10:27] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-21 22:10:27] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:10:27] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:27] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:10:27] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:27] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:10:27] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2440 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:10:28] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:10:28] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:10:28] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:10:29] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:10:30] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:10:30] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:10:30] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:10:30] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:10:30] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2440 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:10:31] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:10:31] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:10:31] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:31] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:10:31] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:10:31] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:10:32] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:33] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:10:33] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2440 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:10:34] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:10:35] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2440 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:10:38] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:10:38] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2024-05-21 22:10:38] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:10:38] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:38] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:39] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2024-05-21 22:10:40] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2024-05-21 22:10:40] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2024-05-21 22:10:40] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2024-05-21 22:10:40] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-21 22:10:40] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2440 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:10:42] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:10:42] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:10:43] [INFO ] Deduced a trap composed of 29 places in 1318 ms of which 13 ms to minimize.
[2024-05-21 22:10:45] [INFO ] Deduced a trap composed of 29 places in 1157 ms of which 11 ms to minimize.
[2024-05-21 22:10:46] [INFO ] Deduced a trap composed of 29 places in 1196 ms of which 11 ms to minimize.
[2024-05-21 22:10:47] [INFO ] Deduced a trap composed of 29 places in 1160 ms of which 12 ms to minimize.
[2024-05-21 22:10:48] [INFO ] Deduced a trap composed of 29 places in 1194 ms of which 12 ms to minimize.
[2024-05-21 22:10:49] [INFO ] Deduced a trap composed of 29 places in 1040 ms of which 11 ms to minimize.
[2024-05-21 22:10:50] [INFO ] Deduced a trap composed of 29 places in 1088 ms of which 10 ms to minimize.
SMT process timed out in 62973ms, After SMT, problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 63006ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107289 ms. Remains : 2460/2460 places, 2800/2800 transitions.
Built C files in :
/tmp/ltsmin938454875682502516
[2024-05-21 22:10:50] [INFO ] Too many transitions (2800) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:10:50] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin938454875682502516
Running compilation step : cd /tmp/ltsmin938454875682502516;'/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/ltsmin938454875682502516;'/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/ltsmin938454875682502516;'/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-21 22:10:54] [INFO ] Flatten gal took : 135 ms
[2024-05-21 22:10:54] [INFO ] Flatten gal took : 153 ms
[2024-05-21 22:10:54] [INFO ] Time to serialize gal into /tmp/LTL8272433684430100879.gal : 118 ms
[2024-05-21 22:10:54] [INFO ] Time to serialize properties into /tmp/LTL10931795503801373228.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/LTL8272433684430100879.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13463647576090327609.hoa' '-atoms' '/tmp/LTL10931795503801373228.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/LTL10931795503801373228.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13463647576090327609.hoa
Detected timeout of ITS tools.
[2024-05-21 22:11:09] [INFO ] Flatten gal took : 142 ms
[2024-05-21 22:11:09] [INFO ] Flatten gal took : 146 ms
[2024-05-21 22:11:09] [INFO ] Time to serialize gal into /tmp/LTL4684059551482352370.gal : 24 ms
[2024-05-21 22:11:09] [INFO ] Time to serialize properties into /tmp/LTL14539692197316540073.ltl : 2 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/LTL4684059551482352370.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14539692197316540073.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 : !((X(X((G(F((!(("((((((((((Message_0+Message_1)+(Message_2+Message_3))+((Message_4+Message_5)+(Message_6+Message_7)))+(((Message_8+Mes...16475
Formula 0 simplified : XX(FG(!"((((((((((Message_0+Message_1)+(Message_2+Message_3))+((Message_4+Message_5)+(Message_6+Message_7)))+(((Message_8+Message_9)...16459
Detected timeout of ITS tools.
[2024-05-21 22:11:25] [INFO ] Flatten gal took : 141 ms
[2024-05-21 22:11:25] [INFO ] Applying decomposition
[2024-05-21 22:11:25] [INFO ] Flatten gal took : 144 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/graph15973970634931050610.txt' '-o' '/tmp/graph15973970634931050610.bin' '-w' '/tmp/graph15973970634931050610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15973970634931050610.bin' '-l' '-1' '-v' '-w' '/tmp/graph15973970634931050610.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:11:26] [INFO ] Decomposing Gal with order
[2024-05-21 22:11:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:11:27] [INFO ] Removed a total of 835 redundant transitions.
[2024-05-21 22:11:27] [INFO ] Flatten gal took : 884 ms
[2024-05-21 22:11:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 22 ms.
[2024-05-21 22:11:27] [INFO ] Time to serialize gal into /tmp/LTL13845414169211022797.gal : 34 ms
[2024-05-21 22:11:27] [INFO ] Time to serialize properties into /tmp/LTL1970997726163156425.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/LTL13845414169211022797.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1970997726163156425.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 : !((X(X((G(F((!(("((((((((((gu38.Message_0+gu38.Message_1)+(gu38.Message_2+gu38.Message_3))+((gu38.Message_4+gu38.Message_5)+(gu38.Mess...22735
Formula 0 simplified : XX(FG(!"((((((((((gu38.Message_0+gu38.Message_1)+(gu38.Message_2+gu38.Message_3))+((gu38.Message_4+gu38.Message_5)+(gu38.Message_6+g...22719
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-15 finished in 289302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)&&p0))||X(X(G(p2)))))'
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(F((p0&&((p1&&X(p1)) U X(p2)))))))'
Found a Shortening insensitive property : DatabaseWithMutex-COL-20-LTLCardinality-12
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Support contains 840 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 115 ms. Remains 3260 /3260 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 3260 cols
[2024-05-21 22:11:43] [INFO ] Computed 460 invariants in 44 ms
[2024-05-21 22:11:49] [INFO ] Implicit Places using invariants in 6069 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 6083 ms to find 400 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2860/3260 places, 3200/3200 transitions.
Applied a total of 0 rules in 82 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6281 ms. Remains : 2860/3260 places, 3200/3200 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-12
Product exploration explored 100000 steps with 554 reset in 2983 ms.
Product exploration explored 100000 steps with 560 reset in 3006 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 1192 ms. (33 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 597 ms. (66 steps per ms) remains 1/1 properties
// Phase 1: matrix 3200 rows 2860 cols
[2024-05-21 22:11:58] [INFO ] Computed 60 invariants in 234 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2008/2848 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2848 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2848 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/2860 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2860 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6060/6060 variables, and 2920 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2224 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 2860/2860 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2008/2848 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2848 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:12:03] [INFO ] Deduced a trap composed of 31 places in 2301 ms of which 18 ms to minimize.
[2024-05-21 22:12:06] [INFO ] Deduced a trap composed of 32 places in 2299 ms of which 17 ms to minimize.
SMT process timed out in 7693ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 840 out of 2860 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Free-agglomeration rule applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 2860 transition count 2800
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 0 with 400 rules applied. Total rules applied 800 place count 2460 transition count 2800
Applied a total of 800 rules in 220 ms. Remains 2460 /2860 variables (removed 400) and now considering 2800/3200 (removed 400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 2460/2860 places, 2800/3200 transitions.
RANDOM walk for 40000 steps (8 resets) in 1238 ms. (32 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 530 ms. (75 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 142889 steps, run timeout after 3004 ms. (steps per millisecond=47 ) properties seen :0 out of 1
Probabilistic random walk after 142889 steps, saw 142425 distinct states, run finished after 3004 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 2800 rows 2460 cols
[2024-05-21 22:12:10] [INFO ] Computed 60 invariants in 254 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1610/2450 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2450 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2450 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/2460 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2460 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2800/5260 variables, 2460/2520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5260 variables, 0/2520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/5260 variables, 0/2520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5260/5260 variables, and 2520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1897 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 2460/2460 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1610/2450 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2450 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:12:14] [INFO ] Deduced a trap composed of 31 places in 1813 ms of which 15 ms to minimize.
[2024-05-21 22:12:16] [INFO ] Deduced a trap composed of 93 places in 1789 ms of which 14 ms to minimize.
[2024-05-21 22:12:18] [INFO ] Deduced a trap composed of 31 places in 1803 ms of which 14 ms to minimize.
[2024-05-21 22:12:20] [INFO ] Deduced a trap composed of 31 places in 1801 ms of which 15 ms to minimize.
[2024-05-21 22:12:21] [INFO ] Deduced a trap composed of 31 places in 1727 ms of which 14 ms to minimize.
[2024-05-21 22:12:23] [INFO ] Deduced a trap composed of 31 places in 1667 ms of which 14 ms to minimize.
[2024-05-21 22:12:25] [INFO ] Deduced a trap composed of 31 places in 1683 ms of which 13 ms to minimize.
[2024-05-21 22:12:27] [INFO ] Deduced a trap composed of 31 places in 1690 ms of which 15 ms to minimize.
[2024-05-21 22:12:28] [INFO ] Deduced a trap composed of 31 places in 1674 ms of which 14 ms to minimize.
[2024-05-21 22:12:30] [INFO ] Deduced a trap composed of 31 places in 1685 ms of which 13 ms to minimize.
[2024-05-21 22:12:32] [INFO ] Deduced a trap composed of 31 places in 1729 ms of which 14 ms to minimize.
[2024-05-21 22:12:34] [INFO ] Deduced a trap composed of 31 places in 1744 ms of which 14 ms to minimize.
[2024-05-21 22:12:35] [INFO ] Deduced a trap composed of 31 places in 1700 ms of which 14 ms to minimize.
[2024-05-21 22:12:37] [INFO ] Deduced a trap composed of 31 places in 1674 ms of which 13 ms to minimize.
[2024-05-21 22:12:39] [INFO ] Deduced a trap composed of 31 places in 1701 ms of which 14 ms to minimize.
[2024-05-21 22:12:41] [INFO ] Deduced a trap composed of 31 places in 1711 ms of which 13 ms to minimize.
[2024-05-21 22:12:42] [INFO ] Deduced a trap composed of 31 places in 1713 ms of which 13 ms to minimize.
[2024-05-21 22:12:44] [INFO ] Deduced a trap composed of 31 places in 1748 ms of which 14 ms to minimize.
[2024-05-21 22:12:46] [INFO ] Deduced a trap composed of 31 places in 1725 ms of which 13 ms to minimize.
[2024-05-21 22:12:47] [INFO ] Deduced a trap composed of 31 places in 1634 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2450 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:12:49] [INFO ] Deduced a trap composed of 31 places in 1718 ms of which 13 ms to minimize.
[2024-05-21 22:12:51] [INFO ] Deduced a trap composed of 31 places in 1662 ms of which 12 ms to minimize.
[2024-05-21 22:12:53] [INFO ] Deduced a trap composed of 31 places in 1704 ms of which 13 ms to minimize.
[2024-05-21 22:12:54] [INFO ] Deduced a trap composed of 31 places in 1640 ms of which 13 ms to minimize.
[2024-05-21 22:12:56] [INFO ] Deduced a trap composed of 31 places in 1706 ms of which 13 ms to minimize.
[2024-05-21 22:12:58] [INFO ] Deduced a trap composed of 31 places in 1716 ms of which 13 ms to minimize.
SMT process timed out in 48311ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 840 out of 2460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2460/2460 places, 2800/2800 transitions.
Applied a total of 0 rules in 85 ms. Remains 2460 /2460 variables (removed 0) and now considering 2800/2800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2460/2460 places, 2800/2800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2460/2460 places, 2800/2800 transitions.
Applied a total of 0 rules in 70 ms. Remains 2460 /2460 variables (removed 0) and now considering 2800/2800 (removed 0) transitions.
[2024-05-21 22:12:58] [INFO ] Invariant cache hit.
[2024-05-21 22:13:00] [INFO ] Implicit Places using invariants in 1863 ms returned []
[2024-05-21 22:13:00] [INFO ] Invariant cache hit.
[2024-05-21 22:13:32] [INFO ] Performed 1965/2460 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 22:13:38] [INFO ] Implicit Places using invariants and state equation in 38382 ms returned []
Implicit Place search using SMT with State Equation took 40269 ms to find 0 implicit places.
[2024-05-21 22:13:38] [INFO ] Redundant transitions in 55 ms returned []
Running 2400 sub problems to find dead transitions.
[2024-05-21 22:13:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2420 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2420/5260 variables, and 20 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 20/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2460 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2420 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2420/5260 variables, and 20 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 20/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2460 constraints, PredecessorRefiner: 0/2400 constraints, Known Traps: 0/0 constraints]
After SMT, in 61986ms problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 62011ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102421 ms. Remains : 2460/2460 places, 2800/2800 transitions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 292 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
// Phase 1: matrix 3200 rows 2860 cols
[2024-05-21 22:14:41] [INFO ] Computed 60 invariants in 233 ms
[2024-05-21 22:14:48] [INFO ] [Real]Absence check using 53 positive place invariants in 244 ms returned sat
[2024-05-21 22:14:48] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 121 ms returned sat
[2024-05-21 22:14:56] [INFO ] [Real]Absence check using state equation in 8269 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-21 22:14:56] [INFO ] Invariant cache hit.
[2024-05-21 22:15:02] [INFO ] [Real]Absence check using 53 positive place invariants in 198 ms returned sat
[2024-05-21 22:15:02] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 261 ms returned sat
[2024-05-21 22:15:11] [INFO ] [Real]Absence check using state equation in 9513 ms returned unknown
Could not prove EG (NOT p2)
Support contains 840 out of 2860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Applied a total of 0 rules in 60 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 22:15:12] [INFO ] Invariant cache hit.
[2024-05-21 22:15:14] [INFO ] Implicit Places using invariants in 2019 ms returned []
[2024-05-21 22:15:14] [INFO ] Invariant cache hit.
[2024-05-21 22:15:47] [INFO ] Performed 1999/2860 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 22:15:57] [INFO ] Implicit Places using invariants and state equation in 43238 ms returned []
Implicit Place search using SMT with State Equation took 45280 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 22:15:57] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6060 variables, and 39 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 39/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 2800/2800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:16:32] [INFO ] Deduced a trap composed of 31 places in 761 ms of which 8 ms to minimize.
[2024-05-21 22:16:33] [INFO ] Deduced a trap composed of 31 places in 724 ms of which 7 ms to minimize.
[2024-05-21 22:16:33] [INFO ] Deduced a trap composed of 31 places in 679 ms of which 7 ms to minimize.
[2024-05-21 22:16:34] [INFO ] Deduced a trap composed of 31 places in 623 ms of which 6 ms to minimize.
[2024-05-21 22:16:35] [INFO ] Deduced a trap composed of 31 places in 537 ms of which 6 ms to minimize.
[2024-05-21 22:16:35] [INFO ] Deduced a trap composed of 31 places in 494 ms of which 5 ms to minimize.
[2024-05-21 22:16:36] [INFO ] Deduced a trap composed of 31 places in 460 ms of which 6 ms to minimize.
[2024-05-21 22:16:36] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 5 ms to minimize.
[2024-05-21 22:16:37] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 5 ms to minimize.
[2024-05-21 22:16:37] [INFO ] Deduced a trap composed of 31 places in 416 ms of which 5 ms to minimize.
[2024-05-21 22:16:37] [INFO ] Deduced a trap composed of 31 places in 407 ms of which 5 ms to minimize.
[2024-05-21 22:16:38] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 4 ms to minimize.
[2024-05-21 22:16:38] [INFO ] Deduced a trap composed of 31 places in 409 ms of which 5 ms to minimize.
[2024-05-21 22:16:39] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 5 ms to minimize.
[2024-05-21 22:16:39] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 5 ms to minimize.
[2024-05-21 22:16:40] [INFO ] Deduced a trap composed of 31 places in 352 ms of which 5 ms to minimize.
[2024-05-21 22:16:40] [INFO ] Deduced a trap composed of 31 places in 346 ms of which 4 ms to minimize.
[2024-05-21 22:16:40] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 4 ms to minimize.
[2024-05-21 22:16:41] [INFO ] Deduced a trap composed of 31 places in 313 ms of which 4 ms to minimize.
[2024-05-21 22:16:41] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2840 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:16:43] [INFO ] Deduced a trap composed of 31 places in 800 ms of which 8 ms to minimize.
[2024-05-21 22:16:43] [INFO ] Deduced a trap composed of 31 places in 776 ms of which 8 ms to minimize.
[2024-05-21 22:16:44] [INFO ] Deduced a trap composed of 31 places in 779 ms of which 8 ms to minimize.
[2024-05-21 22:16:45] [INFO ] Deduced a trap composed of 31 places in 716 ms of which 7 ms to minimize.
[2024-05-21 22:16:46] [INFO ] Deduced a trap composed of 31 places in 704 ms of which 8 ms to minimize.
[2024-05-21 22:16:47] [INFO ] Deduced a trap composed of 31 places in 698 ms of which 7 ms to minimize.
[2024-05-21 22:16:47] [INFO ] Deduced a trap composed of 31 places in 649 ms of which 7 ms to minimize.
[2024-05-21 22:16:48] [INFO ] Deduced a trap composed of 31 places in 764 ms of which 8 ms to minimize.
[2024-05-21 22:16:49] [INFO ] Deduced a trap composed of 31 places in 666 ms of which 7 ms to minimize.
[2024-05-21 22:16:49] [INFO ] Deduced a trap composed of 31 places in 645 ms of which 7 ms to minimize.
[2024-05-21 22:16:50] [INFO ] Deduced a trap composed of 31 places in 651 ms of which 7 ms to minimize.
[2024-05-21 22:16:51] [INFO ] Deduced a trap composed of 31 places in 657 ms of which 7 ms to minimize.
[2024-05-21 22:16:52] [INFO ] Deduced a trap composed of 31 places in 655 ms of which 7 ms to minimize.
[2024-05-21 22:16:52] [INFO ] Deduced a trap composed of 62 places in 661 ms of which 7 ms to minimize.
[2024-05-21 22:16:53] [INFO ] Deduced a trap composed of 31 places in 663 ms of which 7 ms to minimize.
[2024-05-21 22:16:54] [INFO ] Deduced a trap composed of 31 places in 665 ms of which 7 ms to minimize.
[2024-05-21 22:16:54] [INFO ] Deduced a trap composed of 31 places in 657 ms of which 7 ms to minimize.
[2024-05-21 22:16:55] [INFO ] Deduced a trap composed of 31 places in 622 ms of which 7 ms to minimize.
[2024-05-21 22:16:56] [INFO ] Deduced a trap composed of 31 places in 660 ms of which 8 ms to minimize.
[2024-05-21 22:16:56] [INFO ] Deduced a trap composed of 31 places in 614 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2840 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:16:58] [INFO ] Deduced a trap composed of 31 places in 760 ms of which 8 ms to minimize.
[2024-05-21 22:16:59] [INFO ] Deduced a trap composed of 31 places in 787 ms of which 8 ms to minimize.
[2024-05-21 22:17:00] [INFO ] Deduced a trap composed of 31 places in 753 ms of which 7 ms to minimize.
SMT process timed out in 62868ms, After SMT, problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 62898ms
Finished structural reductions in LTL mode , in 1 iterations and 108244 ms. Remains : 2860/2860 places, 3200/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
RANDOM walk for 26634 steps (5 resets) in 841 ms. (31 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 398 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
[2024-05-21 22:17:04] [INFO ] Invariant cache hit.
[2024-05-21 22:17:11] [INFO ] [Real]Absence check using 53 positive place invariants in 209 ms returned sat
[2024-05-21 22:17:11] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 265 ms returned sat
[2024-05-21 22:17:19] [INFO ] [Real]Absence check using state equation in 7937 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-21 22:17:19] [INFO ] Invariant cache hit.
[2024-05-21 22:17:24] [INFO ] [Real]Absence check using 53 positive place invariants in 213 ms returned sat
[2024-05-21 22:17:24] [INFO ] [Real]Absence check using 53 positive and 7 generalized place invariants in 265 ms returned sat
[2024-05-21 22:17:34] [INFO ] [Real]Absence check using state equation in 9493 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 552 reset in 3000 ms.
Product exploration explored 100000 steps with 562 reset in 3058 ms.
Built C files in :
/tmp/ltsmin16183478414912084289
[2024-05-21 22:17:40] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16183478414912084289
Running compilation step : cd /tmp/ltsmin16183478414912084289;'/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/ltsmin16183478414912084289;'/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/ltsmin16183478414912084289;'/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 840 out of 2860 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2860/2860 places, 3200/3200 transitions.
Applied a total of 0 rules in 100 ms. Remains 2860 /2860 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2024-05-21 22:17:44] [INFO ] Invariant cache hit.
[2024-05-21 22:17:46] [INFO ] Implicit Places using invariants in 2159 ms returned []
[2024-05-21 22:17:46] [INFO ] Invariant cache hit.
[2024-05-21 22:18:19] [INFO ] Performed 1951/2860 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 22:18:34] [INFO ] Implicit Places using invariants and state equation in 48120 ms returned []
Implicit Place search using SMT with State Equation took 50281 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-21 22:18:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6060 variables, and 39 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 39/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 2800/2800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:19:09] [INFO ] Deduced a trap composed of 31 places in 795 ms of which 12 ms to minimize.
[2024-05-21 22:19:10] [INFO ] Deduced a trap composed of 31 places in 722 ms of which 8 ms to minimize.
[2024-05-21 22:19:11] [INFO ] Deduced a trap composed of 31 places in 731 ms of which 6 ms to minimize.
[2024-05-21 22:19:11] [INFO ] Deduced a trap composed of 31 places in 615 ms of which 8 ms to minimize.
[2024-05-21 22:19:12] [INFO ] Deduced a trap composed of 31 places in 527 ms of which 6 ms to minimize.
[2024-05-21 22:19:12] [INFO ] Deduced a trap composed of 31 places in 478 ms of which 6 ms to minimize.
[2024-05-21 22:19:13] [INFO ] Deduced a trap composed of 31 places in 454 ms of which 5 ms to minimize.
[2024-05-21 22:19:13] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 5 ms to minimize.
[2024-05-21 22:19:14] [INFO ] Deduced a trap composed of 31 places in 416 ms of which 5 ms to minimize.
[2024-05-21 22:19:14] [INFO ] Deduced a trap composed of 31 places in 417 ms of which 4 ms to minimize.
[2024-05-21 22:19:15] [INFO ] Deduced a trap composed of 31 places in 412 ms of which 4 ms to minimize.
[2024-05-21 22:19:15] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 5 ms to minimize.
[2024-05-21 22:19:16] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 5 ms to minimize.
[2024-05-21 22:19:16] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 4 ms to minimize.
[2024-05-21 22:19:17] [INFO ] Deduced a trap composed of 31 places in 418 ms of which 5 ms to minimize.
[2024-05-21 22:19:17] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 4 ms to minimize.
[2024-05-21 22:19:17] [INFO ] Deduced a trap composed of 31 places in 366 ms of which 5 ms to minimize.
[2024-05-21 22:19:18] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 4 ms to minimize.
[2024-05-21 22:19:18] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 4 ms to minimize.
[2024-05-21 22:19:19] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2840 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:19:20] [INFO ] Deduced a trap composed of 31 places in 764 ms of which 7 ms to minimize.
[2024-05-21 22:19:21] [INFO ] Deduced a trap composed of 31 places in 772 ms of which 8 ms to minimize.
[2024-05-21 22:19:22] [INFO ] Deduced a trap composed of 31 places in 758 ms of which 8 ms to minimize.
[2024-05-21 22:19:22] [INFO ] Deduced a trap composed of 31 places in 688 ms of which 7 ms to minimize.
[2024-05-21 22:19:23] [INFO ] Deduced a trap composed of 31 places in 729 ms of which 8 ms to minimize.
[2024-05-21 22:19:24] [INFO ] Deduced a trap composed of 31 places in 701 ms of which 7 ms to minimize.
[2024-05-21 22:19:25] [INFO ] Deduced a trap composed of 31 places in 652 ms of which 7 ms to minimize.
[2024-05-21 22:19:25] [INFO ] Deduced a trap composed of 31 places in 668 ms of which 7 ms to minimize.
[2024-05-21 22:19:26] [INFO ] Deduced a trap composed of 31 places in 656 ms of which 7 ms to minimize.
[2024-05-21 22:19:27] [INFO ] Deduced a trap composed of 31 places in 667 ms of which 7 ms to minimize.
[2024-05-21 22:19:27] [INFO ] Deduced a trap composed of 31 places in 688 ms of which 8 ms to minimize.
[2024-05-21 22:19:28] [INFO ] Deduced a trap composed of 31 places in 747 ms of which 7 ms to minimize.
[2024-05-21 22:19:29] [INFO ] Deduced a trap composed of 31 places in 684 ms of which 8 ms to minimize.
[2024-05-21 22:19:30] [INFO ] Deduced a trap composed of 62 places in 669 ms of which 7 ms to minimize.
[2024-05-21 22:19:30] [INFO ] Deduced a trap composed of 31 places in 681 ms of which 7 ms to minimize.
[2024-05-21 22:19:31] [INFO ] Deduced a trap composed of 31 places in 665 ms of which 8 ms to minimize.
[2024-05-21 22:19:32] [INFO ] Deduced a trap composed of 31 places in 681 ms of which 7 ms to minimize.
[2024-05-21 22:19:33] [INFO ] Deduced a trap composed of 31 places in 672 ms of which 7 ms to minimize.
[2024-05-21 22:19:33] [INFO ] Deduced a trap composed of 31 places in 668 ms of which 7 ms to minimize.
[2024-05-21 22:19:34] [INFO ] Deduced a trap composed of 31 places in 657 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2840 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2800 unsolved
[2024-05-21 22:19:36] [INFO ] Deduced a trap composed of 31 places in 711 ms of which 7 ms to minimize.
[2024-05-21 22:19:36] [INFO ] Deduced a trap composed of 31 places in 752 ms of which 8 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 Int declared 2840/6060 variables, and 81 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 39/53 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/2860 constraints, PredecessorRefiner: 0/2800 constraints, Known Traps: 42/42 constraints]
After SMT, in 62509ms problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 62552ms
Finished structural reductions in LTL mode , in 1 iterations and 112940 ms. Remains : 2860/2860 places, 3200/3200 transitions.
Built C files in :
/tmp/ltsmin1730051256380483331
[2024-05-21 22:19:36] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1730051256380483331
Running compilation step : cd /tmp/ltsmin1730051256380483331;'/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/ltsmin1730051256380483331;'/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/ltsmin1730051256380483331;'/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-21 22:19:40] [INFO ] Flatten gal took : 160 ms
[2024-05-21 22:19:40] [INFO ] Flatten gal took : 159 ms
[2024-05-21 22:19:40] [INFO ] Time to serialize gal into /tmp/LTL8002507541882546867.gal : 23 ms
[2024-05-21 22:19:40] [INFO ] Time to serialize properties into /tmp/LTL5306171869258525055.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/LTL8002507541882546867.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7640971464294620062.hoa' '-atoms' '/tmp/LTL5306171869258525055.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...317
Loading property file /tmp/LTL5306171869258525055.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7640971464294620062.hoa
Detected timeout of ITS tools.
[2024-05-21 22:19:55] [INFO ] Flatten gal took : 158 ms
[2024-05-21 22:19:55] [INFO ] Flatten gal took : 162 ms
[2024-05-21 22:19:55] [INFO ] Time to serialize gal into /tmp/LTL8917943942509887253.gal : 26 ms
[2024-05-21 22:19:55] [INFO ] Time to serialize properties into /tmp/LTL11499118353888268263.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/LTL8917943942509887253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11499118353888268263.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 : !((X(X(F(("((((((Mutex_0+Mutex_1)+(Mutex_2+Mutex_3))+((Mutex_4+Mutex_5)+(Mutex_6+Mutex_7)))+(((Mutex_8+Mutex_9)+(Mutex_10+Mutex_11))+(...13920
Formula 0 simplified : XXG(!"((((((Mutex_0+Mutex_1)+(Mutex_2+Mutex_3))+((Mutex_4+Mutex_5)+(Mutex_6+Mutex_7)))+(((Mutex_8+Mutex_9)+(Mutex_10+Mutex_11))+((Mu...13909
Detected timeout of ITS tools.
[2024-05-21 22:20:11] [INFO ] Flatten gal took : 157 ms
[2024-05-21 22:20:11] [INFO ] Applying decomposition
[2024-05-21 22:20:11] [INFO ] Flatten gal took : 158 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/graph13819870245312121375.txt' '-o' '/tmp/graph13819870245312121375.bin' '-w' '/tmp/graph13819870245312121375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13819870245312121375.bin' '-l' '-1' '-v' '-w' '/tmp/graph13819870245312121375.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:20:12] [INFO ] Decomposing Gal with order
[2024-05-21 22:20:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:20:12] [INFO ] Removed a total of 760 redundant transitions.
[2024-05-21 22:20:12] [INFO ] Flatten gal took : 718 ms
[2024-05-21 22:20:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 400 labels/synchronizations in 23 ms.
[2024-05-21 22:20:13] [INFO ] Time to serialize gal into /tmp/LTL12192480940843993438.gal : 30 ms
[2024-05-21 22:20:13] [INFO ] Time to serialize properties into /tmp/LTL10860497922310973294.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/LTL12192480940843993438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10860497922310973294.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("((((((gu19.Mutex_0+gu19.Mutex_1)+(gu19.Mutex_2+gu19.Mutex_3))+((gu19.Mutex_4+gu19.Mutex_5)+(gu19.Mutex_6+gu19.Mutex_7)))+((...18420
Formula 0 simplified : XXG(!"((((((gu19.Mutex_0+gu19.Mutex_1)+(gu19.Mutex_2+gu19.Mutex_3))+((gu19.Mutex_4+gu19.Mutex_5)+(gu19.Mutex_6+gu19.Mutex_7)))+(((gu...18409
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-12 finished in 525426 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(F((!(p0 U p1)||!p0)))&&F(p2)))))'
Found a Shortening insensitive property : DatabaseWithMutex-COL-20-LTLCardinality-15
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), (NOT p2)]
Support contains 820 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 400 Pre rules applied. Total rules applied 0 place count 3260 transition count 2800
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 0 with 800 rules applied. Total rules applied 800 place count 2860 transition count 2800
Applied a total of 800 rules in 289 ms. Remains 2860 /3260 variables (removed 400) and now considering 2800/3200 (removed 400) transitions.
// Phase 1: matrix 2800 rows 2860 cols
[2024-05-21 22:20:28] [INFO ] Computed 460 invariants in 42 ms
[2024-05-21 22:20:34] [INFO ] Implicit Places using invariants in 5513 ms returned [420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 649, 650, 651, 652, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, 723, 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819]
Discarding 400 places :
Implicit Place search using SMT only with invariants took 5527 ms to find 400 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2460/3260 places, 2800/3200 transitions.
Applied a total of 0 rules in 64 ms. Remains 2460 /2460 variables (removed 0) and now considering 2800/2800 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 5880 ms. Remains : 2460/3260 places, 2800/3200 transitions.
Running random walk in product with property : DatabaseWithMutex-COL-20-LTLCardinality-15
Product exploration explored 100000 steps with 192 reset in 2843 ms.
Product exploration explored 100000 steps with 191 reset in 2959 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 846 steps (0 resets) in 47 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 229 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 420 out of 2460 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 : 2460/2460 places, 2800/2800 transitions.
Applied a total of 0 rules in 77 ms. Remains 2460 /2460 variables (removed 0) and now considering 2800/2800 (removed 0) transitions.
// Phase 1: matrix 2800 rows 2460 cols
[2024-05-21 22:20:43] [INFO ] Computed 60 invariants in 268 ms
[2024-05-21 22:20:46] [INFO ] Implicit Places using invariants in 2720 ms returned []
[2024-05-21 22:20:46] [INFO ] Invariant cache hit.
[2024-05-21 22:21:19] [INFO ] Performed 1552/2460 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 22:21:26] [INFO ] Implicit Places using invariants and state equation in 40071 ms returned []
Implicit Place search using SMT with State Equation took 42796 ms to find 0 implicit places.
[2024-05-21 22:21:26] [INFO ] Redundant transitions in 55 ms returned []
Running 2400 sub problems to find dead transitions.
[2024-05-21 22:21:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2440 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2440/5260 variables, and 39 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2460 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2440 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:21:59] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:22:00] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 0 ms to minimize.
[2024-05-21 22:22:01] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2024-05-21 22:22:01] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2024-05-21 22:22:01] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2024-05-21 22:22:01] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:01] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:01] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:22:01] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:22:01] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2440 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:22:02] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:22:02] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:22:02] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:02] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:02] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:22:02] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:02] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:22:02] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:22:03] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:22:04] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2440 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:22:04] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:04] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:22:04] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:22:05] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:22:05] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:05] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:22:05] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:22:05] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:22:05] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:22:05] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:22:05] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:22:05] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:22:05] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:06] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:22:06] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:22:06] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:22:06] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:22:06] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:22:06] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:22:06] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2440 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:22:07] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:22:07] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:22:07] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:22:07] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:07] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:22:07] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:22:08] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-21 22:22:09] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:09] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:22:09] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2440 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:22:10] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:22:10] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:22:10] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2024-05-21 22:22:10] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 0 ms to minimize.
[2024-05-21 22:22:10] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2024-05-21 22:22:11] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2024-05-21 22:22:11] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:22:11] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:22:11] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:22:11] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:22:11] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:22:11] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:22:11] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2024-05-21 22:22:11] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:22:11] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:22:12] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:22:12] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:22:12] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-21 22:22:12] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:22:12] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2440 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:22:13] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:22:13] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:22:13] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:22:14] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:22:15] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:22:15] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:22:15] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:22:15] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:22:15] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:22:15] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2440 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:22:18] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:22:18] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:22:18] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:22:18] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:22:18] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:22:18] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 22:22:18] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:22:18] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:22:18] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:22:19] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2440 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:22:21] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:22:21] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:22:23] [INFO ] Deduced a trap composed of 29 places in 1326 ms of which 12 ms to minimize.
[2024-05-21 22:22:24] [INFO ] Deduced a trap composed of 29 places in 1222 ms of which 11 ms to minimize.
[2024-05-21 22:22:25] [INFO ] Deduced a trap composed of 29 places in 1133 ms of which 12 ms to minimize.
[2024-05-21 22:22:26] [INFO ] Deduced a trap composed of 29 places in 1112 ms of which 11 ms to minimize.
[2024-05-21 22:22:28] [INFO ] Deduced a trap composed of 29 places in 1218 ms of which 12 ms to minimize.
[2024-05-21 22:22:29] [INFO ] Deduced a trap composed of 29 places in 1061 ms of which 10 ms to minimize.
SMT process timed out in 62838ms, After SMT, problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 62859ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105815 ms. Remains : 2460/2460 places, 2800/2800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 924 steps (0 resets) in 107 ms. (8 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 86 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 84 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 193 reset in 2811 ms.
Product exploration explored 100000 steps with 192 reset in 2865 ms.
Built C files in :
/tmp/ltsmin15982452648661965081
[2024-05-21 22:22:38] [INFO ] Too many transitions (2800) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:22:38] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15982452648661965081
Running compilation step : cd /tmp/ltsmin15982452648661965081;'/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/ltsmin15982452648661965081;'/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/ltsmin15982452648661965081;'/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 420 out of 2460 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2460/2460 places, 2800/2800 transitions.
Applied a total of 0 rules in 103 ms. Remains 2460 /2460 variables (removed 0) and now considering 2800/2800 (removed 0) transitions.
[2024-05-21 22:22:41] [INFO ] Invariant cache hit.
[2024-05-21 22:22:43] [INFO ] Implicit Places using invariants in 2264 ms returned []
[2024-05-21 22:22:43] [INFO ] Invariant cache hit.
[2024-05-21 22:23:17] [INFO ] Performed 1547/2460 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-21 22:23:24] [INFO ] Implicit Places using invariants and state equation in 40831 ms returned []
Implicit Place search using SMT with State Equation took 43096 ms to find 0 implicit places.
[2024-05-21 22:23:24] [INFO ] Redundant transitions in 54 ms returned []
Running 2400 sub problems to find dead transitions.
[2024-05-21 22:23:24] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2440 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2440/5260 variables, and 39 constraints, problems are : Problem set: 0 solved, 2400 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 39/54 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/2460 constraints, PredecessorRefiner: 2400/2400 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2440 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:23:58] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:23:59] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:23:59] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:23:59] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:23:59] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:23:59] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:23:59] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:23:59] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2440 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:24:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:00] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:24:00] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:24:00] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:24:00] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:00] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:24:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:24:00] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:24:00] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:24:01] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2440 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:24:02] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:24:02] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:24:02] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:24:03] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:04] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:24:04] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:04] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:24:04] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:24:04] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2440 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:24:05] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:24:05] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:24:05] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:24:05] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:05] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:24:05] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:24:05] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:06] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:24:07] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:24:07] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2440 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:24:08] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:24:08] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:24:08] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:24:08] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 0 ms to minimize.
[2024-05-21 22:24:08] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-21 22:24:08] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 0 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:09] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 22:24:10] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 22:24:10] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 22:24:10] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2440 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:24:11] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:24:11] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-21 22:24:11] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:24:11] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 22:24:11] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:24:11] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-21 22:24:12] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:24:13] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2440 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:24:15] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 22:24:15] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2024-05-21 22:24:15] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 22:24:15] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:24:16] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 22:24:17] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 22:24:17] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-21 22:24:17] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 22:24:17] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:17] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2440 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
[2024-05-21 22:24:19] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 22:24:19] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 22:24:20] [INFO ] Deduced a trap composed of 29 places in 1287 ms of which 13 ms to minimize.
[2024-05-21 22:24:21] [INFO ] Deduced a trap composed of 29 places in 1203 ms of which 11 ms to minimize.
[2024-05-21 22:24:22] [INFO ] Deduced a trap composed of 29 places in 1157 ms of which 11 ms to minimize.
[2024-05-21 22:24:24] [INFO ] Deduced a trap composed of 29 places in 1186 ms of which 11 ms to minimize.
[2024-05-21 22:24:25] [INFO ] Deduced a trap composed of 29 places in 1204 ms of which 11 ms to minimize.
[2024-05-21 22:24:26] [INFO ] Deduced a trap composed of 29 places in 1108 ms of which 17 ms to minimize.
SMT process timed out in 62150ms, After SMT, problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 62173ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105441 ms. Remains : 2460/2460 places, 2800/2800 transitions.
Built C files in :
/tmp/ltsmin17627223045691431817
[2024-05-21 22:24:26] [INFO ] Too many transitions (2800) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:24:26] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17627223045691431817
Running compilation step : cd /tmp/ltsmin17627223045691431817;'/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/ltsmin17627223045691431817;'/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/ltsmin17627223045691431817;'/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-21 22:24:29] [INFO ] Flatten gal took : 138 ms
[2024-05-21 22:24:30] [INFO ] Flatten gal took : 151 ms
[2024-05-21 22:24:30] [INFO ] Time to serialize gal into /tmp/LTL9021503983482434737.gal : 25 ms
[2024-05-21 22:24:30] [INFO ] Time to serialize properties into /tmp/LTL3201218871320488574.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/LTL9021503983482434737.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8106653733366884485.hoa' '-atoms' '/tmp/LTL3201218871320488574.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...317
Loading property file /tmp/LTL3201218871320488574.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8106653733366884485.hoa
Detected timeout of ITS tools.
[2024-05-21 22:24:45] [INFO ] Flatten gal took : 141 ms
[2024-05-21 22:24:45] [INFO ] Flatten gal took : 143 ms
[2024-05-21 22:24:45] [INFO ] Time to serialize gal into /tmp/LTL8632748105363109315.gal : 24 ms
[2024-05-21 22:24:45] [INFO ] Time to serialize properties into /tmp/LTL3120694056296813619.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/LTL8632748105363109315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3120694056296813619.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(F((!(("((((((((((Message_0+Message_1)+(Message_2+Message_3))+((Message_4+Message_5)+(Message_6+Message_7)))+(((Message_8+Mes...16475
Formula 0 simplified : XX(FG(!"((((((((((Message_0+Message_1)+(Message_2+Message_3))+((Message_4+Message_5)+(Message_6+Message_7)))+(((Message_8+Message_9)...16459
Detected timeout of ITS tools.
[2024-05-21 22:25:00] [INFO ] Flatten gal took : 137 ms
[2024-05-21 22:25:00] [INFO ] Applying decomposition
[2024-05-21 22:25:00] [INFO ] Flatten gal took : 139 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/graph16315049614549171874.txt' '-o' '/tmp/graph16315049614549171874.bin' '-w' '/tmp/graph16315049614549171874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16315049614549171874.bin' '-l' '-1' '-v' '-w' '/tmp/graph16315049614549171874.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:25:01] [INFO ] Decomposing Gal with order
[2024-05-21 22:25:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:25:02] [INFO ] Removed a total of 990 redundant transitions.
[2024-05-21 22:25:02] [INFO ] Flatten gal took : 851 ms
[2024-05-21 22:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 13 ms.
[2024-05-21 22:25:02] [INFO ] Time to serialize gal into /tmp/LTL13918779426627814079.gal : 31 ms
[2024-05-21 22:25:02] [INFO ] Time to serialize properties into /tmp/LTL15515611441142740707.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/LTL13918779426627814079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15515611441142740707.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F((!(("((((((((((gu37.Message_0+gu37.Message_1)+(gu37.Message_2+gu37.Message_3))+((gu37.Message_4+gu37.Message_5)+(gu37.Mess...22655
Formula 0 simplified : XX(FG(!"((((((((((gu37.Message_0+gu37.Message_1)+(gu37.Message_2+gu37.Message_3))+((gu37.Message_4+gu37.Message_5)+(gu37.Message_6+g...22639
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-COL-20-LTLCardinality-15 finished in 289826 ms.
[2024-05-21 22:25:18] [INFO ] Flatten gal took : 169 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9235208971540589450
[2024-05-21 22:25:18] [INFO ] Too many transitions (3200) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:25:18] [INFO ] Applying decomposition
[2024-05-21 22:25:18] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9235208971540589450
Running compilation step : cd /tmp/ltsmin9235208971540589450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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'
[2024-05-21 22:25:18] [INFO ] Flatten gal took : 274 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/graph5193949062329243812.txt' '-o' '/tmp/graph5193949062329243812.bin' '-w' '/tmp/graph5193949062329243812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5193949062329243812.bin' '-l' '-1' '-v' '-w' '/tmp/graph5193949062329243812.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:25:21] [INFO ] Decomposing Gal with order
[2024-05-21 22:25:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:25:23] [INFO ] Removed a total of 1900 redundant transitions.
[2024-05-21 22:25:23] [INFO ] Flatten gal took : 2269 ms
[2024-05-21 22:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-21 22:25:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality4005493640332129243.gal : 37 ms
[2024-05-21 22:25:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality13537973687744194412.ltl : 2 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/LTLCardinality4005493640332129243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13537973687744194412.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...298
Read 3 LTL properties
Checking formula 0 : !(((F(("(((((((((((gu20.Acknowledge_0+gu20.Acknowledge_1)+(gu20.Acknowledge_2+gu20.Acknowledge_3))+((gu20.Acknowledge_4+gu20.Acknowled...39728
Formula 0 simplified : G(!"(((((((((((gu20.Acknowledge_0+gu20.Acknowledge_1)+(gu20.Acknowledge_2+gu20.Acknowledge_3))+((gu20.Acknowledge_4+gu20.Acknowledge...39714
Compilation finished in 13928 ms.
Running link step : cd /tmp/ltsmin9235208971540589450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin9235208971540589450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((X((LTLAPp1==true))&&(LTLAPp0==true)))||X(X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9235208971540589450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((X((LTLAPp1==true))&&(LTLAPp0==true)))||X(X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9235208971540589450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp3==true)&&(((LTLAPp4==true)&&X((LTLAPp4==true))) U X((LTLAPp5==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9235208971540589450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((LTLAPp3==true)&&(((LTLAPp4==true)&&X((LTLAPp4==true))) U X((LTLAPp5==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9235208971540589450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((!((LTLAPp6==true) U (LTLAPp4==true))||!(LTLAPp6==true))))&&<>((LTLAPp7==true)))))' '--buchi-type=spotba'
LTSmin run took 9298 ms.
FORMULA DatabaseWithMutex-COL-20-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin9235208971540589450;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((X((LTLAPp1==true))&&(LTLAPp0==true)))||X(X([]((LTLAPp2==true)))))' '--buchi-type=spotba'

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DatabaseWithMutex-COL-20"
export BK_EXAMINATION="LTLCardinality"
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 DatabaseWithMutex-COL-20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631131800027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-20.tgz
mv DatabaseWithMutex-COL-20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;