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.r201-smll-171649586500091.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 greatspnxred
Input is HirschbergSinclair-PT-25, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586500091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 321K 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 HirschbergSinclair-PT-25-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716591780334

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 23:03:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 23:03:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 23:03:02] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2024-05-24 23:03:02] [INFO ] Transformed 600 places.
[2024-05-24 23:03:02] [INFO ] Transformed 545 transitions.
[2024-05-24 23:03:02] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 530 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 575 transition count 545
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 43 place count 557 transition count 527
Iterating global reduction 1 with 18 rules applied. Total rules applied 61 place count 557 transition count 527
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 77 place count 541 transition count 511
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 541 transition count 511
Applied a total of 93 rules in 203 ms. Remains 541 /600 variables (removed 59) and now considering 511/545 (removed 34) transitions.
// Phase 1: matrix 511 rows 541 cols
[2024-05-24 23:03:03] [INFO ] Computed 30 invariants in 39 ms
[2024-05-24 23:03:04] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-24 23:03:04] [INFO ] Invariant cache hit.
[2024-05-24 23:03:06] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 3000 ms to find 0 implicit places.
Running 486 sub problems to find dead transitions.
[2024-05-24 23:03:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (OVERLAPS) 25/541 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (OVERLAPS) 511/1052 variables, 541/571 constraints. Problems are: Problem set: 0 solved, 486 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 571 constraints, problems are : Problem set: 0 solved, 486 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 541/541 constraints, PredecessorRefiner: 486/486 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 486 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (OVERLAPS) 25/541 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (OVERLAPS) 511/1052 variables, 541/571 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1052 variables, 486/1057 constraints. Problems are: Problem set: 0 solved, 486 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 1057 constraints, problems are : Problem set: 0 solved, 486 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 541/541 constraints, PredecessorRefiner: 486/486 constraints, Known Traps: 0/0 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 486 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Starting structural reductions in LTL mode, iteration 1 : 541/600 places, 511/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63713 ms. Remains : 541/600 places, 511/545 transitions.
Support contains 53 out of 541 places after structural reductions.
[2024-05-24 23:04:07] [INFO ] Flatten gal took : 102 ms
[2024-05-24 23:04:07] [INFO ] Flatten gal took : 54 ms
[2024-05-24 23:04:07] [INFO ] Input system was already deterministic with 511 transitions.
Support contains 52 out of 541 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (72 resets) in 2316 ms. (17 steps per ms) remains 13/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
[2024-05-24 23:04:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 444/465 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 25/490 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 5 (OVERLAPS) 511/1001 variables, 490/520 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 0/520 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/1052 variables, 51/571 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1052 variables, 0/571 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1052 variables, 0/571 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 571 constraints, problems are : Problem set: 11 solved, 2 unsolved in 973 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 541/541 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 446/454 variables, 26/26 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 0/26 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/488 variables, 4/30 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/30 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 511/999 variables, 488/518 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 0/518 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 53/1052 variables, 53/571 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1052 variables, 2/573 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1052 variables, 0/573 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1052 variables, 0/573 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 573 constraints, problems are : Problem set: 11 solved, 2 unsolved in 913 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 541/541 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 1907ms problems are : Problem set: 11 solved, 2 unsolved
Parikh walk visited 0 properties in 997 ms.
Support contains 8 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 511/511 transitions.
Graph (complete) has 1022 edges and 541 vertex of which 516 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.6 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 244 rules applied. Total rules applied 245 place count 516 transition count 267
Reduce places removed 219 places and 0 transitions.
Graph (complete) has 506 edges and 297 vertex of which 211 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.1 ms
Discarding 86 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 222 rules applied. Total rules applied 467 place count 211 transition count 265
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 555 place count 209 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 555 place count 209 transition count 178
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 557 place count 208 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 558 place count 207 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 207 transition count 177
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 560 place count 207 transition count 176
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 335 edges and 206 vertex of which 204 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 562 place count 204 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 564 place count 204 transition count 174
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 6 with 2 rules applied. Total rules applied 566 place count 203 transition count 173
Graph (complete) has 327 edges and 203 vertex of which 201 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 567 place count 201 transition count 173
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 569 place count 201 transition count 171
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 590 place count 180 transition count 150
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 8 with 82 rules applied. Total rules applied 672 place count 162 transition count 86
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 9 with 64 rules applied. Total rules applied 736 place count 98 transition count 86
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 32 Pre rules applied. Total rules applied 736 place count 98 transition count 54
Deduced a syphon composed of 32 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 65 rules applied. Total rules applied 801 place count 65 transition count 54
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 10 with 2 rules applied. Total rules applied 803 place count 63 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 803 place count 63 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 807 place count 61 transition count 52
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 809 place count 60 transition count 51
Applied a total of 809 rules in 136 ms. Remains 60 /541 variables (removed 481) and now considering 51/511 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 60/541 places, 51/511 transitions.
RANDOM walk for 40000 steps (768 resets) in 825 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (232 resets) in 309 ms. (129 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1423 steps (5 resets) in 10 ms. (129 steps per ms) remains 0/1 properties
Successfully simplified 11 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 541 stabilizing places and 511 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 541 transition count 511
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 502
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 525 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 525 transition count 495
Applied a total of 32 rules in 114 ms. Remains 525 /541 variables (removed 16) and now considering 495/511 (removed 16) transitions.
// Phase 1: matrix 495 rows 525 cols
[2024-05-24 23:04:12] [INFO ] Computed 30 invariants in 7 ms
[2024-05-24 23:04:13] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-24 23:04:13] [INFO ] Invariant cache hit.
[2024-05-24 23:04:15] [INFO ] Implicit Places using invariants and state equation in 2441 ms returned []
Implicit Place search using SMT with State Equation took 2887 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-24 23:04:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 2.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60256ms
Starting structural reductions in LTL mode, iteration 1 : 525/541 places, 495/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63261 ms. Remains : 525/541 places, 495/511 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-01 finished in 63636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 502
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 525 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 525 transition count 495
Applied a total of 32 rules in 51 ms. Remains 525 /541 variables (removed 16) and now considering 495/511 (removed 16) transitions.
[2024-05-24 23:05:16] [INFO ] Invariant cache hit.
[2024-05-24 23:05:16] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-24 23:05:16] [INFO ] Invariant cache hit.
[2024-05-24 23:05:18] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 2592 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-24 23:05:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Starting structural reductions in LTL mode, iteration 1 : 525/541 places, 495/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62896 ms. Remains : 525/541 places, 495/511 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-02 finished in 63006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 502
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 502
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 525 transition count 495
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 525 transition count 495
Applied a total of 32 rules in 47 ms. Remains 525 /541 variables (removed 16) and now considering 495/511 (removed 16) transitions.
[2024-05-24 23:06:19] [INFO ] Invariant cache hit.
[2024-05-24 23:06:19] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-24 23:06:19] [INFO ] Invariant cache hit.
[2024-05-24 23:06:21] [INFO ] Implicit Places using invariants and state equation in 2162 ms returned []
Implicit Place search using SMT with State Equation took 2538 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-24 23:06:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60215ms
Starting structural reductions in LTL mode, iteration 1 : 525/541 places, 495/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62801 ms. Remains : 525/541 places, 495/511 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 485 ms.
Product exploration explored 100000 steps with 50000 reset in 444 ms.
Computed a total of 525 stabilizing places and 495 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 transition count 495
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-03 finished in 64192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1 U p2)))'
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 22 places and 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 519 transition count 268
Reduce places removed 221 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 222 rules applied. Total rules applied 443 place count 298 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 444 place count 297 transition count 267
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 452 place count 289 transition count 259
Iterating global reduction 3 with 8 rules applied. Total rules applied 460 place count 289 transition count 259
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 461 place count 289 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 462 place count 288 transition count 258
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 5 with 2 rules applied. Total rules applied 464 place count 287 transition count 257
Applied a total of 464 rules in 72 ms. Remains 287 /541 variables (removed 254) and now considering 257/511 (removed 254) transitions.
// Phase 1: matrix 257 rows 287 cols
[2024-05-24 23:07:23] [INFO ] Computed 30 invariants in 3 ms
[2024-05-24 23:07:23] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-24 23:07:23] [INFO ] Invariant cache hit.
[2024-05-24 23:07:24] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-24 23:07:24] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2024-05-24 23:07:24] [INFO ] Redundant transitions in 13 ms returned []
Running 217 sub problems to find dead transitions.
[2024-05-24 23:07:24] [INFO ] Invariant cache hit.
[2024-05-24 23:07:24] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 5/252 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 222/474 variables, 252/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 23/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/474 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/544 variables, and 305 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13805 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/287 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 5/252 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 222/474 variables, 252/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 23/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 217/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/544 variables, and 522 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15847 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/287 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 29692ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 29695ms
Starting structural reductions in SI_LTL mode, iteration 1 : 287/541 places, 257/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31032 ms. Remains : 287/541 places, 257/511 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-07
Product exploration explored 100000 steps with 3690 reset in 529 ms.
Product exploration explored 100000 steps with 3608 reset in 562 ms.
Computed a total of 287 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 257
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 10 factoid took 687 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
RANDOM walk for 105 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 10 factoid took 889 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
[2024-05-24 23:07:57] [INFO ] Invariant cache hit.
[2024-05-24 23:07:57] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 63 ms returned sat
[2024-05-24 23:08:00] [INFO ] [Real]Absence check using state equation in 3040 ms returned sat
[2024-05-24 23:08:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:08:01] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 70 ms returned sat
[2024-05-24 23:08:02] [INFO ] [Nat]Absence check using state equation in 1272 ms returned sat
[2024-05-24 23:08:02] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-24 23:08:02] [INFO ] [Nat]Added 23 Read/Feed constraints in 31 ms returned sat
[2024-05-24 23:08:02] [INFO ] Computed and/alt/rep : 217/245/217 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-24 23:08:03] [INFO ] Added : 94 causal constraints over 19 iterations in 690 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 287 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 257/257 transitions.
Applied a total of 0 rules in 17 ms. Remains 287 /287 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-24 23:08:03] [INFO ] Invariant cache hit.
[2024-05-24 23:08:03] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-24 23:08:03] [INFO ] Invariant cache hit.
[2024-05-24 23:08:03] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-24 23:08:04] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
[2024-05-24 23:08:04] [INFO ] Redundant transitions in 4 ms returned []
Running 217 sub problems to find dead transitions.
[2024-05-24 23:08:04] [INFO ] Invariant cache hit.
[2024-05-24 23:08:04] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 5/252 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 222/474 variables, 252/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 23/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/474 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/544 variables, and 305 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14363 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/287 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 5/252 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 222/474 variables, 252/282 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 23/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 217/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/544 variables, and 522 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15588 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 252/287 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 29987ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 29991ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31374 ms. Remains : 287/287 places, 257/257 transitions.
Computed a total of 287 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 257
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
RANDOM walk for 188 steps (0 resets) in 7 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
[2024-05-24 23:08:35] [INFO ] Invariant cache hit.
[2024-05-24 23:08:35] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 67 ms returned sat
[2024-05-24 23:08:38] [INFO ] [Real]Absence check using state equation in 3163 ms returned sat
[2024-05-24 23:08:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 23:08:39] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 73 ms returned sat
[2024-05-24 23:08:40] [INFO ] [Nat]Absence check using state equation in 1259 ms returned sat
[2024-05-24 23:08:40] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-24 23:08:40] [INFO ] [Nat]Added 23 Read/Feed constraints in 24 ms returned sat
[2024-05-24 23:08:40] [INFO ] Computed and/alt/rep : 217/245/217 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-24 23:08:41] [INFO ] Added : 94 causal constraints over 19 iterations in 671 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 40 ms :[(NOT p2)]
Product exploration explored 100000 steps with 3593 reset in 481 ms.
Product exploration explored 100000 steps with 3576 reset in 520 ms.
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 287/287 places, 257/257 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 285 transition count 253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 283 transition count 253
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 282 transition count 252
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 282 transition count 252
Applied a total of 6 rules in 27 ms. Remains 282 /287 variables (removed 5) and now considering 252/257 (removed 5) transitions.
// Phase 1: matrix 252 rows 282 cols
[2024-05-24 23:08:42] [INFO ] Computed 30 invariants in 2 ms
[2024-05-24 23:08:42] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-24 23:08:42] [INFO ] Invariant cache hit.
[2024-05-24 23:08:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 23:08:43] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2024-05-24 23:08:43] [INFO ] Redundant transitions in 4 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-24 23:08:43] [INFO ] Invariant cache hit.
[2024-05-24 23:08:43] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 3/239 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 209/448 variables, 239/269 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/448 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/534 variables, and 277 constraints, problems are : Problem set: 0 solved, 206 unsolved in 12096 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 239/282 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 3/239 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 209/448 variables, 239/269 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 206/483 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/448 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/534 variables, and 483 constraints, problems are : Problem set: 0 solved, 206 unsolved in 12371 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 239/282 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 24502ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 24505ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/287 places, 252/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25852 ms. Remains : 282/287 places, 252/257 transitions.
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-07 finished in 104768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p1&&(G(!p0)||(!p0&&F(p2))))))))'
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 23 places and 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 518 transition count 278
Reduce places removed 210 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 212 rules applied. Total rules applied 422 place count 308 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 424 place count 306 transition count 276
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 430 place count 300 transition count 270
Iterating global reduction 3 with 6 rules applied. Total rules applied 436 place count 300 transition count 270
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 438 place count 300 transition count 268
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 440 place count 298 transition count 268
Applied a total of 440 rules in 37 ms. Remains 298 /541 variables (removed 243) and now considering 268/511 (removed 243) transitions.
// Phase 1: matrix 268 rows 298 cols
[2024-05-24 23:09:08] [INFO ] Computed 30 invariants in 3 ms
[2024-05-24 23:09:08] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-24 23:09:08] [INFO ] Invariant cache hit.
[2024-05-24 23:09:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 23:09:09] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2024-05-24 23:09:09] [INFO ] Redundant transitions in 2 ms returned []
Running 225 sub problems to find dead transitions.
[2024-05-24 23:09:09] [INFO ] Invariant cache hit.
[2024-05-24 23:09:09] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 4/259 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 231/490 variables, 259/289 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (OVERLAPS) 2/492 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 0/492 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/566 variables, and 300 constraints, problems are : Problem set: 0 solved, 225 unsolved in 20685 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 261/298 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 4/259 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 231/490 variables, 259/289 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 225/523 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 2/492 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 0/492 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/566 variables, and 525 constraints, problems are : Problem set: 0 solved, 225 unsolved in 29269 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 261/298 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints]
After SMT, in 50007ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 50010ms
Starting structural reductions in SI_LTL mode, iteration 1 : 298/541 places, 268/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51183 ms. Remains : 298/541 places, 268/511 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (OR (NOT p1) p0), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-08
Stuttering criterion allowed to conclude after 287 steps with 0 reset in 6 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-08 finished in 51457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(X(G(!p1))))&&F(p0)))'
Support contains 5 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 503
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 526 transition count 496
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 526 transition count 496
Applied a total of 30 rules in 36 ms. Remains 526 /541 variables (removed 15) and now considering 496/511 (removed 15) transitions.
// Phase 1: matrix 496 rows 526 cols
[2024-05-24 23:09:59] [INFO ] Computed 30 invariants in 4 ms
[2024-05-24 23:09:59] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-24 23:10:00] [INFO ] Invariant cache hit.
[2024-05-24 23:10:02] [INFO ] Implicit Places using invariants and state equation in 2412 ms returned []
Implicit Place search using SMT with State Equation took 2790 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-05-24 23:10:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 556 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (OVERLAPS) 25/526 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 496/1022 variables, 526/556 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 471/1027 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1027 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 526/526 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 0/0 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 526/541 places, 496/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63009 ms. Remains : 526/541 places, 496/511 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p0) p1), p1, (NOT p0), p1, true, (AND (NOT p0) p1), p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 84 steps with 2 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-09 finished in 63398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 223 rules applied. Total rules applied 223 place count 516 transition count 263
Reduce places removed 223 places and 0 transitions.
Iterating post reduction 1 with 223 rules applied. Total rules applied 446 place count 293 transition count 263
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 454 place count 285 transition count 255
Iterating global reduction 2 with 8 rules applied. Total rules applied 462 place count 285 transition count 255
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 464 place count 285 transition count 253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 466 place count 283 transition count 253
Applied a total of 466 rules in 33 ms. Remains 283 /541 variables (removed 258) and now considering 253/511 (removed 258) transitions.
// Phase 1: matrix 253 rows 283 cols
[2024-05-24 23:11:03] [INFO ] Computed 30 invariants in 2 ms
[2024-05-24 23:11:03] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-24 23:11:03] [INFO ] Invariant cache hit.
[2024-05-24 23:11:04] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2024-05-24 23:11:04] [INFO ] Redundant transitions in 0 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-24 23:11:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/236 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 207/443 variables, 236/266 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 1/444 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/444 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/536 variables, and 267 constraints, problems are : Problem set: 0 solved, 204 unsolved in 13386 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/283 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/236 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 207/443 variables, 236/266 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 204/470 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 1/444 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/444 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/536 variables, and 471 constraints, problems are : Problem set: 0 solved, 204 unsolved in 19097 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/283 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 32508ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 32510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 283/541 places, 253/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33822 ms. Remains : 283/541 places, 253/511 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-11
Product exploration explored 100000 steps with 361 reset in 384 ms.
Product exploration explored 100000 steps with 361 reset in 505 ms.
Computed a total of 283 stabilizing places and 253 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 283 transition count 253
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-11 finished in 34938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(G(p1))))&&F(p2)))'
Support contains 6 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 503
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 503
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 528 transition count 498
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 528 transition count 498
Applied a total of 26 rules in 36 ms. Remains 528 /541 variables (removed 13) and now considering 498/511 (removed 13) transitions.
// Phase 1: matrix 498 rows 528 cols
[2024-05-24 23:11:37] [INFO ] Computed 30 invariants in 4 ms
[2024-05-24 23:11:38] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-24 23:11:38] [INFO ] Invariant cache hit.
[2024-05-24 23:11:40] [INFO ] Implicit Places using invariants and state equation in 2314 ms returned []
Implicit Place search using SMT with State Equation took 2681 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-24 23:11:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 558 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 473/1031 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1031 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 528/541 places, 498/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62893 ms. Remains : 528/541 places, 498/511 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-12 finished in 63090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 219 place count 516 transition count 267
Reduce places removed 219 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 221 rules applied. Total rules applied 440 place count 297 transition count 265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 442 place count 295 transition count 265
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 450 place count 287 transition count 257
Iterating global reduction 3 with 8 rules applied. Total rules applied 458 place count 287 transition count 257
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 460 place count 287 transition count 255
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 462 place count 285 transition count 255
Applied a total of 462 rules in 56 ms. Remains 285 /541 variables (removed 256) and now considering 255/511 (removed 256) transitions.
// Phase 1: matrix 255 rows 285 cols
[2024-05-24 23:12:41] [INFO ] Computed 30 invariants in 1 ms
[2024-05-24 23:12:41] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-24 23:12:41] [INFO ] Invariant cache hit.
[2024-05-24 23:12:42] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
[2024-05-24 23:12:42] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-24 23:12:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 2/238 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 210/448 variables, 238/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 2/450 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/450 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/540 variables, and 270 constraints, problems are : Problem set: 0 solved, 206 unsolved in 13417 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 240/285 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 2/238 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 210/448 variables, 238/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 206/474 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 2/450 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/450 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/540 variables, and 476 constraints, problems are : Problem set: 0 solved, 206 unsolved in 22935 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 240/285 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 36375ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 36377ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/541 places, 255/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37697 ms. Remains : 285/541 places, 255/511 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-13
Product exploration explored 100000 steps with 358 reset in 242 ms.
Product exploration explored 100000 steps with 358 reset in 258 ms.
Computed a total of 285 stabilizing places and 255 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 255
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (136 resets) in 236 ms. (168 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
[2024-05-24 23:13:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 199/203 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/237 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/445 variables, 237/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/446 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/446 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/540 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 222 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 238/285 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 199/203 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/237 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 445/540 variables, and 267 constraints, problems are : Problem set: 1 solved, 0 unsolved in 176 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/285 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 408ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-13 finished in 39214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 511/511 transitions.
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 516 transition count 264
Reduce places removed 222 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 223 rules applied. Total rules applied 445 place count 294 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 446 place count 293 transition count 263
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 455 place count 284 transition count 254
Iterating global reduction 3 with 9 rules applied. Total rules applied 464 place count 284 transition count 254
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 466 place count 284 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 468 place count 282 transition count 252
Applied a total of 468 rules in 33 ms. Remains 282 /541 variables (removed 259) and now considering 252/511 (removed 259) transitions.
// Phase 1: matrix 252 rows 282 cols
[2024-05-24 23:13:20] [INFO ] Computed 30 invariants in 2 ms
[2024-05-24 23:13:20] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-24 23:13:20] [INFO ] Invariant cache hit.
[2024-05-24 23:13:21] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
[2024-05-24 23:13:21] [INFO ] Redundant transitions in 1 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-24 23:13:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 2/235 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 206/441 variables, 235/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 3/444 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/444 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/534 variables, and 267 constraints, problems are : Problem set: 0 solved, 203 unsolved in 12735 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/282 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 2/235 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 206/441 variables, 235/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 195/460 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 3/444 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 8/470 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/444 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/534 variables, and 470 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18616 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/282 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 31380ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 31383ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/541 places, 252/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32555 ms. Remains : 282/541 places, 252/511 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-14
Stuttering criterion allowed to conclude after 271 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-14 finished in 32618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1 U p2)))'
[2024-05-24 23:13:53] [INFO ] Flatten gal took : 44 ms
[2024-05-24 23:13:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-24 23:13:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 541 places, 511 transitions and 1531 arcs took 7 ms.
Total runtime 651004 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HirschbergSinclair-PT-25

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 541
TRANSITIONS: 511
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.002s]


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1090
MODEL NAME: /home/mcc/execution/414/model
541 places, 511 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..

BK_TIME_CONFINEMENT_REACHED

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

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

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="HirschbergSinclair-PT-25"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is HirschbergSinclair-PT-25, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-171649586500091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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