Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r137-smll-167819417800268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Diffusion2D-PT-D50N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819417800268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 7.3K Feb 26 04:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 04:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 04:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 04:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 04:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 04:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.3M Mar 5 18:22 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 Diffusion2D-PT-D50N100-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D50N100-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678757229625

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D50N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 01:27:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 01:27:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 01:27:13] [INFO ] Load time of PNML (sax parser for PT used): 735 ms
[2023-03-14 01:27:13] [INFO ] Transformed 2500 places.
[2023-03-14 01:27:13] [INFO ] Transformed 19404 transitions.
[2023-03-14 01:27:13] [INFO ] Parsed PT model containing 2500 places and 19404 transitions and 38808 arcs in 917 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 973 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-14 01:27:14] [INFO ] Computed 1 place invariants in 236 ms
[2023-03-14 01:27:15] [INFO ] Implicit Places using invariants in 949 ms returned []
Implicit Place search using SMT only with invariants took 994 ms to find 0 implicit places.
[2023-03-14 01:27:15] [INFO ] Invariant cache hit.
[2023-03-14 01:27:30] [INFO ] Dead Transitions using invariants and state equation in 15236 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17223 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Support contains 28 out of 2500 places after structural reductions.
[2023-03-14 01:27:32] [INFO ] Flatten gal took : 810 ms
[2023-03-14 01:27:32] [INFO ] Flatten gal took : 442 ms
[2023-03-14 01:27:33] [INFO ] Input system was already deterministic with 19404 transitions.
Support contains 23 out of 2500 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Interrupted probabilistic random walk after 164013 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{1=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 164013 steps, saw 133675 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :4
Running SMT prover for 18 properties.
[2023-03-14 01:27:37] [INFO ] Invariant cache hit.
[2023-03-14 01:27:38] [INFO ] [Real]Absence check using 1 positive place invariants in 28 ms returned sat
[2023-03-14 01:28:02] [INFO ] After 22831ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:16
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 01:28:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 01:28:02] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 18 Parikh solutions to 3 different solutions.
Parikh walk visited 17 properties in 1783 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 43 ms
Free SCC test removed 2498 places
Drop transitions removed 19388 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 19402 transitions.
Applied a total of 1 rules in 97 ms. Remains 2 /2500 variables (removed 2498) and now considering 2/19404 (removed 19402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2/2500 places, 2/19404 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA Diffusion2D-PT-D50N100-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((F(G(p1))&&G(p2))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 598 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-14 01:28:05] [INFO ] Invariant cache hit.
[2023-03-14 01:28:05] [INFO ] Implicit Places using invariants in 384 ms returned []
Implicit Place search using SMT only with invariants took 386 ms to find 0 implicit places.
[2023-03-14 01:28:05] [INFO ] Invariant cache hit.
[2023-03-14 01:28:22] [INFO ] Dead Transitions using invariants and state equation in 16503 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17500 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s254 1), p2:(LT s1395 1), p1:(LT s2240 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6525 ms.
Stack based approach found an accepted trace after 69096 steps with 0 reset with depth 69097 and stack size 541 in 4412 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-00 finished in 28971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 15 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 42 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-14 01:28:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 01:28:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-14 01:28:33] [INFO ] Invariant cache hit.
[2023-03-14 01:28:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-14 01:28:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 01:28:33] [INFO ] Invariant cache hit.
[2023-03-14 01:28:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-01 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(p2)))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 578 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-14 01:28:34] [INFO ] Computed 1 place invariants in 141 ms
[2023-03-14 01:28:35] [INFO ] Implicit Places using invariants in 530 ms returned []
Implicit Place search using SMT only with invariants took 534 ms to find 0 implicit places.
[2023-03-14 01:28:35] [INFO ] Invariant cache hit.
[2023-03-14 01:28:49] [INFO ] Dead Transitions using invariants and state equation in 14457 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15583 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(GEQ s1939 1), p0:(AND (LT s666 1) (GEQ s1939 1)), p1:(GEQ s2051 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-02 finished in 15951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(G(p1)||F(((X(p2)&&G(p0))||G(p2))))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 580 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-14 01:28:50] [INFO ] Invariant cache hit.
[2023-03-14 01:28:50] [INFO ] Implicit Places using invariants in 395 ms returned []
Implicit Place search using SMT only with invariants took 398 ms to find 0 implicit places.
[2023-03-14 01:28:50] [INFO ] Invariant cache hit.
[2023-03-14 01:29:04] [INFO ] Dead Transitions using invariants and state equation in 13860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14844 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 590 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p0), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=3 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=3 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=3 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=3 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0, 2} source=3 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=4 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=4 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=4 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 10}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=5 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=5 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=5 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=6 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=6 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=7 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=8 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=8 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=8 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=9 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=9 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=9 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=10 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 9}]], initial=0, aps=[p1:(LT s298 1), p0:(LT s1474 1), p2:(LT s949 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 62 reset in 3444 ms.
Product exploration explored 100000 steps with 47 reset in 3470 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1279 ms. Reduced automaton from 11 states, 85 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 462 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10092 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=388 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 190918 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190918 steps, saw 154621 distinct states, run finished after 3004 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-14 01:29:17] [INFO ] Invariant cache hit.
[2023-03-14 01:29:18] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2023-03-14 01:29:31] [INFO ] After 13312ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-14 01:29:32] [INFO ] After 14387ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 01:29:32] [INFO ] After 15255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 01:29:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-14 01:29:57] [INFO ] After 24023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 01:29:57] [INFO ] After 24023ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-14 01:29:57] [INFO ] After 25152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Finished Parikh walk after 12465 steps, including 0 resets, run visited all 1 properties in 134 ms. (steps per millisecond=93 )
Parikh walk visited 8 properties in 648 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1382 ms. Reduced automaton from 10 states, 76 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 445 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 581 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-14 01:30:01] [INFO ] Invariant cache hit.
[2023-03-14 01:30:01] [INFO ] Implicit Places using invariants in 361 ms returned []
Implicit Place search using SMT only with invariants took 366 ms to find 0 implicit places.
[2023-03-14 01:30:01] [INFO ] Invariant cache hit.
[2023-03-14 01:30:20] [INFO ] Dead Transitions using invariants and state equation in 18253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19206 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 660 ms. Reduced automaton from 10 states, 76 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 454 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 190744 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190744 steps, saw 154479 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-14 01:30:24] [INFO ] Invariant cache hit.
[2023-03-14 01:30:25] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2023-03-14 01:30:40] [INFO ] After 15556ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-14 01:30:41] [INFO ] After 16558ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 01:30:41] [INFO ] After 17403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 01:30:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-14 01:31:06] [INFO ] After 24078ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-14 01:31:06] [INFO ] After 24080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-14 01:31:06] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 11664 steps, including 0 resets, run visited all 2 properties in 210 ms. (steps per millisecond=55 )
Parikh walk visited 8 properties in 733 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 879 ms. Reduced automaton from 10 states, 76 edges and 3 AP (stutter sensitive) to 10 states, 76 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 440 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 445 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 445 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 18 reset in 3128 ms.
Product exploration explored 100000 steps with 16 reset in 3528 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 575 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-14 01:31:17] [INFO ] Invariant cache hit.
[2023-03-14 01:31:17] [INFO ] Implicit Places using invariants in 371 ms returned []
Implicit Place search using SMT only with invariants took 372 ms to find 0 implicit places.
[2023-03-14 01:31:17] [INFO ] Invariant cache hit.
[2023-03-14 01:31:36] [INFO ] Dead Transitions using invariants and state equation in 18252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19203 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-04 finished in 167033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 25 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-14 01:31:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 01:31:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 01:31:37] [INFO ] Invariant cache hit.
[2023-03-14 01:31:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-14 01:31:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 01:31:37] [INFO ] Invariant cache hit.
[2023-03-14 01:31:37] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-06 finished in 167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 623 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2023-03-14 01:31:37] [INFO ] Computed 1 place invariants in 105 ms
[2023-03-14 01:31:38] [INFO ] Implicit Places using invariants in 493 ms returned []
Implicit Place search using SMT only with invariants took 498 ms to find 0 implicit places.
[2023-03-14 01:31:38] [INFO ] Invariant cache hit.
[2023-03-14 01:31:53] [INFO ] Dead Transitions using invariants and state equation in 15490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16613 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1255 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22 reset in 3102 ms.
Stack based approach found an accepted trace after 606 steps with 0 reset with depth 607 and stack size 607 in 9 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-08 finished in 19849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||(p2&&X(p2))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 566 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-14 01:31:57] [INFO ] Invariant cache hit.
[2023-03-14 01:31:57] [INFO ] Implicit Places using invariants in 354 ms returned []
Implicit Place search using SMT only with invariants took 359 ms to find 0 implicit places.
[2023-03-14 01:31:57] [INFO ] Invariant cache hit.
[2023-03-14 01:32:12] [INFO ] Dead Transitions using invariants and state equation in 14414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15342 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s2348 1), p0:(LT s798 1), p2:(LT s646 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7 reset in 3952 ms.
Product exploration explored 100000 steps with 9 reset in 4069 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 402 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 175511 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175511 steps, saw 142510 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-14 01:32:24] [INFO ] Invariant cache hit.
[2023-03-14 01:32:24] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2023-03-14 01:32:35] [INFO ] After 10437ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-14 01:32:36] [INFO ] After 11491ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 01:32:36] [INFO ] After 12195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 01:32:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-14 01:32:50] [INFO ] After 13370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 01:32:54] [INFO ] After 17112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1995 ms.
[2023-03-14 01:32:56] [INFO ] After 19795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 23695 steps, including 0 resets, run visited all 4 properties in 566 ms. (steps per millisecond=41 )
Parikh walk visited 4 properties in 569 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 489 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 590 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-14 01:32:58] [INFO ] Invariant cache hit.
[2023-03-14 01:32:58] [INFO ] Implicit Places using invariants in 400 ms returned []
Implicit Place search using SMT only with invariants took 401 ms to find 0 implicit places.
[2023-03-14 01:32:58] [INFO ] Invariant cache hit.
[2023-03-14 01:33:17] [INFO ] Dead Transitions using invariants and state equation in 19135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20129 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 398 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 215100 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215100 steps, saw 173502 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-14 01:33:21] [INFO ] Invariant cache hit.
[2023-03-14 01:33:21] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-14 01:33:32] [INFO ] After 10204ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-14 01:33:33] [INFO ] After 11254ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 01:33:33] [INFO ] After 11879ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 01:33:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-14 01:33:47] [INFO ] After 13328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 01:33:50] [INFO ] After 17100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2009 ms.
[2023-03-14 01:33:52] [INFO ] After 19789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 22082 steps, including 0 resets, run visited all 1 properties in 226 ms. (steps per millisecond=97 )
Parikh walk visited 4 properties in 1109 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 488 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 12 reset in 3579 ms.
Product exploration explored 100000 steps with 11 reset in 3721 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 567 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-14 01:34:02] [INFO ] Invariant cache hit.
[2023-03-14 01:34:03] [INFO ] Implicit Places using invariants in 360 ms returned []
Implicit Place search using SMT only with invariants took 361 ms to find 0 implicit places.
[2023-03-14 01:34:03] [INFO ] Invariant cache hit.
[2023-03-14 01:34:20] [INFO ] Dead Transitions using invariants and state equation in 16724 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17662 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-10 finished in 143433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 564 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2023-03-14 01:34:21] [INFO ] Invariant cache hit.
[2023-03-14 01:34:21] [INFO ] Implicit Places using invariants in 397 ms returned []
Implicit Place search using SMT only with invariants took 401 ms to find 0 implicit places.
[2023-03-14 01:34:21] [INFO ] Invariant cache hit.
[2023-03-14 01:34:37] [INFO ] Dead Transitions using invariants and state equation in 16432 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17398 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s1447 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 14132 steps with 0 reset in 554 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-11 finished in 18084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 21 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-14 01:34:38] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 01:34:38] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-14 01:34:38] [INFO ] Invariant cache hit.
[2023-03-14 01:34:38] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-14 01:34:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 01:34:38] [INFO ] Invariant cache hit.
[2023-03-14 01:34:38] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-13 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19372 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 21 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2023-03-14 01:34:38] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 01:34:38] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-14 01:34:38] [INFO ] Invariant cache hit.
[2023-03-14 01:34:38] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-14 01:34:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 01:34:38] [INFO ] Invariant cache hit.
[2023-03-14 01:34:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/2500 places, 5/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1 1), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-14 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(p2))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 19 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-14 01:34:38] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 01:34:38] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-14 01:34:38] [INFO ] Invariant cache hit.
[2023-03-14 01:34:38] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-14 01:34:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 01:34:38] [INFO ] Invariant cache hit.
[2023-03-14 01:34:38] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(GEQ s2 1), p2:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-15 finished in 216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(G(p1)||F(((X(p2)&&G(p0))||G(p2))))))))'
Found a Shortening insensitive property : Diffusion2D-PT-D50N100-LTLFireability-04
Stuttering acceptance computed with spot in 569 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 17 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2023-03-14 01:34:40] [INFO ] Invariant cache hit.
[2023-03-14 01:34:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-14 01:34:40] [INFO ] Invariant cache hit.
[2023-03-14 01:34:40] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-14 01:34:40] [INFO ] Invariant cache hit.
[2023-03-14 01:34:40] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 79 ms. Remains : 4/2500 places, 7/19404 transitions.
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p1 p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p0), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=3 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=3 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=3 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=3 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=3 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0, 2} source=3 dest: 10}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=4 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=4 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=4 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1, 2} source=4 dest: 10}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=5 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=5 dest: 8}, { cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 9}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=5 dest: 9}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=5 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 2} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p1 p2 p0), acceptance={2} source=6 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=6 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={1, 2} source=7 dest: 7}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=8 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=8 dest: 6}, { cond=(AND p1 p2 p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p2) p0), acceptance={1} source=8 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 2} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={2} source=9 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=9 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={0, 2} source=9 dest: 9}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1, 2} source=10 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=10 dest: 9}]], initial=0, aps=[p1:(LT s0 1), p0:(LT s2 1), p2:(LT s1 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-04 finished in 987 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||(p2&&X(p2))))))'
Found a Shortening insensitive property : Diffusion2D-PT-D50N100-LTLFireability-10
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 18 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 38 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2023-03-14 01:34:40] [INFO ] Invariant cache hit.
[2023-03-14 01:34:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-14 01:34:40] [INFO ] Invariant cache hit.
[2023-03-14 01:34:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-14 01:34:40] [INFO ] Invariant cache hit.
[2023-03-14 01:34:40] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 117 ms. Remains : 4/2500 places, 7/19404 transitions.
Running random walk in product with property : Diffusion2D-PT-D50N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p1:(GEQ s2 1), p0:(LT s1 1), p2:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
Treatment of property Diffusion2D-PT-D50N100-LTLFireability-10 finished in 393 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-14 01:34:40] [INFO ] Flatten gal took : 337 ms
[2023-03-14 01:34:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-14 01:34:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 19404 transitions and 38808 arcs took 79 ms.
Total runtime 448662 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1694/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1694/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Diffusion2D-PT-D50N100-LTLFireability-04
Could not compute solution for formula : Diffusion2D-PT-D50N100-LTLFireability-10

BK_STOP 1678757699431

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Diffusion2D-PT-D50N100-LTLFireability-04
ltl formula formula --ltl=/tmp/1694/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2500 places, 19404 transitions and 38808 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.140 real 0.590 user 0.740 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1694/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1694/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1694/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1694/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 18 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Diffusion2D-PT-D50N100-LTLFireability-10
ltl formula formula --ltl=/tmp/1694/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2500 places, 19404 transitions and 38808 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.100 real 0.570 user 0.710 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1694/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1694/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1694/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1694/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="Diffusion2D-PT-D50N100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Diffusion2D-PT-D50N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819417800268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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