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.r021-smll-171620127800048.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 gold2023
Input is ASLink-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127800048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 516K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716405587291

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 19:19:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 19:19:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:19:51] [INFO ] Load time of PNML (sax parser for PT used): 364 ms
[2024-05-22 19:19:51] [INFO ] Transformed 1211 places.
[2024-05-22 19:19:51] [INFO ] Transformed 1827 transitions.
[2024-05-22 19:19:51] [INFO ] Found NUPN structural information;
[2024-05-22 19:19:51] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 556 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
FORMULA ASLink-PT-05a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 1211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 19 places
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1182 transition count 1808
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 1173 transition count 1771
Ensure Unique test removed 1 places
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 1172 transition count 1771
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 1172 transition count 1769
Applied a total of 50 rules in 257 ms. Remains 1172 /1211 variables (removed 39) and now considering 1769/1808 (removed 39) transitions.
// Phase 1: matrix 1769 rows 1172 cols
[2024-05-22 19:19:52] [INFO ] Computed 202 invariants in 170 ms
[2024-05-22 19:19:54] [INFO ] Implicit Places using invariants in 2091 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 386, 407, 408, 409, 427, 445, 574, 590, 595, 596, 616, 634, 763, 779, 784, 785, 786, 804, 822, 951, 956, 968, 973, 974, 975, 1009, 1011, 1014, 1032, 1033, 1035, 1036, 1053, 1061, 1069, 1075, 1081, 1087, 1093, 1101, 1107, 1113, 1121]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 2142 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1117/1211 places, 1769/1808 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1104 transition count 1756
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1104 transition count 1756
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1095 transition count 1747
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1095 transition count 1747
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1091 transition count 1743
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1091 transition count 1743
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 1090 transition count 1742
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 1090 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1089 transition count 1741
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1089 transition count 1741
Applied a total of 56 rules in 365 ms. Remains 1089 /1117 variables (removed 28) and now considering 1741/1769 (removed 28) transitions.
// Phase 1: matrix 1741 rows 1089 cols
[2024-05-22 19:19:54] [INFO ] Computed 147 invariants in 117 ms
[2024-05-22 19:19:55] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2024-05-22 19:19:55] [INFO ] Invariant cache hit.
[2024-05-22 19:20:00] [INFO ] Implicit Places using invariants and state equation in 5134 ms returned []
Implicit Place search using SMT with State Equation took 6147 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1089/1211 places, 1741/1808 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8913 ms. Remains : 1089/1211 places, 1741/1808 transitions.
Support contains 62 out of 1089 places after structural reductions.
[2024-05-22 19:20:01] [INFO ] Flatten gal took : 248 ms
[2024-05-22 19:20:01] [INFO ] Flatten gal took : 141 ms
[2024-05-22 19:20:01] [INFO ] Input system was already deterministic with 1741 transitions.
Support contains 60 out of 1089 places (down from 62) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 32) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2024-05-22 19:20:02] [INFO ] Invariant cache hit.
[2024-05-22 19:20:03] [INFO ] After 900ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-22 19:20:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2024-05-22 19:20:04] [INFO ] [Nat]Absence check using 30 positive and 117 generalized place invariants in 64 ms returned sat
[2024-05-22 19:20:28] [INFO ] After 23531ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :6
[2024-05-22 19:20:28] [INFO ] After 23537ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :6
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-22 19:20:28] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :6
Fused 20 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 273 ms.
Support contains 13 out of 1089 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1089/1089 places, 1741/1741 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 1088 transition count 1554
Reduce places removed 187 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 188 rules applied. Total rules applied 376 place count 901 transition count 1553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 377 place count 900 transition count 1553
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 140 Pre rules applied. Total rules applied 377 place count 900 transition count 1413
Deduced a syphon composed of 140 places in 3 ms
Ensure Unique test removed 45 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 3 with 325 rules applied. Total rules applied 702 place count 715 transition count 1413
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 16 rules applied. Total rules applied 718 place count 708 transition count 1404
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 727 place count 699 transition count 1404
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 727 place count 699 transition count 1384
Deduced a syphon composed of 20 places in 10 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 767 place count 679 transition count 1384
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 774 place count 672 transition count 1370
Iterating global reduction 5 with 7 rules applied. Total rules applied 781 place count 672 transition count 1370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 785 place count 672 transition count 1366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 786 place count 671 transition count 1366
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 786 place count 671 transition count 1365
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 788 place count 670 transition count 1365
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 789 place count 669 transition count 1357
Iterating global reduction 7 with 1 rules applied. Total rules applied 790 place count 669 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 791 place count 668 transition count 1349
Iterating global reduction 7 with 1 rules applied. Total rules applied 792 place count 668 transition count 1349
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 793 place count 667 transition count 1341
Iterating global reduction 7 with 1 rules applied. Total rules applied 794 place count 667 transition count 1341
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 795 place count 666 transition count 1333
Iterating global reduction 7 with 1 rules applied. Total rules applied 796 place count 666 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 797 place count 665 transition count 1325
Iterating global reduction 7 with 1 rules applied. Total rules applied 798 place count 665 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 799 place count 664 transition count 1317
Iterating global reduction 7 with 1 rules applied. Total rules applied 800 place count 664 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 801 place count 663 transition count 1309
Iterating global reduction 7 with 1 rules applied. Total rules applied 802 place count 663 transition count 1309
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 803 place count 662 transition count 1301
Iterating global reduction 7 with 1 rules applied. Total rules applied 804 place count 662 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 805 place count 661 transition count 1293
Iterating global reduction 7 with 1 rules applied. Total rules applied 806 place count 661 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 807 place count 660 transition count 1285
Iterating global reduction 7 with 1 rules applied. Total rules applied 808 place count 660 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 809 place count 659 transition count 1277
Iterating global reduction 7 with 1 rules applied. Total rules applied 810 place count 659 transition count 1277
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 811 place count 658 transition count 1269
Iterating global reduction 7 with 1 rules applied. Total rules applied 812 place count 658 transition count 1269
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 813 place count 657 transition count 1261
Iterating global reduction 7 with 1 rules applied. Total rules applied 814 place count 657 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 815 place count 656 transition count 1253
Iterating global reduction 7 with 1 rules applied. Total rules applied 816 place count 656 transition count 1253
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 928 place count 600 transition count 1197
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 929 place count 599 transition count 1196
Iterating global reduction 7 with 1 rules applied. Total rules applied 930 place count 599 transition count 1196
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 934 place count 599 transition count 1192
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 938 place count 595 transition count 1192
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 961 place count 595 transition count 1171
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 985 place count 571 transition count 1171
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 988 place count 571 transition count 1168
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 1001 place count 571 transition count 1168
Applied a total of 1001 rules in 1257 ms. Remains 571 /1089 variables (removed 518) and now considering 1168/1741 (removed 573) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1258 ms. Remains : 571/1089 places, 1168/1741 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1168 rows 571 cols
[2024-05-22 19:20:30] [INFO ] Computed 93 invariants in 18 ms
[2024-05-22 19:20:30] [INFO ] [Real]Absence check using 24 positive place invariants in 10 ms returned sat
[2024-05-22 19:20:30] [INFO ] [Real]Absence check using 24 positive and 69 generalized place invariants in 33 ms returned sat
[2024-05-22 19:20:31] [INFO ] After 1181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 19:20:32] [INFO ] [Nat]Absence check using 24 positive place invariants in 11 ms returned sat
[2024-05-22 19:20:32] [INFO ] [Nat]Absence check using 24 positive and 69 generalized place invariants in 36 ms returned sat
[2024-05-22 19:20:36] [INFO ] After 4004ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-22 19:20:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 19:20:37] [INFO ] After 881ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2024-05-22 19:20:37] [INFO ] After 1566ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 611 ms.
[2024-05-22 19:20:38] [INFO ] After 6541ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 101 ms.
Support contains 5 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 1168/1168 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 571 transition count 1167
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 570 transition count 1167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 568 transition count 1151
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 568 transition count 1151
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 567 transition count 1151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 565 transition count 1149
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 565 transition count 1148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 564 transition count 1148
Applied a total of 13 rules in 105 ms. Remains 564 /571 variables (removed 7) and now considering 1148/1168 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 564/571 places, 1148/1168 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 220601 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220601 steps, saw 100873 distinct states, run finished after 3004 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1148 rows 564 cols
[2024-05-22 19:20:42] [INFO ] Computed 92 invariants in 13 ms
[2024-05-22 19:20:42] [INFO ] [Real]Absence check using 26 positive place invariants in 15 ms returned sat
[2024-05-22 19:20:42] [INFO ] [Real]Absence check using 26 positive and 66 generalized place invariants in 32 ms returned sat
[2024-05-22 19:20:43] [INFO ] After 947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 19:20:43] [INFO ] [Nat]Absence check using 26 positive place invariants in 14 ms returned sat
[2024-05-22 19:20:43] [INFO ] [Nat]Absence check using 26 positive and 66 generalized place invariants in 38 ms returned sat
[2024-05-22 19:20:44] [INFO ] After 1228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 19:20:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-22 19:20:45] [INFO ] After 1046ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 19:20:46] [INFO ] After 1883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1385 ms.
[2024-05-22 19:20:47] [INFO ] After 4734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 173 ms.
Support contains 5 out of 564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 564/564 places, 1148/1148 transitions.
Applied a total of 0 rules in 28 ms. Remains 564 /564 variables (removed 0) and now considering 1148/1148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 564/564 places, 1148/1148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 564/564 places, 1148/1148 transitions.
Applied a total of 0 rules in 24 ms. Remains 564 /564 variables (removed 0) and now considering 1148/1148 (removed 0) transitions.
[2024-05-22 19:20:47] [INFO ] Invariant cache hit.
[2024-05-22 19:20:48] [INFO ] Implicit Places using invariants in 618 ms returned [89, 95, 98, 100, 103, 110, 111, 112, 188, 196, 202, 219, 220, 223, 292, 298, 301, 303, 306, 313, 314, 315, 316, 391, 397, 400, 402, 406, 413, 414, 415, 484, 490, 493, 495, 498, 511]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 623 ms to find 37 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 527/564 places, 1148/1148 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 527 transition count 1142
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 521 transition count 1142
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 12 place count 521 transition count 1132
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 32 place count 511 transition count 1132
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 510 transition count 1132
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 51 place count 492 transition count 1114
Iterating global reduction 3 with 18 rules applied. Total rules applied 69 place count 492 transition count 1114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 73 place count 492 transition count 1110
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 79 place count 486 transition count 1104
Iterating global reduction 4 with 6 rules applied. Total rules applied 85 place count 486 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 485 transition count 1103
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 485 transition count 1103
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 101 place count 478 transition count 1096
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 102 place count 478 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 103 place count 477 transition count 1094
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 477 transition count 1094
Free-agglomeration rule applied 15 times.
Iterating global reduction 5 with 15 rules applied. Total rules applied 119 place count 477 transition count 1079
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 134 place count 462 transition count 1079
Applied a total of 134 rules in 142 ms. Remains 462 /527 variables (removed 65) and now considering 1079/1148 (removed 69) transitions.
// Phase 1: matrix 1079 rows 462 cols
[2024-05-22 19:20:48] [INFO ] Computed 54 invariants in 11 ms
[2024-05-22 19:20:49] [INFO ] Implicit Places using invariants in 501 ms returned [72, 89, 147, 178, 236, 253, 309, 326, 382, 399]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 504 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 452/564 places, 1079/1148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 451 transition count 1078
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 1078
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 447 transition count 1074
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 447 transition count 1070
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 443 transition count 1070
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 443 transition count 1070
Applied a total of 19 rules in 72 ms. Remains 443 /452 variables (removed 9) and now considering 1070/1079 (removed 9) transitions.
// Phase 1: matrix 1070 rows 443 cols
[2024-05-22 19:20:49] [INFO ] Computed 44 invariants in 14 ms
[2024-05-22 19:20:49] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-22 19:20:49] [INFO ] Invariant cache hit.
[2024-05-22 19:20:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 19:20:51] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 443/564 places, 1070/1148 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3459 ms. Remains : 443/564 places, 1070/1148 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 329935 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 329935 steps, saw 230325 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-22 19:20:54] [INFO ] Invariant cache hit.
[2024-05-22 19:20:54] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-22 19:20:54] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 21 ms returned sat
[2024-05-22 19:20:55] [INFO ] After 618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 19:20:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-22 19:20:55] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 20 ms returned sat
[2024-05-22 19:20:56] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 19:20:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 19:20:57] [INFO ] After 621ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 19:20:57] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-22 19:20:57] [INFO ] After 1660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 443 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 443/443 places, 1070/1070 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 443 transition count 1068
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 441 transition count 1068
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 440 transition count 1067
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 440 transition count 1066
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 439 transition count 1065
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 439 transition count 1063
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13 place count 437 transition count 1063
Applied a total of 13 rules in 69 ms. Remains 437 /443 variables (removed 6) and now considering 1063/1070 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 437/443 places, 1063/1070 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 356895 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 356895 steps, saw 141978 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1063 rows 437 cols
[2024-05-22 19:21:00] [INFO ] Computed 44 invariants in 10 ms
[2024-05-22 19:21:00] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-22 19:21:00] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 17 ms returned sat
[2024-05-22 19:21:00] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 19:21:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-22 19:21:00] [INFO ] [Nat]Absence check using 14 positive and 30 generalized place invariants in 20 ms returned sat
[2024-05-22 19:21:01] [INFO ] After 642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 19:21:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 19:21:02] [INFO ] After 633ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 19:21:02] [INFO ] After 698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-22 19:21:02] [INFO ] After 1500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1063/1063 transitions.
Applied a total of 0 rules in 14 ms. Remains 437 /437 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 437/437 places, 1063/1063 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1063/1063 transitions.
Applied a total of 0 rules in 14 ms. Remains 437 /437 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
[2024-05-22 19:21:02] [INFO ] Invariant cache hit.
[2024-05-22 19:21:02] [INFO ] Implicit Places using invariants in 425 ms returned [124, 171]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 427 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 435/437 places, 1063/1063 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 435 transition count 1062
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 434 transition count 1062
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 433 transition count 1062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 432 transition count 1061
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 432 transition count 1060
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 431 transition count 1059
Applied a total of 8 rules in 44 ms. Remains 431 /435 variables (removed 4) and now considering 1059/1063 (removed 4) transitions.
// Phase 1: matrix 1059 rows 431 cols
[2024-05-22 19:21:02] [INFO ] Computed 41 invariants in 11 ms
[2024-05-22 19:21:03] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-22 19:21:03] [INFO ] Invariant cache hit.
[2024-05-22 19:21:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 19:21:04] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 2070 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 431/437 places, 1059/1063 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2556 ms. Remains : 431/437 places, 1059/1063 transitions.
Incomplete random walk after 10000 steps, including 183 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 376521 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 376521 steps, saw 254479 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 19:21:07] [INFO ] Invariant cache hit.
[2024-05-22 19:21:07] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-22 19:21:08] [INFO ] [Real]Absence check using 11 positive and 30 generalized place invariants in 20 ms returned sat
[2024-05-22 19:21:08] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 19:21:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 19:21:08] [INFO ] [Nat]Absence check using 11 positive and 30 generalized place invariants in 21 ms returned sat
[2024-05-22 19:21:09] [INFO ] After 1269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 19:21:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 19:21:10] [INFO ] After 1051ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 19:21:10] [INFO ] After 1124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-22 19:21:10] [INFO ] After 2549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1059/1059 transitions.
Applied a total of 0 rules in 16 ms. Remains 431 /431 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 431/431 places, 1059/1059 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 1059/1059 transitions.
Applied a total of 0 rules in 16 ms. Remains 431 /431 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-05-22 19:21:11] [INFO ] Invariant cache hit.
[2024-05-22 19:21:11] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-22 19:21:11] [INFO ] Invariant cache hit.
[2024-05-22 19:21:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 19:21:13] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 2082 ms to find 0 implicit places.
[2024-05-22 19:21:13] [INFO ] Redundant transitions in 84 ms returned []
[2024-05-22 19:21:13] [INFO ] Invariant cache hit.
[2024-05-22 19:21:14] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3191 ms. Remains : 431/431 places, 1059/1059 transitions.
Applied a total of 0 rules in 14 ms. Remains 431 /431 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 19:21:14] [INFO ] Invariant cache hit.
[2024-05-22 19:21:14] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 19:21:14] [INFO ] [Real]Absence check using 11 positive and 30 generalized place invariants in 19 ms returned sat
[2024-05-22 19:21:14] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 19:21:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 19:21:14] [INFO ] [Nat]Absence check using 11 positive and 30 generalized place invariants in 20 ms returned sat
[2024-05-22 19:21:16] [INFO ] After 1292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 19:21:16] [INFO ] After 1357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-05-22 19:21:16] [INFO ] After 1505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 14 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-05a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-05a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1089/1089 places, 1741/1741 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 0 with 194 rules applied. Total rules applied 194 place count 1087 transition count 1546
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 204 rules applied. Total rules applied 398 place count 887 transition count 1542
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 402 place count 883 transition count 1542
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 152 Pre rules applied. Total rules applied 402 place count 883 transition count 1390
Deduced a syphon composed of 152 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 3 with 349 rules applied. Total rules applied 751 place count 686 transition count 1390
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 31 rules applied. Total rules applied 782 place count 672 transition count 1373
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 799 place count 655 transition count 1373
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 799 place count 655 transition count 1352
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 841 place count 634 transition count 1352
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 852 place count 623 transition count 1329
Iterating global reduction 5 with 11 rules applied. Total rules applied 863 place count 623 transition count 1329
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 8 rules applied. Total rules applied 871 place count 622 transition count 1322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 871 place count 622 transition count 1321
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 873 place count 621 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 874 place count 620 transition count 1313
Iterating global reduction 6 with 1 rules applied. Total rules applied 875 place count 620 transition count 1313
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 876 place count 619 transition count 1305
Iterating global reduction 6 with 1 rules applied. Total rules applied 877 place count 619 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 878 place count 618 transition count 1297
Iterating global reduction 6 with 1 rules applied. Total rules applied 879 place count 618 transition count 1297
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 880 place count 617 transition count 1289
Iterating global reduction 6 with 1 rules applied. Total rules applied 881 place count 617 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 882 place count 616 transition count 1281
Iterating global reduction 6 with 1 rules applied. Total rules applied 883 place count 616 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 884 place count 615 transition count 1273
Iterating global reduction 6 with 1 rules applied. Total rules applied 885 place count 615 transition count 1273
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 886 place count 614 transition count 1265
Iterating global reduction 6 with 1 rules applied. Total rules applied 887 place count 614 transition count 1265
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 888 place count 613 transition count 1257
Iterating global reduction 6 with 1 rules applied. Total rules applied 889 place count 613 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 890 place count 612 transition count 1249
Iterating global reduction 6 with 1 rules applied. Total rules applied 891 place count 612 transition count 1249
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 892 place count 611 transition count 1241
Iterating global reduction 6 with 1 rules applied. Total rules applied 893 place count 611 transition count 1241
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 894 place count 610 transition count 1233
Iterating global reduction 6 with 1 rules applied. Total rules applied 895 place count 610 transition count 1233
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 896 place count 609 transition count 1225
Iterating global reduction 6 with 1 rules applied. Total rules applied 897 place count 609 transition count 1225
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 898 place count 608 transition count 1217
Iterating global reduction 6 with 1 rules applied. Total rules applied 899 place count 608 transition count 1217
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 900 place count 607 transition count 1209
Iterating global reduction 6 with 1 rules applied. Total rules applied 901 place count 607 transition count 1209
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 902 place count 606 transition count 1201
Iterating global reduction 6 with 1 rules applied. Total rules applied 903 place count 606 transition count 1201
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 6 with 116 rules applied. Total rules applied 1019 place count 548 transition count 1143
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1021 place count 546 transition count 1141
Iterating global reduction 6 with 2 rules applied. Total rules applied 1023 place count 546 transition count 1141
Applied a total of 1023 rules in 392 ms. Remains 546 /1089 variables (removed 543) and now considering 1141/1741 (removed 600) transitions.
// Phase 1: matrix 1141 rows 546 cols
[2024-05-22 19:21:17] [INFO ] Computed 80 invariants in 16 ms
[2024-05-22 19:21:17] [INFO ] Implicit Places using invariants in 553 ms returned [72, 89, 95, 100, 125, 143, 161, 183, 191, 197, 200, 260, 277, 283, 288, 290, 299, 352, 373, 379, 384, 386, 446, 463, 469, 474, 476, 543]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 556 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 518/1089 places, 1141/1741 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 518 transition count 1131
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 508 transition count 1130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 31 place count 498 transition count 1120
Iterating global reduction 2 with 10 rules applied. Total rules applied 41 place count 498 transition count 1120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 51 place count 488 transition count 1110
Iterating global reduction 2 with 10 rules applied. Total rules applied 61 place count 488 transition count 1110
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 483 transition count 1105
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 483 transition count 1105
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 101 place count 468 transition count 1090
Applied a total of 101 rules in 70 ms. Remains 468 /518 variables (removed 50) and now considering 1090/1141 (removed 51) transitions.
// Phase 1: matrix 1090 rows 468 cols
[2024-05-22 19:21:17] [INFO ] Computed 52 invariants in 9 ms
[2024-05-22 19:21:18] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-22 19:21:18] [INFO ] Invariant cache hit.
[2024-05-22 19:21:19] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 2095 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 468/1089 places, 1090/1741 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3115 ms. Remains : 468/1089 places, 1090/1741 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s461 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1471 reset in 536 ms.
Product exploration explored 100000 steps with 1487 reset in 434 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7944 steps, including 112 resets, run visited all 1 properties in 21 ms. (steps per millisecond=378 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 1090/1090 transitions.
Applied a total of 0 rules in 17 ms. Remains 468 /468 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2024-05-22 19:21:21] [INFO ] Invariant cache hit.
[2024-05-22 19:21:22] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-05-22 19:21:22] [INFO ] Invariant cache hit.
[2024-05-22 19:21:23] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
[2024-05-22 19:21:23] [INFO ] Redundant transitions in 279 ms returned []
[2024-05-22 19:21:23] [INFO ] Invariant cache hit.
[2024-05-22 19:21:24] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3295 ms. Remains : 468/468 places, 1090/1090 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1664 steps, including 23 resets, run visited all 1 properties in 8 ms. (steps per millisecond=208 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1485 reset in 224 ms.
Product exploration explored 100000 steps with 1514 reset in 262 ms.
Built C files in :
/tmp/ltsmin12523498609312441107
[2024-05-22 19:21:25] [INFO ] Computing symmetric may disable matrix : 1090 transitions.
[2024-05-22 19:21:25] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:21:25] [INFO ] Computing symmetric may enable matrix : 1090 transitions.
[2024-05-22 19:21:25] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:21:25] [INFO ] Computing Do-Not-Accords matrix : 1090 transitions.
[2024-05-22 19:21:25] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:21:26] [INFO ] Built C files in 275ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12523498609312441107
Running compilation step : cd /tmp/ltsmin12523498609312441107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12523498609312441107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12523498609312441107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 1090/1090 transitions.
Applied a total of 0 rules in 18 ms. Remains 468 /468 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2024-05-22 19:21:29] [INFO ] Invariant cache hit.
[2024-05-22 19:21:29] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-22 19:21:29] [INFO ] Invariant cache hit.
[2024-05-22 19:21:30] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
[2024-05-22 19:21:30] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-22 19:21:30] [INFO ] Invariant cache hit.
[2024-05-22 19:21:31] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2837 ms. Remains : 468/468 places, 1090/1090 transitions.
Built C files in :
/tmp/ltsmin876782727666175652
[2024-05-22 19:21:31] [INFO ] Computing symmetric may disable matrix : 1090 transitions.
[2024-05-22 19:21:31] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:21:31] [INFO ] Computing symmetric may enable matrix : 1090 transitions.
[2024-05-22 19:21:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:21:32] [INFO ] Computing Do-Not-Accords matrix : 1090 transitions.
[2024-05-22 19:21:32] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 19:21:32] [INFO ] Built C files in 368ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin876782727666175652
Running compilation step : cd /tmp/ltsmin876782727666175652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin876782727666175652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin876782727666175652;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 19:21:35] [INFO ] Flatten gal took : 72 ms
[2024-05-22 19:21:35] [INFO ] Flatten gal took : 65 ms
[2024-05-22 19:21:35] [INFO ] Time to serialize gal into /tmp/LTL11870265480494785886.gal : 13 ms
[2024-05-22 19:21:35] [INFO ] Time to serialize properties into /tmp/LTL8061451173406631145.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11870265480494785886.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16651928317651867699.hoa' '-atoms' '/tmp/LTL8061451173406631145.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8061451173406631145.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16651928317651867699.hoa
Detected timeout of ITS tools.
[2024-05-22 19:21:50] [INFO ] Flatten gal took : 56 ms
[2024-05-22 19:21:50] [INFO ] Flatten gal took : 54 ms
[2024-05-22 19:21:50] [INFO ] Time to serialize gal into /tmp/LTL12918290658349280757.gal : 10 ms
[2024-05-22 19:21:50] [INFO ] Time to serialize properties into /tmp/LTL15274053668656518826.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12918290658349280757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15274053668656518826.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1133==0)"))))
Formula 0 simplified : FG!"(p1133==0)"
Detected timeout of ITS tools.
[2024-05-22 19:22:05] [INFO ] Flatten gal took : 46 ms
[2024-05-22 19:22:05] [INFO ] Applying decomposition
[2024-05-22 19:22:05] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8597047105244815829.txt' '-o' '/tmp/graph8597047105244815829.bin' '-w' '/tmp/graph8597047105244815829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8597047105244815829.bin' '-l' '-1' '-v' '-w' '/tmp/graph8597047105244815829.weights' '-q' '0' '-e' '0.001'
[2024-05-22 19:22:06] [INFO ] Decomposing Gal with order
[2024-05-22 19:22:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:22:06] [INFO ] Removed a total of 2198 redundant transitions.
[2024-05-22 19:22:06] [INFO ] Flatten gal took : 166 ms
[2024-05-22 19:22:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 32 ms.
[2024-05-22 19:22:06] [INFO ] Time to serialize gal into /tmp/LTL14448566304216811389.gal : 17 ms
[2024-05-22 19:22:06] [INFO ] Time to serialize properties into /tmp/LTL12581909359587777121.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14448566304216811389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12581909359587777121.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(i10.u122.p1133==0)"))))
Formula 0 simplified : FG!"(i10.u122.p1133==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13429702020957978598
[2024-05-22 19:22:21] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13429702020957978598
Running compilation step : cd /tmp/ltsmin13429702020957978598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13429702020957978598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13429702020957978598;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-05a-LTLFireability-01 finished in 68168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1 U G(p2)))))'
Support contains 6 out of 1089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1089/1089 places, 1741/1741 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1088 transition count 1546
Reduce places removed 195 places and 0 transitions.
Iterating post reduction 1 with 195 rules applied. Total rules applied 390 place count 893 transition count 1546
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 140 Pre rules applied. Total rules applied 390 place count 893 transition count 1406
Deduced a syphon composed of 140 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 325 rules applied. Total rules applied 715 place count 708 transition count 1406
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 15 rules applied. Total rules applied 730 place count 701 transition count 1398
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 739 place count 693 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 740 place count 692 transition count 1397
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 740 place count 692 transition count 1377
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 780 place count 672 transition count 1377
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 788 place count 664 transition count 1357
Iterating global reduction 5 with 8 rules applied. Total rules applied 796 place count 664 transition count 1357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 801 place count 663 transition count 1353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 802 place count 662 transition count 1353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 802 place count 662 transition count 1352
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 804 place count 661 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 805 place count 660 transition count 1344
Iterating global reduction 7 with 1 rules applied. Total rules applied 806 place count 660 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 807 place count 659 transition count 1336
Iterating global reduction 7 with 1 rules applied. Total rules applied 808 place count 659 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 809 place count 658 transition count 1328
Iterating global reduction 7 with 1 rules applied. Total rules applied 810 place count 658 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 811 place count 657 transition count 1320
Iterating global reduction 7 with 1 rules applied. Total rules applied 812 place count 657 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 813 place count 656 transition count 1312
Iterating global reduction 7 with 1 rules applied. Total rules applied 814 place count 656 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 815 place count 655 transition count 1304
Iterating global reduction 7 with 1 rules applied. Total rules applied 816 place count 655 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 817 place count 654 transition count 1296
Iterating global reduction 7 with 1 rules applied. Total rules applied 818 place count 654 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 819 place count 653 transition count 1288
Iterating global reduction 7 with 1 rules applied. Total rules applied 820 place count 653 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 821 place count 652 transition count 1280
Iterating global reduction 7 with 1 rules applied. Total rules applied 822 place count 652 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 823 place count 651 transition count 1272
Iterating global reduction 7 with 1 rules applied. Total rules applied 824 place count 651 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 825 place count 650 transition count 1264
Iterating global reduction 7 with 1 rules applied. Total rules applied 826 place count 650 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 827 place count 649 transition count 1256
Iterating global reduction 7 with 1 rules applied. Total rules applied 828 place count 649 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 829 place count 648 transition count 1248
Iterating global reduction 7 with 1 rules applied. Total rules applied 830 place count 648 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 831 place count 647 transition count 1240
Iterating global reduction 7 with 1 rules applied. Total rules applied 832 place count 647 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 833 place count 646 transition count 1232
Iterating global reduction 7 with 1 rules applied. Total rules applied 834 place count 646 transition count 1232
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 118 rules applied. Total rules applied 952 place count 587 transition count 1173
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 954 place count 585 transition count 1171
Iterating global reduction 7 with 2 rules applied. Total rules applied 956 place count 585 transition count 1171
Applied a total of 956 rules in 338 ms. Remains 585 /1089 variables (removed 504) and now considering 1171/1741 (removed 570) transitions.
// Phase 1: matrix 1171 rows 585 cols
[2024-05-22 19:22:25] [INFO ] Computed 93 invariants in 12 ms
[2024-05-22 19:22:25] [INFO ] Implicit Places using invariants in 618 ms returned [90, 96, 101, 117, 153, 194, 202, 208, 228, 229, 299, 305, 310, 326, 327, 402, 408, 413, 429, 499, 505, 510, 529]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 621 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1089 places, 1171/1741 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 562 transition count 1166
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 557 transition count 1166
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 557 transition count 1155
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 546 transition count 1155
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 544 transition count 1153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 542 transition count 1153
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 50 place count 530 transition count 1141
Iterating global reduction 4 with 12 rules applied. Total rules applied 62 place count 530 transition count 1141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 530 transition count 1140
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 73 place count 520 transition count 1130
Iterating global reduction 5 with 10 rules applied. Total rules applied 83 place count 520 transition count 1130
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 88 place count 515 transition count 1125
Iterating global reduction 5 with 5 rules applied. Total rules applied 93 place count 515 transition count 1125
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 115 place count 504 transition count 1114
Applied a total of 115 rules in 82 ms. Remains 504 /562 variables (removed 58) and now considering 1114/1171 (removed 57) transitions.
// Phase 1: matrix 1114 rows 504 cols
[2024-05-22 19:22:25] [INFO ] Computed 68 invariants in 10 ms
[2024-05-22 19:22:26] [INFO ] Implicit Places using invariants in 684 ms returned [93, 96, 157, 185, 266, 269, 350, 353, 434, 437]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 686 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1089 places, 1114/1741 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 494 transition count 1110
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 490 transition count 1110
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 486 transition count 1106
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 486 transition count 1106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 486 transition count 1102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 484 transition count 1100
Applied a total of 24 rules in 44 ms. Remains 484 /494 variables (removed 10) and now considering 1100/1114 (removed 14) transitions.
// Phase 1: matrix 1100 rows 484 cols
[2024-05-22 19:22:26] [INFO ] Computed 58 invariants in 18 ms
[2024-05-22 19:22:27] [INFO ] Implicit Places using invariants in 812 ms returned [72, 237, 317, 397]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 818 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 480/1089 places, 1100/1741 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 476 transition count 1096
Applied a total of 8 rules in 40 ms. Remains 476 /480 variables (removed 4) and now considering 1096/1100 (removed 4) transitions.
// Phase 1: matrix 1096 rows 476 cols
[2024-05-22 19:22:27] [INFO ] Computed 54 invariants in 15 ms
[2024-05-22 19:22:27] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-22 19:22:27] [INFO ] Invariant cache hit.
[2024-05-22 19:22:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 19:22:29] [INFO ] Implicit Places using invariants and state equation in 1611 ms returned []
Implicit Place search using SMT with State Equation took 2259 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 476/1089 places, 1096/1741 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 4892 ms. Remains : 476/1089 places, 1096/1741 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s212 0) (EQ s258 0)), p2:(AND (EQ s473 1) (EQ s474 1)), p1:(AND (EQ s115 1) (EQ s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-05a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-03 finished in 5078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0&&X(F(p1))))'
Support contains 4 out of 1089 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1089/1089 places, 1741/1741 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1086 transition count 1726
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1086 transition count 1726
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1084 transition count 1717
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1084 transition count 1717
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1082 transition count 1708
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1082 transition count 1708
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 1080 transition count 1699
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 1080 transition count 1699
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 1078 transition count 1690
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 1078 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 1076 transition count 1681
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 1076 transition count 1681
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1074 transition count 1672
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1074 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1073 transition count 1664
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1073 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1072 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1072 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1071 transition count 1648
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1071 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1070 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1070 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1069 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1069 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1068 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1068 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1067 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1067 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1066 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1066 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 1065 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 1065 transition count 1600
Applied a total of 48 rules in 481 ms. Remains 1065 /1089 variables (removed 24) and now considering 1600/1741 (removed 141) transitions.
// Phase 1: matrix 1600 rows 1065 cols
[2024-05-22 19:22:30] [INFO ] Computed 147 invariants in 15 ms
[2024-05-22 19:22:31] [INFO ] Implicit Places using invariants in 894 ms returned [227, 245, 389, 575]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 895 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1061/1089 places, 1600/1741 transitions.
Applied a total of 0 rules in 26 ms. Remains 1061 /1061 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1404 ms. Remains : 1061/1089 places, 1600/1741 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(OR (EQ s413 0) (EQ s561 0)), p0:(AND (EQ s971 1) (EQ s1017 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1575 ms.
Product exploration explored 100000 steps with 50000 reset in 1603 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-05a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05a-LTLFireability-05 finished in 4715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 3 out of 1089 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1089/1089 places, 1741/1741 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1088 transition count 1741
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 1086 transition count 1732
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 1086 transition count 1732
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 1084 transition count 1723
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 1084 transition count 1723
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 1082 transition count 1714
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 1082 transition count 1714
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1080 transition count 1705
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1080 transition count 1705
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 1078 transition count 1696
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 1078 transition count 1696
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 1076 transition count 1687
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 1076 transition count 1687
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 1074 transition count 1678
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 1074 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1073 transition count 1670
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1073 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1072 transition count 1662
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1072 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1071 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1071 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1070 transition count 1646
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1070 transition count 1646
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1069 transition count 1638
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1069 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1068 transition count 1630
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1068 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1067 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1067 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1066 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1066 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1065 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1065 transition count 1606
Applied a total of 47 rules in 469 ms. Remains 1065 /1089 variables (removed 24) and now considering 1606/1741 (removed 135) transitions.
// Phase 1: matrix 1606 rows 1065 cols
[2024-05-22 19:22:34] [INFO ] Computed 146 invariants in 15 ms
[2024-05-22 19:22:36] [INFO ] Implicit Places using invariants in 1102 ms returned [227, 245, 389]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1105 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1062/1089 places, 1606/1741 transitions.
Applied a total of 0 rules in 39 ms. Remains 1062 /1062 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1617 ms. Remains : 1062/1089 places, 1606/1741 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s573 1) (EQ s728 1)), p1:(NEQ s263 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 629 reset in 280 ms.
Product exploration explored 100000 steps with 616 reset in 311 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 111 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 66 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 144284 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144284 steps, saw 58518 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1606 rows 1062 cols
[2024-05-22 19:22:40] [INFO ] Computed 143 invariants in 20 ms
[2024-05-22 19:22:40] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2024-05-22 19:22:40] [INFO ] [Real]Absence check using 30 positive and 113 generalized place invariants in 56 ms returned sat
[2024-05-22 19:22:41] [INFO ] After 1382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 19:22:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2024-05-22 19:22:42] [INFO ] [Nat]Absence check using 30 positive and 113 generalized place invariants in 58 ms returned sat
[2024-05-22 19:22:43] [INFO ] After 951ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 19:22:43] [INFO ] After 1362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 237 ms.
[2024-05-22 19:22:43] [INFO ] After 1972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1062 transition count 1408
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 864 transition count 1407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 863 transition count 1407
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 141 Pre rules applied. Total rules applied 398 place count 863 transition count 1266
Deduced a syphon composed of 141 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 327 rules applied. Total rules applied 725 place count 677 transition count 1266
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 17 rules applied. Total rules applied 742 place count 669 transition count 1257
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 751 place count 660 transition count 1257
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 751 place count 660 transition count 1237
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 791 place count 640 transition count 1237
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 796 place count 635 transition count 1232
Iterating global reduction 5 with 5 rules applied. Total rules applied 801 place count 635 transition count 1232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 805 place count 635 transition count 1228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 806 place count 634 transition count 1228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 806 place count 634 transition count 1227
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 808 place count 633 transition count 1227
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 922 place count 576 transition count 1170
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 926 place count 576 transition count 1166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 930 place count 572 transition count 1166
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 950 place count 572 transition count 1146
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 971 place count 551 transition count 1146
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 974 place count 551 transition count 1143
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 990 place count 551 transition count 1143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 991 place count 550 transition count 1142
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 996 place count 545 transition count 1142
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 996 place count 545 transition count 1132
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 25 rules applied. Total rules applied 1021 place count 530 transition count 1132
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1026 place count 525 transition count 1127
Iterating global reduction 10 with 5 rules applied. Total rules applied 1031 place count 525 transition count 1127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1036 place count 525 transition count 1122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1038 place count 524 transition count 1121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1039 place count 524 transition count 1120
Applied a total of 1039 rules in 240 ms. Remains 524 /1062 variables (removed 538) and now considering 1120/1606 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 524/1062 places, 1120/1606 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Finished probabilistic random walk after 114738 steps, run visited all 4 properties in 1240 ms. (steps per millisecond=92 )
Probabilistic random walk after 114738 steps, saw 32664 distinct states, run finished after 1240 ms. (steps per millisecond=92 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 234 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Applied a total of 0 rules in 26 ms. Remains 1062 /1062 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2024-05-22 19:22:46] [INFO ] Invariant cache hit.
[2024-05-22 19:22:47] [INFO ] Implicit Places using invariants in 956 ms returned []
[2024-05-22 19:22:47] [INFO ] Invariant cache hit.
[2024-05-22 19:22:50] [INFO ] Implicit Places using invariants and state equation in 2831 ms returned []
Implicit Place search using SMT with State Equation took 3792 ms to find 0 implicit places.
[2024-05-22 19:22:50] [INFO ] Invariant cache hit.
[2024-05-22 19:22:52] [INFO ] Dead Transitions using invariants and state equation in 1956 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5776 ms. Remains : 1062/1062 places, 1606/1606 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 143279 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143279 steps, saw 58036 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 19:22:55] [INFO ] Invariant cache hit.
[2024-05-22 19:22:56] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2024-05-22 19:22:56] [INFO ] [Real]Absence check using 30 positive and 113 generalized place invariants in 57 ms returned sat
[2024-05-22 19:22:57] [INFO ] After 1313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 19:22:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2024-05-22 19:22:57] [INFO ] [Nat]Absence check using 30 positive and 113 generalized place invariants in 57 ms returned sat
[2024-05-22 19:22:58] [INFO ] After 1134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 19:22:59] [INFO ] After 1564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 243 ms.
[2024-05-22 19:22:59] [INFO ] After 2186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 87 ms.
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1062 transition count 1408
Reduce places removed 198 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 397 place count 864 transition count 1407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 863 transition count 1407
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 141 Pre rules applied. Total rules applied 398 place count 863 transition count 1266
Deduced a syphon composed of 141 places in 2 ms
Ensure Unique test removed 45 places
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 3 with 327 rules applied. Total rules applied 725 place count 677 transition count 1266
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 17 rules applied. Total rules applied 742 place count 669 transition count 1257
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 751 place count 660 transition count 1257
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 751 place count 660 transition count 1237
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 791 place count 640 transition count 1237
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 796 place count 635 transition count 1232
Iterating global reduction 5 with 5 rules applied. Total rules applied 801 place count 635 transition count 1232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 805 place count 635 transition count 1228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 806 place count 634 transition count 1228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 806 place count 634 transition count 1227
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 808 place count 633 transition count 1227
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 922 place count 576 transition count 1170
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 926 place count 576 transition count 1166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 930 place count 572 transition count 1166
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 950 place count 572 transition count 1146
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 971 place count 551 transition count 1146
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 974 place count 551 transition count 1143
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 990 place count 551 transition count 1143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 991 place count 550 transition count 1142
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 996 place count 545 transition count 1142
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 10 Pre rules applied. Total rules applied 996 place count 545 transition count 1132
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 25 rules applied. Total rules applied 1021 place count 530 transition count 1132
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1026 place count 525 transition count 1127
Iterating global reduction 10 with 5 rules applied. Total rules applied 1031 place count 525 transition count 1127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1036 place count 525 transition count 1122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1038 place count 524 transition count 1121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1039 place count 524 transition count 1120
Applied a total of 1039 rules in 220 ms. Remains 524 /1062 variables (removed 538) and now considering 1120/1606 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 524/1062 places, 1120/1606 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Finished probabilistic random walk after 114738 steps, run visited all 4 properties in 1263 ms. (steps per millisecond=90 )
Probabilistic random walk after 114738 steps, saw 32664 distinct states, run finished after 1263 ms. (steps per millisecond=90 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 595 reset in 277 ms.
Product exploration explored 100000 steps with 570 reset in 310 ms.
Built C files in :
/tmp/ltsmin9788606811067876773
[2024-05-22 19:23:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9788606811067876773
Running compilation step : cd /tmp/ltsmin9788606811067876773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9788606811067876773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9788606811067876773;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1606/1606 transitions.
Applied a total of 0 rules in 27 ms. Remains 1062 /1062 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2024-05-22 19:23:05] [INFO ] Invariant cache hit.
[2024-05-22 19:23:06] [INFO ] Implicit Places using invariants in 987 ms returned []
[2024-05-22 19:23:06] [INFO ] Invariant cache hit.
[2024-05-22 19:23:09] [INFO ] Implicit Places using invariants and state equation in 2809 ms returned []
Implicit Place search using SMT with State Equation took 3798 ms to find 0 implicit places.
[2024-05-22 19:23:09] [INFO ] Invariant cache hit.
[2024-05-22 19:23:11] [INFO ] Dead Transitions using invariants and state equation in 1911 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5737 ms. Remains : 1062/1062 places, 1606/1606 transitions.
Built C files in :
/tmp/ltsmin4451297724751037203
[2024-05-22 19:23:11] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4451297724751037203
Running compilation step : cd /tmp/ltsmin4451297724751037203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4451297724751037203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4451297724751037203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 19:23:14] [INFO ] Flatten gal took : 67 ms
[2024-05-22 19:23:14] [INFO ] Flatten gal took : 69 ms
[2024-05-22 19:23:14] [INFO ] Time to serialize gal into /tmp/LTL5772069831162927843.gal : 13 ms
[2024-05-22 19:23:14] [INFO ] Time to serialize properties into /tmp/LTL4369465402758687493.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5772069831162927843.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13827195544266145668.hoa' '-atoms' '/tmp/LTL4369465402758687493.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4369465402758687493.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13827195544266145668.hoa
Detected timeout of ITS tools.
[2024-05-22 19:23:29] [INFO ] Flatten gal took : 59 ms
[2024-05-22 19:23:29] [INFO ] Flatten gal took : 65 ms
[2024-05-22 19:23:29] [INFO ] Time to serialize gal into /tmp/LTL13319626993629050234.gal : 11 ms
[2024-05-22 19:23:29] [INFO ] Time to serialize properties into /tmp/LTL1769224404705483503.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13319626993629050234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1769224404705483503.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("(p287!=1)"))||("((p620==1)&&(p779==1))"))))
Formula 0 simplified : F(!"((p620==1)&&(p779==1))" & X!"(p287!=1)")
Detected timeout of ITS tools.
[2024-05-22 19:23:44] [INFO ] Flatten gal took : 57 ms
[2024-05-22 19:23:44] [INFO ] Applying decomposition
[2024-05-22 19:23:44] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12838672148588195774.txt' '-o' '/tmp/graph12838672148588195774.bin' '-w' '/tmp/graph12838672148588195774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12838672148588195774.bin' '-l' '-1' '-v' '-w' '/tmp/graph12838672148588195774.weights' '-q' '0' '-e' '0.001'
[2024-05-22 19:23:45] [INFO ] Decomposing Gal with order
[2024-05-22 19:23:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:23:45] [INFO ] Removed a total of 2191 redundant transitions.
[2024-05-22 19:23:45] [INFO ] Flatten gal took : 126 ms
[2024-05-22 19:23:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 33 ms.
[2024-05-22 19:23:45] [INFO ] Time to serialize gal into /tmp/LTL9801573237960106814.gal : 14 ms
[2024-05-22 19:23:45] [INFO ] Time to serialize properties into /tmp/LTL11102527561720067905.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9801573237960106814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11102527561720067905.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X("(i4.u119.p287!=1)"))||("((i8.u184.p620==1)&&(i8.u224.p779==1))"))))
Formula 0 simplified : F(!"((i8.u184.p620==1)&&(i8.u224.p779==1))" & X!"(i4.u119.p287!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5137014927675342730
[2024-05-22 19:24:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5137014927675342730
Running compilation step : cd /tmp/ltsmin5137014927675342730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5137014927675342730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin5137014927675342730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-05a-LTLFireability-07 finished in 89092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (p1||X(p1))) U X(p2)))'
Support contains 6 out of 1089 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1089/1089 places, 1741/1741 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1088 transition count 1741
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 1085 transition count 1726
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 1085 transition count 1726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 1083 transition count 1717
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1083 transition count 1717
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 1081 transition count 1708
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 1081 transition count 1708
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1079 transition count 1699
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1079 transition count 1699
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1077 transition count 1690
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1077 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1075 transition count 1681
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1075 transition count 1681
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1073 transition count 1672
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1073 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1072 transition count 1664
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1072 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1071 transition count 1656
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1071 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1070 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1070 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1069 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1069 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1068 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1068 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1067 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1067 transition count 1624
Applied a total of 43 rules in 376 ms. Remains 1067 /1089 variables (removed 22) and now considering 1624/1741 (removed 117) transitions.
// Phase 1: matrix 1624 rows 1067 cols
[2024-05-22 19:24:04] [INFO ] Computed 146 invariants in 15 ms
[2024-05-22 19:24:05] [INFO ] Implicit Places using invariants in 1081 ms returned [227, 245, 389, 575]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1084 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1063/1089 places, 1624/1741 transitions.
Applied a total of 0 rules in 41 ms. Remains 1063 /1063 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1502 ms. Remains : 1063/1089 places, 1624/1741 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s767 1) (EQ s951 1)), p0:(AND (EQ s136 1) (EQ s147 1)), p2:(OR (AND (EQ s767 1) (EQ s951 1)) (AND (EQ s37 1) (EQ s250 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 134 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-09 finished in 1836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1089 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1089/1089 places, 1741/1741 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1088 transition count 1741
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 1085 transition count 1726
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 1085 transition count 1726
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 1083 transition count 1717
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1083 transition count 1717
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 1081 transition count 1708
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 1081 transition count 1708
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1079 transition count 1699
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1079 transition count 1699
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1077 transition count 1690
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1077 transition count 1690
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 1075 transition count 1681
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 1075 transition count 1681
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1073 transition count 1672
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1073 transition count 1672
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1072 transition count 1664
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1072 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1071 transition count 1656
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1071 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1070 transition count 1648
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1070 transition count 1648
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1069 transition count 1640
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1069 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1068 transition count 1632
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1068 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1067 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1067 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1066 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1066 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1065 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1065 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1064 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1064 transition count 1600
Applied a total of 49 rules in 470 ms. Remains 1064 /1089 variables (removed 25) and now considering 1600/1741 (removed 141) transitions.
// Phase 1: matrix 1600 rows 1064 cols
[2024-05-22 19:24:05] [INFO ] Computed 146 invariants in 15 ms
[2024-05-22 19:24:06] [INFO ] Implicit Places using invariants in 982 ms returned [227, 245, 389, 575]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 984 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1060/1089 places, 1600/1741 transitions.
Applied a total of 0 rules in 27 ms. Remains 1060 /1060 variables (removed 0) and now considering 1600/1600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1482 ms. Remains : 1060/1089 places, 1600/1741 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s1036 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1605 ms.
Product exploration explored 100000 steps with 50000 reset in 1595 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-05a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05a-LTLFireability-11 finished in 4791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1089 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1089/1089 places, 1741/1741 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 1088 transition count 1549
Reduce places removed 192 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 193 rules applied. Total rules applied 385 place count 896 transition count 1548
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 386 place count 895 transition count 1548
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 140 Pre rules applied. Total rules applied 386 place count 895 transition count 1408
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 3 with 325 rules applied. Total rules applied 711 place count 710 transition count 1408
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 16 rules applied. Total rules applied 727 place count 703 transition count 1399
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 736 place count 694 transition count 1399
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 736 place count 694 transition count 1379
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 776 place count 674 transition count 1379
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 784 place count 666 transition count 1359
Iterating global reduction 5 with 8 rules applied. Total rules applied 792 place count 666 transition count 1359
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 797 place count 665 transition count 1355
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 798 place count 664 transition count 1355
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 798 place count 664 transition count 1354
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 800 place count 663 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 801 place count 662 transition count 1346
Iterating global reduction 7 with 1 rules applied. Total rules applied 802 place count 662 transition count 1346
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 803 place count 661 transition count 1338
Iterating global reduction 7 with 1 rules applied. Total rules applied 804 place count 661 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 805 place count 660 transition count 1330
Iterating global reduction 7 with 1 rules applied. Total rules applied 806 place count 660 transition count 1330
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 807 place count 659 transition count 1322
Iterating global reduction 7 with 1 rules applied. Total rules applied 808 place count 659 transition count 1322
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 809 place count 658 transition count 1314
Iterating global reduction 7 with 1 rules applied. Total rules applied 810 place count 658 transition count 1314
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 811 place count 657 transition count 1306
Iterating global reduction 7 with 1 rules applied. Total rules applied 812 place count 657 transition count 1306
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 813 place count 656 transition count 1298
Iterating global reduction 7 with 1 rules applied. Total rules applied 814 place count 656 transition count 1298
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 815 place count 655 transition count 1290
Iterating global reduction 7 with 1 rules applied. Total rules applied 816 place count 655 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 817 place count 654 transition count 1282
Iterating global reduction 7 with 1 rules applied. Total rules applied 818 place count 654 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 819 place count 653 transition count 1274
Iterating global reduction 7 with 1 rules applied. Total rules applied 820 place count 653 transition count 1274
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 821 place count 652 transition count 1266
Iterating global reduction 7 with 1 rules applied. Total rules applied 822 place count 652 transition count 1266
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 823 place count 651 transition count 1258
Iterating global reduction 7 with 1 rules applied. Total rules applied 824 place count 651 transition count 1258
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 825 place count 650 transition count 1250
Iterating global reduction 7 with 1 rules applied. Total rules applied 826 place count 650 transition count 1250
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 827 place count 649 transition count 1242
Iterating global reduction 7 with 1 rules applied. Total rules applied 828 place count 649 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 829 place count 648 transition count 1234
Iterating global reduction 7 with 1 rules applied. Total rules applied 830 place count 648 transition count 1234
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 118 rules applied. Total rules applied 948 place count 589 transition count 1175
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 950 place count 587 transition count 1173
Iterating global reduction 7 with 2 rules applied. Total rules applied 952 place count 587 transition count 1173
Applied a total of 952 rules in 301 ms. Remains 587 /1089 variables (removed 502) and now considering 1173/1741 (removed 568) transitions.
// Phase 1: matrix 1173 rows 587 cols
[2024-05-22 19:24:10] [INFO ] Computed 93 invariants in 14 ms
[2024-05-22 19:24:11] [INFO ] Implicit Places using invariants in 834 ms returned [90, 96, 101, 117, 135, 153, 194, 202, 208, 302, 308, 313, 329, 330, 405, 411, 416, 432, 502, 508, 513, 532, 584]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 836 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 564/1089 places, 1173/1741 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 564 transition count 1164
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 555 transition count 1164
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 18 place count 555 transition count 1156
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 547 transition count 1156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 44 place count 537 transition count 1146
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 537 transition count 1146
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 64 place count 527 transition count 1136
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 527 transition count 1136
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 522 transition count 1131
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 522 transition count 1131
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 112 place count 508 transition count 1117
Applied a total of 112 rules in 69 ms. Remains 508 /564 variables (removed 56) and now considering 1117/1173 (removed 56) transitions.
// Phase 1: matrix 1117 rows 508 cols
[2024-05-22 19:24:11] [INFO ] Computed 70 invariants in 10 ms
[2024-05-22 19:24:12] [INFO ] Implicit Places using invariants in 774 ms returned [93, 96, 273, 276, 357, 360, 441, 444]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 776 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 500/1089 places, 1117/1741 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 500 transition count 1113
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 496 transition count 1113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 492 transition count 1109
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 492 transition count 1109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 492 transition count 1105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 491 transition count 1104
Applied a total of 22 rules in 43 ms. Remains 491 /500 variables (removed 9) and now considering 1104/1117 (removed 13) transitions.
// Phase 1: matrix 1104 rows 491 cols
[2024-05-22 19:24:12] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 19:24:12] [INFO ] Implicit Places using invariants in 612 ms returned [72, 247, 327, 407]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 614 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 487/1089 places, 1104/1741 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 483 transition count 1100
Applied a total of 8 rules in 26 ms. Remains 483 /487 variables (removed 4) and now considering 1100/1104 (removed 4) transitions.
// Phase 1: matrix 1100 rows 483 cols
[2024-05-22 19:24:12] [INFO ] Computed 58 invariants in 9 ms
[2024-05-22 19:24:13] [INFO ] Implicit Places using invariants in 717 ms returned []
[2024-05-22 19:24:13] [INFO ] Invariant cache hit.
[2024-05-22 19:24:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 19:24:15] [INFO ] Implicit Places using invariants and state equation in 1605 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 483/1089 places, 1100/1741 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 4991 ms. Remains : 483/1089 places, 1100/1741 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s150 1) (EQ s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-05a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05a-LTLFireability-15 finished in 5044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Found a Lengthening insensitive property : ASLink-PT-05a-LTLFireability-07
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1089 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1089/1089 places, 1741/1741 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 1087 transition count 1547
Reduce places removed 197 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 200 rules applied. Total rules applied 393 place count 890 transition count 1544
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 397 place count 887 transition count 1543
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 399 place count 885 transition count 1543
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 150 Pre rules applied. Total rules applied 399 place count 885 transition count 1393
Deduced a syphon composed of 150 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 4 with 345 rules applied. Total rules applied 744 place count 690 transition count 1393
Discarding 13 places :
Implicit places reduction removed 13 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 30 rules applied. Total rules applied 774 place count 677 transition count 1376
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 791 place count 660 transition count 1376
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 791 place count 660 transition count 1355
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 833 place count 639 transition count 1355
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 844 place count 628 transition count 1337
Iterating global reduction 6 with 11 rules applied. Total rules applied 855 place count 628 transition count 1337
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 8 rules applied. Total rules applied 863 place count 628 transition count 1329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 864 place count 627 transition count 1329
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 864 place count 627 transition count 1328
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 866 place count 626 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 867 place count 625 transition count 1320
Iterating global reduction 8 with 1 rules applied. Total rules applied 868 place count 625 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 869 place count 624 transition count 1312
Iterating global reduction 8 with 1 rules applied. Total rules applied 870 place count 624 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 871 place count 623 transition count 1304
Iterating global reduction 8 with 1 rules applied. Total rules applied 872 place count 623 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 873 place count 622 transition count 1296
Iterating global reduction 8 with 1 rules applied. Total rules applied 874 place count 622 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 875 place count 621 transition count 1288
Iterating global reduction 8 with 1 rules applied. Total rules applied 876 place count 621 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 877 place count 620 transition count 1280
Iterating global reduction 8 with 1 rules applied. Total rules applied 878 place count 620 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 879 place count 619 transition count 1272
Iterating global reduction 8 with 1 rules applied. Total rules applied 880 place count 619 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 881 place count 618 transition count 1264
Iterating global reduction 8 with 1 rules applied. Total rules applied 882 place count 618 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 883 place count 617 transition count 1256
Iterating global reduction 8 with 1 rules applied. Total rules applied 884 place count 617 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 885 place count 616 transition count 1248
Iterating global reduction 8 with 1 rules applied. Total rules applied 886 place count 616 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 887 place count 615 transition count 1240
Iterating global reduction 8 with 1 rules applied. Total rules applied 888 place count 615 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 889 place count 614 transition count 1232
Iterating global reduction 8 with 1 rules applied. Total rules applied 890 place count 614 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 891 place count 613 transition count 1224
Iterating global reduction 8 with 1 rules applied. Total rules applied 892 place count 613 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 893 place count 612 transition count 1216
Iterating global reduction 8 with 1 rules applied. Total rules applied 894 place count 612 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 895 place count 611 transition count 1208
Iterating global reduction 8 with 1 rules applied. Total rules applied 896 place count 611 transition count 1208
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 8 with 110 rules applied. Total rules applied 1006 place count 556 transition count 1153
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1007 place count 555 transition count 1152
Iterating global reduction 8 with 1 rules applied. Total rules applied 1008 place count 555 transition count 1152
Applied a total of 1008 rules in 300 ms. Remains 555 /1089 variables (removed 534) and now considering 1152/1741 (removed 589) transitions.
// Phase 1: matrix 1152 rows 555 cols
[2024-05-22 19:24:15] [INFO ] Computed 83 invariants in 11 ms
[2024-05-22 19:24:16] [INFO ] Implicit Places using invariants in 736 ms returned [72, 89, 95, 100, 125, 143, 184, 192, 198, 268, 285, 291, 296, 298, 361, 382, 388, 393, 394, 399, 459, 476, 482, 487, 489, 552]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 738 ms to find 26 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 529/1089 places, 1152/1741 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 529 transition count 1147
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 524 transition count 1147
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 21 place count 513 transition count 1136
Iterating global reduction 2 with 11 rules applied. Total rules applied 32 place count 513 transition count 1136
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 42 place count 503 transition count 1126
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 503 transition count 1126
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 498 transition count 1121
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 498 transition count 1121
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 88 place count 485 transition count 1108
Applied a total of 88 rules in 58 ms. Remains 485 /529 variables (removed 44) and now considering 1108/1152 (removed 44) transitions.
// Phase 1: matrix 1108 rows 485 cols
[2024-05-22 19:24:16] [INFO ] Computed 57 invariants in 9 ms
[2024-05-22 19:24:17] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-22 19:24:17] [INFO ] Invariant cache hit.
[2024-05-22 19:24:18] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 485/1089 places, 1108/1741 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3221 ms. Remains : 485/1089 places, 1108/1741 transitions.
Running random walk in product with property : ASLink-PT-05a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s266 1) (EQ s342 1)), p1:(NEQ s149 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1415 reset in 301 ms.
Product exploration explored 100000 steps with 1458 reset in 359 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), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 129 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 150055 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150055 steps, saw 91685 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 19:24:23] [INFO ] Invariant cache hit.
[2024-05-22 19:24:23] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-22 19:24:23] [INFO ] [Real]Absence check using 12 positive and 45 generalized place invariants in 23 ms returned sat
[2024-05-22 19:24:23] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 19:24:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-22 19:24:23] [INFO ] [Nat]Absence check using 12 positive and 45 generalized place invariants in 23 ms returned sat
[2024-05-22 19:24:24] [INFO ] After 814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 19:24:25] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2024-05-22 19:24:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2024-05-22 19:24:25] [INFO ] After 1205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-22 19:24:25] [INFO ] After 1528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 485 transition count 1088
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 43 place count 465 transition count 1085
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 58 place count 465 transition count 1070
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 74 place count 449 transition count 1070
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 74 place count 449 transition count 1068
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 446 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 445 transition count 1067
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 445 transition count 1067
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 445 transition count 1066
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 445 transition count 1065
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 445 transition count 1065
Applied a total of 84 rules in 90 ms. Remains 445 /485 variables (removed 40) and now considering 1065/1108 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 445/485 places, 1065/1108 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 306795 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 306795 steps, saw 204044 distinct states, run finished after 3003 ms. (steps per millisecond=102 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 1065 rows 445 cols
[2024-05-22 19:24:28] [INFO ] Computed 55 invariants in 10 ms
[2024-05-22 19:24:29] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 19:24:29] [INFO ] [Real]Absence check using 11 positive and 44 generalized place invariants in 21 ms returned sat
[2024-05-22 19:24:29] [INFO ] After 402ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 19:24:29] [INFO ] After 464ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-22 19:24:29] [INFO ] After 616ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1065/1065 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 445 transition count 1064
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 444 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 442 transition count 1057
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 442 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 442 transition count 1056
Applied a total of 7 rules in 59 ms. Remains 442 /445 variables (removed 3) and now considering 1056/1065 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 442/445 places, 1056/1065 transitions.
Incomplete random walk after 10000 steps, including 193 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 309855 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 309855 steps, saw 205884 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1056 rows 442 cols
[2024-05-22 19:24:32] [INFO ] Computed 55 invariants in 9 ms
[2024-05-22 19:24:32] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-22 19:24:32] [INFO ] [Real]Absence check using 10 positive and 45 generalized place invariants in 21 ms returned sat
[2024-05-22 19:24:33] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 19:24:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 19:24:33] [INFO ] [Nat]Absence check using 10 positive and 45 generalized place invariants in 16 ms returned sat
[2024-05-22 19:24:34] [INFO ] After 1155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 19:24:34] [INFO ] After 1212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-22 19:24:34] [INFO ] After 1347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1056/1056 transitions.
Applied a total of 0 rules in 16 ms. Remains 442 /442 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 442/442 places, 1056/1056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1056/1056 transitions.
Applied a total of 0 rules in 18 ms. Remains 442 /442 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2024-05-22 19:24:34] [INFO ] Invariant cache hit.
[2024-05-22 19:24:35] [INFO ] Implicit Places using invariants in 650 ms returned [88, 89, 141, 159, 164, 165, 235, 236, 237, 313, 314]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 651 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 431/442 places, 1056/1056 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 431 transition count 1052
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 427 transition count 1052
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 425 transition count 1050
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 425 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 424 transition count 1049
Applied a total of 14 rules in 42 ms. Remains 424 /431 variables (removed 7) and now considering 1049/1056 (removed 7) transitions.
// Phase 1: matrix 1049 rows 424 cols
[2024-05-22 19:24:35] [INFO ] Computed 44 invariants in 9 ms
[2024-05-22 19:24:35] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-22 19:24:35] [INFO ] Invariant cache hit.
[2024-05-22 19:24:37] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 424/442 places, 1049/1056 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2374 ms. Remains : 424/442 places, 1049/1056 transitions.
Incomplete random walk after 10000 steps, including 172 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 68637 steps, run visited all 1 properties in 569 ms. (steps per millisecond=120 )
Probabilistic random walk after 68637 steps, saw 49217 distinct states, run finished after 570 ms. (steps per millisecond=120 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Applied a total of 0 rules in 9 ms. Remains 485 /485 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
// Phase 1: matrix 1108 rows 485 cols
[2024-05-22 19:24:38] [INFO ] Computed 57 invariants in 11 ms
[2024-05-22 19:24:38] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-05-22 19:24:38] [INFO ] Invariant cache hit.
[2024-05-22 19:24:39] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1921 ms to find 0 implicit places.
[2024-05-22 19:24:39] [INFO ] Invariant cache hit.
[2024-05-22 19:24:40] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2832 ms. Remains : 485/485 places, 1108/1108 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 (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 141 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 153099 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153099 steps, saw 92840 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-22 19:24:44] [INFO ] Invariant cache hit.
[2024-05-22 19:24:44] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-22 19:24:44] [INFO ] [Real]Absence check using 12 positive and 45 generalized place invariants in 23 ms returned sat
[2024-05-22 19:24:45] [INFO ] After 682ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 19:24:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-22 19:24:45] [INFO ] [Nat]Absence check using 12 positive and 45 generalized place invariants in 22 ms returned sat
[2024-05-22 19:24:46] [INFO ] After 794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 19:24:46] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 0 ms to minimize.
[2024-05-22 19:24:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2024-05-22 19:24:46] [INFO ] After 1182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-22 19:24:46] [INFO ] After 1503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 485 transition count 1088
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 43 place count 465 transition count 1085
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 58 place count 465 transition count 1070
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 74 place count 449 transition count 1070
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 74 place count 449 transition count 1068
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 446 transition count 1068
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 445 transition count 1067
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 445 transition count 1067
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 445 transition count 1066
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 445 transition count 1065
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 445 transition count 1065
Applied a total of 84 rules in 97 ms. Remains 445 /485 variables (removed 40) and now considering 1065/1108 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 445/485 places, 1065/1108 transitions.
Incomplete random walk after 10000 steps, including 189 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 306412 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 306412 steps, saw 203772 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 1065 rows 445 cols
[2024-05-22 19:24:50] [INFO ] Computed 55 invariants in 9 ms
[2024-05-22 19:24:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 19:24:50] [INFO ] [Real]Absence check using 11 positive and 44 generalized place invariants in 20 ms returned sat
[2024-05-22 19:24:50] [INFO ] After 398ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 19:24:50] [INFO ] After 461ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-22 19:24:50] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 1065/1065 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 445 transition count 1064
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 444 transition count 1064
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 442 transition count 1057
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 442 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 442 transition count 1056
Applied a total of 7 rules in 32 ms. Remains 442 /445 variables (removed 3) and now considering 1056/1065 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 442/445 places, 1056/1065 transitions.
Incomplete random walk after 10000 steps, including 173 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 311561 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311561 steps, saw 207091 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1056 rows 442 cols
[2024-05-22 19:24:54] [INFO ] Computed 55 invariants in 10 ms
[2024-05-22 19:24:54] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-22 19:24:54] [INFO ] [Real]Absence check using 10 positive and 45 generalized place invariants in 21 ms returned sat
[2024-05-22 19:24:54] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 19:24:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 19:24:54] [INFO ] [Nat]Absence check using 10 positive and 45 generalized place invariants in 21 ms returned sat
[2024-05-22 19:24:55] [INFO ] After 1127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 19:24:55] [INFO ] After 1184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-22 19:24:55] [INFO ] After 1332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1056/1056 transitions.
Applied a total of 0 rules in 15 ms. Remains 442 /442 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 442/442 places, 1056/1056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 442/442 places, 1056/1056 transitions.
Applied a total of 0 rules in 15 ms. Remains 442 /442 variables (removed 0) and now considering 1056/1056 (removed 0) transitions.
[2024-05-22 19:24:55] [INFO ] Invariant cache hit.
[2024-05-22 19:24:56] [INFO ] Implicit Places using invariants in 622 ms returned [88, 89, 141, 159, 164, 165, 235, 236, 237, 313, 314]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 624 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 431/442 places, 1056/1056 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 431 transition count 1052
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 427 transition count 1052
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 425 transition count 1050
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 425 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 424 transition count 1049
Applied a total of 14 rules in 42 ms. Remains 424 /431 variables (removed 7) and now considering 1049/1056 (removed 7) transitions.
// Phase 1: matrix 1049 rows 424 cols
[2024-05-22 19:24:56] [INFO ] Computed 44 invariants in 8 ms
[2024-05-22 19:24:57] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-22 19:24:57] [INFO ] Invariant cache hit.
[2024-05-22 19:24:58] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 424/442 places, 1049/1056 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2451 ms. Remains : 424/442 places, 1049/1056 transitions.
Incomplete random walk after 10000 steps, including 203 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 68637 steps, run visited all 1 properties in 568 ms. (steps per millisecond=120 )
Probabilistic random walk after 68637 steps, saw 49217 distinct states, run finished after 568 ms. (steps per millisecond=120 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 229 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1432 reset in 233 ms.
Product exploration explored 100000 steps with 1424 reset in 259 ms.
Built C files in :
/tmp/ltsmin7820082963358357617
[2024-05-22 19:25:00] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7820082963358357617
Running compilation step : cd /tmp/ltsmin7820082963358357617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7820082963358357617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7820082963358357617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 1108/1108 transitions.
Applied a total of 0 rules in 11 ms. Remains 485 /485 variables (removed 0) and now considering 1108/1108 (removed 0) transitions.
// Phase 1: matrix 1108 rows 485 cols
[2024-05-22 19:25:03] [INFO ] Computed 57 invariants in 9 ms
[2024-05-22 19:25:03] [INFO ] Implicit Places using invariants in 616 ms returned []
[2024-05-22 19:25:03] [INFO ] Invariant cache hit.
[2024-05-22 19:25:05] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 2103 ms to find 0 implicit places.
[2024-05-22 19:25:05] [INFO ] Invariant cache hit.
[2024-05-22 19:25:06] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3233 ms. Remains : 485/485 places, 1108/1108 transitions.
Built C files in :
/tmp/ltsmin10297240775324020953
[2024-05-22 19:25:06] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10297240775324020953
Running compilation step : cd /tmp/ltsmin10297240775324020953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10297240775324020953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin10297240775324020953;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-22 19:25:09] [INFO ] Flatten gal took : 35 ms
[2024-05-22 19:25:09] [INFO ] Flatten gal took : 35 ms
[2024-05-22 19:25:09] [INFO ] Time to serialize gal into /tmp/LTL15691489961933528414.gal : 9 ms
[2024-05-22 19:25:09] [INFO ] Time to serialize properties into /tmp/LTL4362770465993694782.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15691489961933528414.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9483662985824446271.hoa' '-atoms' '/tmp/LTL4362770465993694782.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4362770465993694782.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9483662985824446271.hoa
Detected timeout of ITS tools.
[2024-05-22 19:25:24] [INFO ] Flatten gal took : 34 ms
[2024-05-22 19:25:24] [INFO ] Flatten gal took : 34 ms
[2024-05-22 19:25:24] [INFO ] Time to serialize gal into /tmp/LTL5196946411574117926.gal : 11 ms
[2024-05-22 19:25:24] [INFO ] Time to serialize properties into /tmp/LTL10068772966963853839.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5196946411574117926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10068772966963853839.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X("(p287!=1)"))||("((p620==1)&&(p779==1))"))))
Formula 0 simplified : F(!"((p620==1)&&(p779==1))" & X!"(p287!=1)")
Detected timeout of ITS tools.
[2024-05-22 19:25:39] [INFO ] Flatten gal took : 35 ms
[2024-05-22 19:25:39] [INFO ] Applying decomposition
[2024-05-22 19:25:39] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6180087708468060629.txt' '-o' '/tmp/graph6180087708468060629.bin' '-w' '/tmp/graph6180087708468060629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6180087708468060629.bin' '-l' '-1' '-v' '-w' '/tmp/graph6180087708468060629.weights' '-q' '0' '-e' '0.001'
[2024-05-22 19:25:39] [INFO ] Decomposing Gal with order
[2024-05-22 19:25:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:25:39] [INFO ] Removed a total of 2160 redundant transitions.
[2024-05-22 19:25:39] [INFO ] Flatten gal took : 74 ms
[2024-05-22 19:25:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 14 ms.
[2024-05-22 19:25:40] [INFO ] Time to serialize gal into /tmp/LTL8665625205865452714.gal : 13 ms
[2024-05-22 19:25:40] [INFO ] Time to serialize properties into /tmp/LTL14460203980502914987.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8665625205865452714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14460203980502914987.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X("(i3.u41.p287!=1)"))||("((i6.u73.p620==1)&&(i8.u82.p779==1))"))))
Formula 0 simplified : F(!"((i6.u73.p620==1)&&(i8.u82.p779==1))" & X!"(i3.u41.p287!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8648412221993875001
[2024-05-22 19:25:55] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8648412221993875001
Running compilation step : cd /tmp/ltsmin8648412221993875001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8648412221993875001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8648412221993875001;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-05a-LTLFireability-07 finished in 102728 ms.
[2024-05-22 19:25:58] [INFO ] Flatten gal took : 50 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8424358830771819023
[2024-05-22 19:25:58] [INFO ] Too many transitions (1741) to apply POR reductions. Disabling POR matrices.
[2024-05-22 19:25:58] [INFO ] Applying decomposition
[2024-05-22 19:25:58] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8424358830771819023
Running compilation step : cd /tmp/ltsmin8424358830771819023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 19:25:58] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11382996743861615260.txt' '-o' '/tmp/graph11382996743861615260.bin' '-w' '/tmp/graph11382996743861615260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11382996743861615260.bin' '-l' '-1' '-v' '-w' '/tmp/graph11382996743861615260.weights' '-q' '0' '-e' '0.001'
[2024-05-22 19:25:58] [INFO ] Decomposing Gal with order
[2024-05-22 19:25:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:25:58] [INFO ] Removed a total of 2518 redundant transitions.
[2024-05-22 19:25:58] [INFO ] Flatten gal took : 102 ms
[2024-05-22 19:25:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 18 ms.
[2024-05-22 19:25:58] [INFO ] Time to serialize gal into /tmp/LTLFireability5140063010069683069.gal : 14 ms
[2024-05-22 19:25:58] [INFO ] Time to serialize properties into /tmp/LTLFireability10716609681985757058.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5140063010069683069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10716609681985757058.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F("(i13.u317.p1133==0)"))))
Formula 0 simplified : FG!"(i13.u317.p1133==0)"
Compilation finished in 5773 ms.
Running link step : cd /tmp/ltsmin8424358830771819023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin8424358830771819023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-22 19:48:01] [INFO ] Applying decomposition
[2024-05-22 19:48:01] [INFO ] Flatten gal took : 158 ms
[2024-05-22 19:48:01] [INFO ] Decomposing Gal with order
[2024-05-22 19:48:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 19:48:01] [INFO ] Removed a total of 2059 redundant transitions.
[2024-05-22 19:48:02] [INFO ] Flatten gal took : 358 ms
[2024-05-22 19:48:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 697 labels/synchronizations in 125 ms.
[2024-05-22 19:48:02] [INFO ] Time to serialize gal into /tmp/LTLFireability13486841430454988619.gal : 24 ms
[2024-05-22 19:48:02] [INFO ] Time to serialize properties into /tmp/LTLFireability6602791487680961904.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13486841430454988619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6602791487680961904.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(F("(i45.u196.p1133==0)"))))
Formula 0 simplified : FG!"(i45.u196.p1133==0)"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin8424358830771819023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8424358830771819023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp1==true)||X((LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1026, t1238, t1321, t1322, t1325, t1330, t1342, t1351, t1401, t1427, t1456, t1484, t1486, t1...862
Computing Next relation with stutter on 4.08317e+13 deadlock states
Detected timeout of ITS tools.
[2024-05-22 20:10:04] [INFO ] Flatten gal took : 163 ms
[2024-05-22 20:10:04] [INFO ] Input system was already deterministic with 1741 transitions.
[2024-05-22 20:10:04] [INFO ] Transformed 1089 places.
[2024-05-22 20:10:04] [INFO ] Transformed 1741 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 20:10:35] [INFO ] Time to serialize gal into /tmp/LTLFireability8857554166873724907.gal : 26 ms
[2024-05-22 20:10:35] [INFO ] Time to serialize properties into /tmp/LTLFireability3209117403868555598.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8857554166873724907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3209117403868555598.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(p1133==0)"))))
Formula 0 simplified : FG!"(p1133==0)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8125184 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16038072 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-05a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ASLink-PT-05a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-smll-171620127800048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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