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.r389-oct2-167903713600500.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713600500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.2K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 02:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 02:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 02:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 02:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 02:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 447K Mar 5 18:23 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 ShieldPPPs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679208347592

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 06:45:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 06:45:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 06:45:50] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-19 06:45:50] [INFO ] Transformed 1553 places.
[2023-03-19 06:45:50] [INFO ] Transformed 1303 transitions.
[2023-03-19 06:45:50] [INFO ] Found NUPN structural information;
[2023-03-19 06:45:50] [INFO ] Parsed PT model containing 1553 places and 1303 transitions and 5006 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPs-PT-050A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 192 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:45:50] [INFO ] Computed 551 place invariants in 37 ms
[2023-03-19 06:45:52] [INFO ] Implicit Places using invariants in 1395 ms returned []
[2023-03-19 06:45:52] [INFO ] Invariant cache hit.
[2023-03-19 06:45:54] [INFO ] Implicit Places using invariants and state equation in 2588 ms returned []
Implicit Place search using SMT with State Equation took 4023 ms to find 0 implicit places.
[2023-03-19 06:45:54] [INFO ] Invariant cache hit.
[2023-03-19 06:45:55] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5239 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 58 out of 1553 places after structural reductions.
[2023-03-19 06:45:56] [INFO ] Flatten gal took : 174 ms
[2023-03-19 06:45:56] [INFO ] Flatten gal took : 90 ms
[2023-03-19 06:45:56] [INFO ] Input system was already deterministic with 1303 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 31) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 06:45:56] [INFO ] Invariant cache hit.
[2023-03-19 06:45:57] [INFO ] [Real]Absence check using 551 positive place invariants in 118 ms returned sat
[2023-03-19 06:45:58] [INFO ] After 1901ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 06:45:59] [INFO ] [Nat]Absence check using 551 positive place invariants in 227 ms returned sat
[2023-03-19 06:46:00] [INFO ] After 1110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 06:46:02] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 37 ms to minimize.
[2023-03-19 06:46:02] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2023-03-19 06:46:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 434 ms
[2023-03-19 06:46:02] [INFO ] After 3329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 584 ms.
[2023-03-19 06:46:03] [INFO ] After 4666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 376 ms.
Support contains 9 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 444 times.
Drop transitions removed 444 transitions
Iterating global reduction 0 with 444 rules applied. Total rules applied 448 place count 1551 transition count 1301
Applied a total of 448 rules in 242 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-19 06:46:04] [INFO ] Computed 551 place invariants in 120 ms
[2023-03-19 06:46:05] [INFO ] [Real]Absence check using 518 positive place invariants in 87 ms returned sat
[2023-03-19 06:46:05] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 6 ms returned sat
[2023-03-19 06:46:05] [INFO ] After 1217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 06:46:06] [INFO ] [Nat]Absence check using 518 positive place invariants in 154 ms returned sat
[2023-03-19 06:46:06] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 67 ms returned sat
[2023-03-19 06:46:07] [INFO ] After 1043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 06:46:07] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2023-03-19 06:46:08] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2023-03-19 06:46:08] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2023-03-19 06:46:08] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 14 ms to minimize.
[2023-03-19 06:46:09] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2023-03-19 06:46:09] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 1 ms to minimize.
[2023-03-19 06:46:09] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 1 ms to minimize.
[2023-03-19 06:46:10] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-19 06:46:10] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2023-03-19 06:46:10] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2023-03-19 06:46:10] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-19 06:46:10] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2023-03-19 06:46:11] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2023-03-19 06:46:11] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-19 06:46:11] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-19 06:46:11] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2023-03-19 06:46:11] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2023-03-19 06:46:12] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2023-03-19 06:46:12] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 0 ms to minimize.
[2023-03-19 06:46:12] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-19 06:46:12] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-19 06:46:12] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2023-03-19 06:46:12] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2023-03-19 06:46:13] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2023-03-19 06:46:13] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2023-03-19 06:46:13] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2023-03-19 06:46:13] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2023-03-19 06:46:13] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2023-03-19 06:46:13] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6166 ms
[2023-03-19 06:46:14] [INFO ] After 7382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 159 ms.
[2023-03-19 06:46:14] [INFO ] After 8237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 265 ms.
Support contains 5 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1550 transition count 1300
Applied a total of 1 rules in 120 ms. Remains 1550 /1551 variables (removed 1) and now considering 1300/1301 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 1550/1551 places, 1300/1301 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 204950 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{0=1}
Probabilistic random walk after 204950 steps, saw 203014 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 1300 rows 1550 cols
[2023-03-19 06:46:17] [INFO ] Computed 551 place invariants in 58 ms
[2023-03-19 06:46:18] [INFO ] [Real]Absence check using 530 positive place invariants in 140 ms returned sat
[2023-03-19 06:46:18] [INFO ] [Real]Absence check using 530 positive and 21 generalized place invariants in 18 ms returned sat
[2023-03-19 06:46:19] [INFO ] After 1247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 06:46:19] [INFO ] [Nat]Absence check using 530 positive place invariants in 245 ms returned sat
[2023-03-19 06:46:19] [INFO ] [Nat]Absence check using 530 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-19 06:46:21] [INFO ] After 1492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 06:46:21] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-19 06:46:21] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2023-03-19 06:46:22] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2023-03-19 06:46:22] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2023-03-19 06:46:22] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2023-03-19 06:46:22] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 1 ms to minimize.
[2023-03-19 06:46:23] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-19 06:46:23] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 2 ms to minimize.
[2023-03-19 06:46:24] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-19 06:46:24] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2023-03-19 06:46:24] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-19 06:46:24] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2023-03-19 06:46:25] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2023-03-19 06:46:25] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2023-03-19 06:46:25] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2023-03-19 06:46:25] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2023-03-19 06:46:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4278 ms
[2023-03-19 06:46:25] [INFO ] After 5823ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-19 06:46:25] [INFO ] After 6484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 61 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211934 steps, run timeout after 3002 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211934 steps, saw 209936 distinct states, run finished after 3004 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 06:46:28] [INFO ] Invariant cache hit.
[2023-03-19 06:46:29] [INFO ] [Real]Absence check using 530 positive place invariants in 132 ms returned sat
[2023-03-19 06:46:29] [INFO ] [Real]Absence check using 530 positive and 21 generalized place invariants in 5 ms returned sat
[2023-03-19 06:46:30] [INFO ] After 1236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 06:46:30] [INFO ] [Nat]Absence check using 530 positive place invariants in 90 ms returned sat
[2023-03-19 06:46:30] [INFO ] [Nat]Absence check using 530 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-19 06:46:31] [INFO ] After 743ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 06:46:31] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2023-03-19 06:46:31] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 2 ms to minimize.
[2023-03-19 06:46:32] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-19 06:46:32] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2023-03-19 06:46:33] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-19 06:46:33] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2023-03-19 06:46:33] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-19 06:46:33] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2023-03-19 06:46:34] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2023-03-19 06:46:34] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-19 06:46:34] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2023-03-19 06:46:34] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2023-03-19 06:46:34] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-19 06:46:34] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-19 06:46:34] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 13 ms to minimize.
[2023-03-19 06:46:36] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 2 ms to minimize.
[2023-03-19 06:46:36] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2023-03-19 06:46:37] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2023-03-19 06:46:37] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-19 06:46:37] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 0 ms to minimize.
[2023-03-19 06:46:37] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-19 06:46:38] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2023-03-19 06:46:38] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-19 06:46:38] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 0 ms to minimize.
[2023-03-19 06:46:38] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-19 06:46:39] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-19 06:46:39] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2023-03-19 06:46:39] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-19 06:46:39] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2023-03-19 06:46:40] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-19 06:46:40] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2023-03-19 06:46:40] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-19 06:46:40] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-19 06:46:40] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-19 06:46:40] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2023-03-19 06:46:41] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-19 06:46:41] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2023-03-19 06:46:41] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2023-03-19 06:46:41] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-19 06:46:41] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2023-03-19 06:46:42] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-19 06:46:42] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2023-03-19 06:46:42] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2023-03-19 06:46:42] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2023-03-19 06:46:42] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-19 06:46:43] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 0 ms to minimize.
[2023-03-19 06:46:43] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-19 06:46:44] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-19 06:46:44] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2023-03-19 06:46:45] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-19 06:46:46] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 1 ms to minimize.
[2023-03-19 06:46:46] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2023-03-19 06:46:46] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2023-03-19 06:46:46] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
[2023-03-19 06:46:46] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2023-03-19 06:46:47] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2023-03-19 06:46:47] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2023-03-19 06:46:47] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-19 06:46:47] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 16156 ms
[2023-03-19 06:46:47] [INFO ] After 16984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 292 ms.
[2023-03-19 06:46:47] [INFO ] After 17720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 62 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 48 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2023-03-19 06:46:48] [INFO ] Invariant cache hit.
[2023-03-19 06:46:49] [INFO ] Implicit Places using invariants in 1066 ms returned []
[2023-03-19 06:46:49] [INFO ] Invariant cache hit.
[2023-03-19 06:46:52] [INFO ] Implicit Places using invariants and state equation in 3082 ms returned []
Implicit Place search using SMT with State Equation took 4157 ms to find 0 implicit places.
[2023-03-19 06:46:52] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-19 06:46:52] [INFO ] Invariant cache hit.
[2023-03-19 06:46:53] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5198 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 46 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 06:46:53] [INFO ] Invariant cache hit.
[2023-03-19 06:46:53] [INFO ] [Real]Absence check using 530 positive place invariants in 92 ms returned sat
[2023-03-19 06:46:53] [INFO ] [Real]Absence check using 530 positive and 21 generalized place invariants in 5 ms returned sat
[2023-03-19 06:46:54] [INFO ] After 1141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 06:46:54] [INFO ] [Nat]Absence check using 530 positive place invariants in 97 ms returned sat
[2023-03-19 06:46:54] [INFO ] [Nat]Absence check using 530 positive and 21 generalized place invariants in 5 ms returned sat
[2023-03-19 06:46:55] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 06:46:56] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2023-03-19 06:46:56] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2023-03-19 06:46:57] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2023-03-19 06:46:57] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 0 ms to minimize.
[2023-03-19 06:46:57] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 12 ms to minimize.
[2023-03-19 06:46:57] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-19 06:46:57] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2023-03-19 06:46:58] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 0 ms to minimize.
[2023-03-19 06:46:58] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2023-03-19 06:46:58] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2023-03-19 06:46:58] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 3 ms to minimize.
[2023-03-19 06:46:58] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-03-19 06:46:59] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2023-03-19 06:46:59] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2023-03-19 06:46:59] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-19 06:47:01] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-19 06:47:01] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-19 06:47:01] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2023-03-19 06:47:01] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2023-03-19 06:47:01] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-19 06:47:02] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2023-03-19 06:47:02] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2023-03-19 06:47:02] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-19 06:47:02] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2023-03-19 06:47:03] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-19 06:47:03] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-19 06:47:03] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-19 06:47:03] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2023-03-19 06:47:03] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2023-03-19 06:47:04] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2023-03-19 06:47:04] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-19 06:47:04] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-19 06:47:04] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2023-03-19 06:47:04] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2023-03-19 06:47:05] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2023-03-19 06:47:05] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2023-03-19 06:47:05] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2023-03-19 06:47:05] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2023-03-19 06:47:05] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2023-03-19 06:47:05] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-03-19 06:47:06] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2023-03-19 06:47:06] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2023-03-19 06:47:06] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-19 06:47:06] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2023-03-19 06:47:06] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2023-03-19 06:47:07] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 0 ms to minimize.
[2023-03-19 06:47:07] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-19 06:47:08] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-19 06:47:08] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2023-03-19 06:47:09] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2023-03-19 06:47:10] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 1 ms to minimize.
[2023-03-19 06:47:10] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2023-03-19 06:47:10] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2023-03-19 06:47:10] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2023-03-19 06:47:10] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2023-03-19 06:47:11] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-19 06:47:11] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2023-03-19 06:47:11] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2023-03-19 06:47:11] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 15901 ms
[2023-03-19 06:47:11] [INFO ] After 16803ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 269 ms.
[2023-03-19 06:47:11] [INFO ] After 17519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 1 stabilizing places and 1 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' '!((F((!p0&&G(F(!p1)))) U (p2&&X(F(p3)))))'
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 36 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:47:12] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-19 06:47:13] [INFO ] Implicit Places using invariants in 801 ms returned []
[2023-03-19 06:47:13] [INFO ] Invariant cache hit.
[2023-03-19 06:47:15] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 2974 ms to find 0 implicit places.
[2023-03-19 06:47:15] [INFO ] Invariant cache hit.
[2023-03-19 06:47:16] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3852 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}, { cond=p2, acceptance={0} source=0 dest: 4}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s921 1), p1:(AND (EQ s1213 1) (EQ s1234 1)), p0:(AND (EQ s917 1) (EQ s928 1)), p3:(AND (EQ s1213 1) (EQ s1234 1) (EQ s562 1) (EQ s583 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 204 reset in 1106 ms.
Product exploration explored 100000 steps with 204 reset in 1049 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1001 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 06:47:20] [INFO ] Invariant cache hit.
[2023-03-19 06:47:21] [INFO ] [Real]Absence check using 551 positive place invariants in 93 ms returned sat
[2023-03-19 06:47:21] [INFO ] After 1184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 06:47:22] [INFO ] [Nat]Absence check using 551 positive place invariants in 137 ms returned sat
[2023-03-19 06:47:24] [INFO ] After 2061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 06:47:24] [INFO ] After 2335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-19 06:47:24] [INFO ] After 3125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 80 ms.
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 447 times.
Drop transitions removed 447 transitions
Iterating global reduction 0 with 447 rules applied. Total rules applied 451 place count 1551 transition count 1301
Applied a total of 451 rules in 159 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Finished random walk after 4950 steps, including 1 resets, run visited all 1 properties in 60 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p3), (F p2), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 14 factoid took 1070 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
[2023-03-19 06:47:26] [INFO ] Invariant cache hit.
[2023-03-19 06:47:28] [INFO ] [Real]Absence check using 551 positive place invariants in 580 ms returned sat
[2023-03-19 06:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:47:35] [INFO ] [Real]Absence check using state equation in 6616 ms returned sat
[2023-03-19 06:47:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:47:36] [INFO ] [Nat]Absence check using 551 positive place invariants in 299 ms returned sat
[2023-03-19 06:47:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:47:40] [INFO ] [Nat]Absence check using state equation in 4144 ms returned sat
[2023-03-19 06:47:41] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 213 ms.
[2023-03-19 06:47:50] [INFO ] Added : 315 causal constraints over 63 iterations in 9297 ms. Result :unknown
Could not prove EG (NOT p2)
[2023-03-19 06:47:50] [INFO ] Invariant cache hit.
[2023-03-19 06:47:51] [INFO ] [Real]Absence check using 551 positive place invariants in 149 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p3), (F p2), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1)), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 14 factoid took 312 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050A-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050A-LTLFireability-01 finished in 39453 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) U G((!p1&&X(!p2)))))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 32 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 06:47:51] [INFO ] Invariant cache hit.
[2023-03-19 06:47:52] [INFO ] Implicit Places using invariants in 864 ms returned []
[2023-03-19 06:47:52] [INFO ] Invariant cache hit.
[2023-03-19 06:47:54] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2571 ms to find 0 implicit places.
[2023-03-19 06:47:54] [INFO ] Invariant cache hit.
[2023-03-19 06:47:55] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3439 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s191 1) (EQ s210 1)), p0:(AND (EQ s297 1) (EQ s306 1)), p2:(AND (EQ s790 1) (EQ s832 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40137 reset in 2875 ms.
Product exploration explored 100000 steps with 40011 reset in 3157 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 995 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 06:48:03] [INFO ] Invariant cache hit.
[2023-03-19 06:48:03] [INFO ] [Real]Absence check using 551 positive place invariants in 180 ms returned sat
[2023-03-19 06:48:03] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 06:48:04] [INFO ] [Nat]Absence check using 551 positive place invariants in 233 ms returned sat
[2023-03-19 06:48:05] [INFO ] After 1094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 06:48:05] [INFO ] After 1618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-19 06:48:06] [INFO ] After 2441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 177 ms.
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 442 times.
Drop transitions removed 442 transitions
Iterating global reduction 0 with 442 rules applied. Total rules applied 446 place count 1551 transition count 1301
Applied a total of 446 rules in 139 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 140480 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140480 steps, saw 135353 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-19 06:48:09] [INFO ] Computed 551 place invariants in 26 ms
[2023-03-19 06:48:10] [INFO ] [Real]Absence check using 518 positive place invariants in 92 ms returned sat
[2023-03-19 06:48:10] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 6 ms returned sat
[2023-03-19 06:48:10] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 06:48:10] [INFO ] [Nat]Absence check using 518 positive place invariants in 116 ms returned sat
[2023-03-19 06:48:10] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 7 ms returned sat
[2023-03-19 06:48:22] [INFO ] After 12228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 06:48:25] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2023-03-19 06:48:26] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-19 06:48:26] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-19 06:48:26] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-19 06:48:26] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2023-03-19 06:48:26] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2023-03-19 06:48:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1272 ms
[2023-03-19 06:48:26] [INFO ] After 16224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2147 ms.
[2023-03-19 06:48:29] [INFO ] After 18897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 265 ms.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 42 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 40 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 06:48:29] [INFO ] Invariant cache hit.
[2023-03-19 06:48:30] [INFO ] Implicit Places using invariants in 977 ms returned []
[2023-03-19 06:48:30] [INFO ] Invariant cache hit.
[2023-03-19 06:48:33] [INFO ] Implicit Places using invariants and state equation in 3021 ms returned []
Implicit Place search using SMT with State Equation took 4000 ms to find 0 implicit places.
[2023-03-19 06:48:33] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-19 06:48:33] [INFO ] Invariant cache hit.
[2023-03-19 06:48:34] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4917 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 53 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 06:48:34] [INFO ] Invariant cache hit.
[2023-03-19 06:48:34] [INFO ] [Real]Absence check using 518 positive place invariants in 138 ms returned sat
[2023-03-19 06:48:34] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 8 ms returned sat
[2023-03-19 06:48:34] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 06:48:35] [INFO ] [Nat]Absence check using 518 positive place invariants in 83 ms returned sat
[2023-03-19 06:48:35] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 7 ms returned sat
[2023-03-19 06:48:42] [INFO ] After 7133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 06:48:45] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-19 06:48:45] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-19 06:48:45] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2023-03-19 06:48:50] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2023-03-19 06:48:50] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-03-19 06:48:50] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-19 06:48:51] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-19 06:48:51] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-19 06:48:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5977 ms
[2023-03-19 06:48:52] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-19 06:48:52] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2023-03-19 06:48:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2023-03-19 06:48:52] [INFO ] After 17131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10120 ms.
[2023-03-19 06:49:02] [INFO ] After 27664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 17 factoid took 1369 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 278 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 72 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:49:04] [INFO ] Computed 551 place invariants in 11 ms
[2023-03-19 06:49:05] [INFO ] Implicit Places using invariants in 941 ms returned []
[2023-03-19 06:49:05] [INFO ] Invariant cache hit.
[2023-03-19 06:49:07] [INFO ] Implicit Places using invariants and state equation in 2253 ms returned []
Implicit Place search using SMT with State Equation took 3197 ms to find 0 implicit places.
[2023-03-19 06:49:07] [INFO ] Invariant cache hit.
[2023-03-19 06:49:08] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4084 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 975 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 06:49:10] [INFO ] Invariant cache hit.
[2023-03-19 06:49:10] [INFO ] [Real]Absence check using 551 positive place invariants in 91 ms returned sat
[2023-03-19 06:49:10] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 06:49:10] [INFO ] [Nat]Absence check using 551 positive place invariants in 105 ms returned sat
[2023-03-19 06:49:11] [INFO ] After 929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 06:49:12] [INFO ] After 1521ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 223 ms.
[2023-03-19 06:49:12] [INFO ] After 2235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 177 ms.
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 442 times.
Drop transitions removed 442 transitions
Iterating global reduction 0 with 442 rules applied. Total rules applied 446 place count 1551 transition count 1301
Applied a total of 446 rules in 115 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Finished random walk after 3300 steps, including 0 resets, run visited all 2 properties in 63 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 17 factoid took 1099 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 271 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 198 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Product exploration explored 100000 steps with 39955 reset in 2933 ms.
Product exploration explored 100000 steps with 40014 reset in 2914 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 292 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 4 ms
Applied a total of 2 rules in 286 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 06:49:21] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:49:21] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-19 06:49:22] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1306 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin2564040675596049537
[2023-03-19 06:49:22] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2564040675596049537
Running compilation step : cd /tmp/ltsmin2564040675596049537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2626 ms.
Running link step : cd /tmp/ltsmin2564040675596049537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin2564040675596049537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14050234604653033162.hoa' '--buchi-type=spotba'
LTSmin run took 4957 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-050A-LTLFireability-02 finished in 98475 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)||((p1 U X(p0))&&F(p2))))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 61 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:49:30] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-19 06:49:31] [INFO ] Implicit Places using invariants in 946 ms returned []
[2023-03-19 06:49:31] [INFO ] Invariant cache hit.
[2023-03-19 06:49:33] [INFO ] Implicit Places using invariants and state equation in 2158 ms returned []
Implicit Place search using SMT with State Equation took 3131 ms to find 0 implicit places.
[2023-03-19 06:49:33] [INFO ] Invariant cache hit.
[2023-03-19 06:49:34] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4164 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1065 1) (EQ s1077 1)), p0:(AND (EQ s411 1) (EQ s431 1)), p2:(AND (EQ s977 1) (EQ s992 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 0 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-04 finished in 4469 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((G(p1)||p0)))'
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 130 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-19 06:49:35] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-19 06:49:35] [INFO ] Implicit Places using invariants in 941 ms returned []
[2023-03-19 06:49:35] [INFO ] Invariant cache hit.
[2023-03-19 06:49:38] [INFO ] Implicit Places using invariants and state equation in 2114 ms returned []
Implicit Place search using SMT with State Equation took 3057 ms to find 0 implicit places.
[2023-03-19 06:49:38] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-19 06:49:38] [INFO ] Invariant cache hit.
[2023-03-19 06:49:39] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4133 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (EQ s818 0) (EQ s820 0)) (OR (EQ s253 0) (EQ s272 0))), p0:(OR (AND (EQ s1492 1) (EQ s1513 1)) (AND (EQ s818 1) (EQ s820 1) (EQ s611 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4043 reset in 1256 ms.
Product exploration explored 100000 steps with 4070 reset in 1411 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2431 steps, including 0 resets, run visited all 2 properties in 39 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 316 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Support contains 7 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 81 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 06:49:42] [INFO ] Invariant cache hit.
[2023-03-19 06:49:43] [INFO ] Implicit Places using invariants in 973 ms returned []
[2023-03-19 06:49:43] [INFO ] Invariant cache hit.
[2023-03-19 06:49:45] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 3036 ms to find 0 implicit places.
[2023-03-19 06:49:45] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-19 06:49:45] [INFO ] Invariant cache hit.
[2023-03-19 06:49:46] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4040 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2522 steps, including 0 resets, run visited all 2 properties in 44 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 312 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3994 reset in 1150 ms.
Product exploration explored 100000 steps with 4035 reset in 1306 ms.
Built C files in :
/tmp/ltsmin17319400939700369980
[2023-03-19 06:49:49] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2023-03-19 06:49:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:49:49] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2023-03-19 06:49:49] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:49:50] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2023-03-19 06:49:50] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:49:50] [INFO ] Built C files in 346ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17319400939700369980
Running compilation step : cd /tmp/ltsmin17319400939700369980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17319400939700369980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17319400939700369980;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 7 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 83 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 06:49:53] [INFO ] Invariant cache hit.
[2023-03-19 06:49:54] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2023-03-19 06:49:54] [INFO ] Invariant cache hit.
[2023-03-19 06:49:57] [INFO ] Implicit Places using invariants and state equation in 2588 ms returned []
Implicit Place search using SMT with State Equation took 3731 ms to find 0 implicit places.
[2023-03-19 06:49:57] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-19 06:49:57] [INFO ] Invariant cache hit.
[2023-03-19 06:49:58] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4796 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin8131393822279020075
[2023-03-19 06:49:58] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2023-03-19 06:49:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:49:58] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2023-03-19 06:49:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:49:58] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2023-03-19 06:49:58] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:49:58] [INFO ] Built C files in 258ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8131393822279020075
Running compilation step : cd /tmp/ltsmin8131393822279020075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8131393822279020075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8131393822279020075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 06:50:01] [INFO ] Flatten gal took : 64 ms
[2023-03-19 06:50:01] [INFO ] Flatten gal took : 65 ms
[2023-03-19 06:50:01] [INFO ] Time to serialize gal into /tmp/LTL1691121958320314549.gal : 11 ms
[2023-03-19 06:50:01] [INFO ] Time to serialize properties into /tmp/LTL415267705232522799.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1691121958320314549.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17729288490312576251.hoa' '-atoms' '/tmp/LTL415267705232522799.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL415267705232522799.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17729288490312576251.hoa
Detected timeout of ITS tools.
[2023-03-19 06:50:16] [INFO ] Flatten gal took : 74 ms
[2023-03-19 06:50:16] [INFO ] Flatten gal took : 73 ms
[2023-03-19 06:50:16] [INFO ] Time to serialize gal into /tmp/LTL2474510135155102905.gal : 8 ms
[2023-03-19 06:50:16] [INFO ] Time to serialize properties into /tmp/LTL4059587237504293747.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2474510135155102905.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4059587237504293747.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((p818==0)||(p820==0))&&((p253==0)||(p272==0)))"))||("((p1492==1)&&(p1513==1))"))||("(((p818==1)&&(p820==1))&&(p611==0))"))...157
Formula 0 simplified : G(!"(((p818==1)&&(p820==1))&&(p611==0))" & !"((p1492==1)&&(p1513==1))" & F!"(((p818==0)||(p820==0))&&((p253==0)||(p272==0)))")
Detected timeout of ITS tools.
[2023-03-19 06:50:32] [INFO ] Flatten gal took : 95 ms
[2023-03-19 06:50:32] [INFO ] Applying decomposition
[2023-03-19 06:50:32] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4589421689625921745.txt' '-o' '/tmp/graph4589421689625921745.bin' '-w' '/tmp/graph4589421689625921745.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4589421689625921745.bin' '-l' '-1' '-v' '-w' '/tmp/graph4589421689625921745.weights' '-q' '0' '-e' '0.001'
[2023-03-19 06:50:32] [INFO ] Decomposing Gal with order
[2023-03-19 06:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 06:50:32] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 06:50:32] [INFO ] Flatten gal took : 125 ms
[2023-03-19 06:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 100 ms.
[2023-03-19 06:50:32] [INFO ] Time to serialize gal into /tmp/LTL3088955196670845758.gal : 26 ms
[2023-03-19 06:50:32] [INFO ] Time to serialize properties into /tmp/LTL4156698405033411929.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3088955196670845758.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4156698405033411929.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((i26.i2.u290.p818==0)||(i26.i1.u291.p820==0))&&((i8.i2.u90.p253==0)||(i8.i3.u97.p272==0)))"))||("((i48.i1.u529.p1492==1)&&...261
Formula 0 simplified : G(!"(((i26.i2.u290.p818==1)&&(i26.i1.u291.p820==1))&&(i19.i0.u217.p611==0))" & !"((i48.i1.u529.p1492==1)&&(i48.i1.u537.p1513==1))" &...253
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14925425162675489551
[2023-03-19 06:50:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14925425162675489551
Running compilation step : cd /tmp/ltsmin14925425162675489551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2862 ms.
Running link step : cd /tmp/ltsmin14925425162675489551;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin14925425162675489551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-05 finished in 88179 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((p0&&X(p1)&&F(p2))))'
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 62 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:51:03] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-19 06:51:04] [INFO ] Implicit Places using invariants in 960 ms returned []
[2023-03-19 06:51:04] [INFO ] Invariant cache hit.
[2023-03-19 06:51:06] [INFO ] Implicit Places using invariants and state equation in 2221 ms returned []
Implicit Place search using SMT with State Equation took 3183 ms to find 0 implicit places.
[2023-03-19 06:51:06] [INFO ] Invariant cache hit.
[2023-03-19 06:51:07] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4184 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-07 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 p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1375 0) (EQ s1385 0) (EQ s12 0) (EQ s14 0)), p2:(AND (EQ s879 1) (EQ s889 1)), p1:(AND (EQ s1375 1) (EQ s1385 1) (EQ s424 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2736 steps with 2 reset in 62 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-07 finished in 4536 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)||G((F(p1)&&F(p2)))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 122 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-19 06:51:07] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-19 06:51:08] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2023-03-19 06:51:08] [INFO ] Invariant cache hit.
[2023-03-19 06:51:11] [INFO ] Implicit Places using invariants and state equation in 2472 ms returned []
Implicit Place search using SMT with State Equation took 3500 ms to find 0 implicit places.
[2023-03-19 06:51:11] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-19 06:51:11] [INFO ] Invariant cache hit.
[2023-03-19 06:51:12] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4557 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1039 1) (EQ s1054 1)), p1:(EQ s1147 0), p2:(OR (EQ s538 0) (EQ s550 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 101 reset in 1020 ms.
Product exploration explored 100000 steps with 101 reset in 1149 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 593 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 2120 steps, including 0 resets, run visited all 2 properties in 47 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 608 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 3 out of 1551 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 79 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 06:51:16] [INFO ] Invariant cache hit.
[2023-03-19 06:51:17] [INFO ] Implicit Places using invariants in 870 ms returned []
[2023-03-19 06:51:17] [INFO ] Invariant cache hit.
[2023-03-19 06:51:19] [INFO ] Implicit Places using invariants and state equation in 2221 ms returned []
Implicit Place search using SMT with State Equation took 3096 ms to find 0 implicit places.
[2023-03-19 06:51:19] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-19 06:51:19] [INFO ] Invariant cache hit.
[2023-03-19 06:51:20] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4181 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 1992 steps, including 0 resets, run visited all 2 properties in 53 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 428 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 103 reset in 1064 ms.
Product exploration explored 100000 steps with 98 reset in 1236 ms.
Built C files in :
/tmp/ltsmin860638389330858133
[2023-03-19 06:51:24] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2023-03-19 06:51:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:51:24] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2023-03-19 06:51:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:51:24] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2023-03-19 06:51:24] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:51:24] [INFO ] Built C files in 273ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin860638389330858133
Running compilation step : cd /tmp/ltsmin860638389330858133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin860638389330858133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin860638389330858133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 72 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 06:51:27] [INFO ] Invariant cache hit.
[2023-03-19 06:51:28] [INFO ] Implicit Places using invariants in 910 ms returned []
[2023-03-19 06:51:28] [INFO ] Invariant cache hit.
[2023-03-19 06:51:30] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2982 ms to find 0 implicit places.
[2023-03-19 06:51:30] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-19 06:51:30] [INFO ] Invariant cache hit.
[2023-03-19 06:51:31] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3990 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin665833434012279961
[2023-03-19 06:51:31] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2023-03-19 06:51:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:51:31] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2023-03-19 06:51:31] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:51:31] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2023-03-19 06:51:31] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:51:31] [INFO ] Built C files in 247ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin665833434012279961
Running compilation step : cd /tmp/ltsmin665833434012279961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin665833434012279961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin665833434012279961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 06:51:35] [INFO ] Flatten gal took : 63 ms
[2023-03-19 06:51:35] [INFO ] Flatten gal took : 53 ms
[2023-03-19 06:51:35] [INFO ] Time to serialize gal into /tmp/LTL5791904433332256181.gal : 7 ms
[2023-03-19 06:51:35] [INFO ] Time to serialize properties into /tmp/LTL17214479917538406395.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5791904433332256181.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16759330047262118968.hoa' '-atoms' '/tmp/LTL17214479917538406395.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17214479917538406395.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16759330047262118968.hoa
Detected timeout of ITS tools.
[2023-03-19 06:51:50] [INFO ] Flatten gal took : 56 ms
[2023-03-19 06:51:50] [INFO ] Flatten gal took : 49 ms
[2023-03-19 06:51:50] [INFO ] Time to serialize gal into /tmp/LTL12106737222136242429.gal : 13 ms
[2023-03-19 06:51:50] [INFO ] Time to serialize properties into /tmp/LTL3753209636888800468.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12106737222136242429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3753209636888800468.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((p1039==1)&&(p1054==1))"))||(G((F("(p1147==0)"))&&(F("((p538==0)||(p550==0))"))))))
Formula 0 simplified : F!"((p1039==1)&&(p1054==1))" & F(G!"(p1147==0)" | G!"((p538==0)||(p550==0))")
Detected timeout of ITS tools.
[2023-03-19 06:52:05] [INFO ] Flatten gal took : 94 ms
[2023-03-19 06:52:05] [INFO ] Applying decomposition
[2023-03-19 06:52:05] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10372429326394580057.txt' '-o' '/tmp/graph10372429326394580057.bin' '-w' '/tmp/graph10372429326394580057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10372429326394580057.bin' '-l' '-1' '-v' '-w' '/tmp/graph10372429326394580057.weights' '-q' '0' '-e' '0.001'
[2023-03-19 06:52:05] [INFO ] Decomposing Gal with order
[2023-03-19 06:52:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 06:52:05] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 06:52:05] [INFO ] Flatten gal took : 83 ms
[2023-03-19 06:52:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 89 ms.
[2023-03-19 06:52:06] [INFO ] Time to serialize gal into /tmp/LTL9404103608801515993.gal : 23 ms
[2023-03-19 06:52:06] [INFO ] Time to serialize properties into /tmp/LTL13733961667043909947.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9404103608801515993.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13733961667043909947.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((i33.i1.u369.p1039==1)&&(i33.i1.u374.p1054==1))"))||(G((F("(i36.i3.u407.p1147==0)"))&&(F("((i17.i2.u191.p538==0)||(i17.i2.u195...172
Formula 0 simplified : F!"((i33.i1.u369.p1039==1)&&(i33.i1.u374.p1054==1))" & F(G!"(i36.i3.u407.p1147==0)" | G!"((i17.i2.u191.p538==0)||(i17.i2.u195.p550==...160
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4597091867633661207
[2023-03-19 06:52:21] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4597091867633661207
Running compilation step : cd /tmp/ltsmin4597091867633661207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2814 ms.
Running link step : cd /tmp/ltsmin4597091867633661207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin4597091867633661207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||[]((<>((LTLAPp1==true))&&<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-08 finished in 88647 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(G((p0 U p1))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 136 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
[2023-03-19 06:52:36] [INFO ] Invariant cache hit.
[2023-03-19 06:52:37] [INFO ] Implicit Places using invariants in 849 ms returned []
[2023-03-19 06:52:37] [INFO ] Invariant cache hit.
[2023-03-19 06:52:39] [INFO ] Implicit Places using invariants and state equation in 2134 ms returned []
Implicit Place search using SMT with State Equation took 3002 ms to find 0 implicit places.
[2023-03-19 06:52:39] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-19 06:52:39] [INFO ] Invariant cache hit.
[2023-03-19 06:52:40] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3992 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s337 1), p0:(AND (EQ s1307 1) (EQ s1326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3427 steps with 0 reset in 70 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-09 finished in 4199 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(p1)&&p0) U X(G(p2))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 59 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:52:40] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-19 06:52:41] [INFO ] Implicit Places using invariants in 907 ms returned []
[2023-03-19 06:52:41] [INFO ] Invariant cache hit.
[2023-03-19 06:52:43] [INFO ] Implicit Places using invariants and state equation in 2020 ms returned []
Implicit Place search using SMT with State Equation took 2930 ms to find 0 implicit places.
[2023-03-19 06:52:43] [INFO ] Invariant cache hit.
[2023-03-19 06:52:44] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3862 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s229 1) (EQ s231 1)), p0:(AND (EQ s229 1) (EQ s231 1)), p1:(AND (EQ s1069 1) (EQ s1111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-10 finished in 4034 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(G((p0||F(p1))))||G(p2)))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 131 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-19 06:52:44] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-19 06:52:45] [INFO ] Implicit Places using invariants in 878 ms returned []
[2023-03-19 06:52:45] [INFO ] Invariant cache hit.
[2023-03-19 06:52:47] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 3056 ms to find 0 implicit places.
[2023-03-19 06:52:47] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-19 06:52:47] [INFO ] Invariant cache hit.
[2023-03-19 06:52:48] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4207 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1245 1) (EQ s1264 1)), p0:(EQ s1386 1), p1:(AND (EQ s128 1) (EQ s149 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 36 reset in 1127 ms.
Product exploration explored 100000 steps with 35 reset in 1274 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 516 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 514 steps, including 0 resets, run visited all 2 properties in 33 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 682 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 06:52:52] [INFO ] Invariant cache hit.
[2023-03-19 06:52:54] [INFO ] [Real]Absence check using 551 positive place invariants in 624 ms returned sat
[2023-03-19 06:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:53:00] [INFO ] [Real]Absence check using state equation in 6215 ms returned sat
[2023-03-19 06:53:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:53:02] [INFO ] [Nat]Absence check using 551 positive place invariants in 348 ms returned sat
[2023-03-19 06:53:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:53:07] [INFO ] [Nat]Absence check using state equation in 4916 ms returned sat
[2023-03-19 06:53:07] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 96 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-19 06:53:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 1551 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 49 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 06:53:16] [INFO ] Invariant cache hit.
[2023-03-19 06:53:17] [INFO ] Implicit Places using invariants in 852 ms returned []
[2023-03-19 06:53:17] [INFO ] Invariant cache hit.
[2023-03-19 06:53:19] [INFO ] Implicit Places using invariants and state equation in 2118 ms returned []
Implicit Place search using SMT with State Equation took 2987 ms to find 0 implicit places.
[2023-03-19 06:53:19] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-19 06:53:19] [INFO ] Invariant cache hit.
[2023-03-19 06:53:20] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3902 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 482 steps, including 0 resets, run visited all 2 properties in 18 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 449 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 06:53:21] [INFO ] Invariant cache hit.
[2023-03-19 06:53:22] [INFO ] [Real]Absence check using 551 positive place invariants in 481 ms returned sat
[2023-03-19 06:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 06:53:29] [INFO ] [Real]Absence check using state equation in 6288 ms returned sat
[2023-03-19 06:53:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 06:53:31] [INFO ] [Nat]Absence check using 551 positive place invariants in 369 ms returned sat
[2023-03-19 06:53:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 06:53:35] [INFO ] [Nat]Absence check using state equation in 4847 ms returned sat
[2023-03-19 06:53:36] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 87 ms.
[2023-03-19 06:53:44] [INFO ] Added : 250 causal constraints over 50 iterations in 8347 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 35 reset in 1055 ms.
Product exploration explored 100000 steps with 36 reset in 1188 ms.
Built C files in :
/tmp/ltsmin18099279352715409804
[2023-03-19 06:53:46] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2023-03-19 06:53:46] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:53:46] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2023-03-19 06:53:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:53:47] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2023-03-19 06:53:47] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:53:47] [INFO ] Built C files in 307ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18099279352715409804
Running compilation step : cd /tmp/ltsmin18099279352715409804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18099279352715409804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18099279352715409804;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 80 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 06:53:50] [INFO ] Invariant cache hit.
[2023-03-19 06:53:51] [INFO ] Implicit Places using invariants in 941 ms returned []
[2023-03-19 06:53:51] [INFO ] Invariant cache hit.
[2023-03-19 06:53:53] [INFO ] Implicit Places using invariants and state equation in 2409 ms returned []
Implicit Place search using SMT with State Equation took 3352 ms to find 0 implicit places.
[2023-03-19 06:53:53] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-19 06:53:53] [INFO ] Invariant cache hit.
[2023-03-19 06:53:54] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4326 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin10808565789345322292
[2023-03-19 06:53:54] [INFO ] Computing symmetric may disable matrix : 1301 transitions.
[2023-03-19 06:53:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:53:54] [INFO ] Computing symmetric may enable matrix : 1301 transitions.
[2023-03-19 06:53:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:53:54] [INFO ] Computing Do-Not-Accords matrix : 1301 transitions.
[2023-03-19 06:53:54] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:53:54] [INFO ] Built C files in 258ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10808565789345322292
Running compilation step : cd /tmp/ltsmin10808565789345322292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10808565789345322292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10808565789345322292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 06:53:57] [INFO ] Flatten gal took : 71 ms
[2023-03-19 06:53:57] [INFO ] Flatten gal took : 50 ms
[2023-03-19 06:53:57] [INFO ] Time to serialize gal into /tmp/LTL2645319993108466768.gal : 6 ms
[2023-03-19 06:53:57] [INFO ] Time to serialize properties into /tmp/LTL3016190050174353532.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2645319993108466768.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15604358156726487675.hoa' '-atoms' '/tmp/LTL3016190050174353532.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3016190050174353532.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15604358156726487675.hoa
Detected timeout of ITS tools.
[2023-03-19 06:54:13] [INFO ] Flatten gal took : 47 ms
[2023-03-19 06:54:13] [INFO ] Flatten gal took : 47 ms
[2023-03-19 06:54:13] [INFO ] Time to serialize gal into /tmp/LTL5206496067130025107.gal : 7 ms
[2023-03-19 06:54:13] [INFO ] Time to serialize properties into /tmp/LTL9775596456096649733.ltl : 194 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5206496067130025107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9775596456096649733.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(G(("(p1386==1)")||(F("((p128==1)&&(p149==1))")))))||(G("((p1245==1)&&(p1264==1))"))))
Formula 0 simplified : F!"((p1245==1)&&(p1264==1))" & G(F!"(p1386==1)" & FG!"((p128==1)&&(p149==1))")
Detected timeout of ITS tools.
[2023-03-19 06:54:28] [INFO ] Flatten gal took : 48 ms
[2023-03-19 06:54:28] [INFO ] Applying decomposition
[2023-03-19 06:54:28] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6072139415654233472.txt' '-o' '/tmp/graph6072139415654233472.bin' '-w' '/tmp/graph6072139415654233472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6072139415654233472.bin' '-l' '-1' '-v' '-w' '/tmp/graph6072139415654233472.weights' '-q' '0' '-e' '0.001'
[2023-03-19 06:54:28] [INFO ] Decomposing Gal with order
[2023-03-19 06:54:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 06:54:28] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 06:54:28] [INFO ] Flatten gal took : 94 ms
[2023-03-19 06:54:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 37 ms.
[2023-03-19 06:54:28] [INFO ] Time to serialize gal into /tmp/LTL9721379931421917026.gal : 16 ms
[2023-03-19 06:54:29] [INFO ] Time to serialize properties into /tmp/LTL4933975051173840549.ltl : 959 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9721379931421917026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4933975051173840549.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F(G(("(i44.i2.u492.p1386==1)")||(F("((i4.i1.u45.p128==1)&&(i4.i1.u53.p149==1))")))))||(G("((i40.i2.u442.p1245==1)&&(i40.i0.u449.p1...168
Formula 0 simplified : F!"((i40.i2.u442.p1245==1)&&(i40.i0.u449.p1264==1))" & G(F!"(i44.i2.u492.p1386==1)" & FG!"((i4.i1.u45.p128==1)&&(i4.i1.u53.p149==1))...157
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14990947556629386883
[2023-03-19 06:54:44] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14990947556629386883
Running compilation step : cd /tmp/ltsmin14990947556629386883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2370 ms.
Running link step : cd /tmp/ltsmin14990947556629386883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin14990947556629386883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([](((LTLAPp0==true)||<>((LTLAPp1==true)))))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-11 finished in 135604 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 X(X((p1||F(G(!p2)))))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 60 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:55:00] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-19 06:55:01] [INFO ] Implicit Places using invariants in 993 ms returned []
[2023-03-19 06:55:01] [INFO ] Invariant cache hit.
[2023-03-19 06:55:03] [INFO ] Implicit Places using invariants and state equation in 2183 ms returned []
Implicit Place search using SMT with State Equation took 3178 ms to find 0 implicit places.
[2023-03-19 06:55:03] [INFO ] Invariant cache hit.
[2023-03-19 06:55:04] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4112 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 465 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s1302 1), p1:(AND (EQ s1339 1) (EQ s1355 1)), p2:(AND (EQ s454 1) (EQ s475 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29 reset in 1139 ms.
Product exploration explored 100000 steps with 29 reset in 1348 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 365 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Finished random walk after 2238 steps, including 0 resets, run visited all 6 properties in 103 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 523 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 42 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 06:55:09] [INFO ] Invariant cache hit.
[2023-03-19 06:55:09] [INFO ] Implicit Places using invariants in 839 ms returned []
[2023-03-19 06:55:09] [INFO ] Invariant cache hit.
[2023-03-19 06:55:12] [INFO ] Implicit Places using invariants and state equation in 2301 ms returned []
Implicit Place search using SMT with State Equation took 3154 ms to find 0 implicit places.
[2023-03-19 06:55:12] [INFO ] Invariant cache hit.
[2023-03-19 06:55:13] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4193 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Finished random walk after 2331 steps, including 0 resets, run visited all 6 properties in 67 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 395 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Product exploration explored 100000 steps with 29 reset in 1111 ms.
Product exploration explored 100000 steps with 29 reset in 1365 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 124 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 06:55:18] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:55:18] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-19 06:55:19] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1226 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin14071059622475619520
[2023-03-19 06:55:19] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14071059622475619520
Running compilation step : cd /tmp/ltsmin14071059622475619520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2544 ms.
Running link step : cd /tmp/ltsmin14071059622475619520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14071059622475619520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3697885739593823507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 48 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:55:34] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-19 06:55:35] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2023-03-19 06:55:35] [INFO ] Invariant cache hit.
[2023-03-19 06:55:37] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 3163 ms to find 0 implicit places.
[2023-03-19 06:55:37] [INFO ] Invariant cache hit.
[2023-03-19 06:55:38] [INFO ] Dead Transitions using invariants and state equation in 1001 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4226 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin12058458444116943753
[2023-03-19 06:55:38] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12058458444116943753
Running compilation step : cd /tmp/ltsmin12058458444116943753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2402 ms.
Running link step : cd /tmp/ltsmin12058458444116943753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin12058458444116943753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5307355747174853181.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 06:55:53] [INFO ] Flatten gal took : 48 ms
[2023-03-19 06:55:53] [INFO ] Flatten gal took : 48 ms
[2023-03-19 06:55:53] [INFO ] Time to serialize gal into /tmp/LTL12475097634326295053.gal : 6 ms
[2023-03-19 06:55:53] [INFO ] Time to serialize properties into /tmp/LTL10024366258446668594.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12475097634326295053.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14639701155002199758.hoa' '-atoms' '/tmp/LTL10024366258446668594.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10024366258446668594.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14639701155002199758.hoa
Detected timeout of ITS tools.
[2023-03-19 06:56:09] [INFO ] Flatten gal took : 47 ms
[2023-03-19 06:56:09] [INFO ] Flatten gal took : 47 ms
[2023-03-19 06:56:09] [INFO ] Time to serialize gal into /tmp/LTL7930349148758982551.gal : 7 ms
[2023-03-19 06:56:09] [INFO ] Time to serialize properties into /tmp/LTL2455791717690614692.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7930349148758982551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2455791717690614692.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("(p1302==0)"))U(X(X((F(G(!("((p454==1)&&(p475==1))"))))||("((p1339==1)&&(p1355==1))"))))))
Formula 0 simplified : F!"(p1302==0)" R XX(!"((p1339==1)&&(p1355==1))" & GF"((p454==1)&&(p475==1))")
Detected timeout of ITS tools.
[2023-03-19 06:56:24] [INFO ] Flatten gal took : 48 ms
[2023-03-19 06:56:24] [INFO ] Applying decomposition
[2023-03-19 06:56:24] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14898022346532477713.txt' '-o' '/tmp/graph14898022346532477713.bin' '-w' '/tmp/graph14898022346532477713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14898022346532477713.bin' '-l' '-1' '-v' '-w' '/tmp/graph14898022346532477713.weights' '-q' '0' '-e' '0.001'
[2023-03-19 06:56:24] [INFO ] Decomposing Gal with order
[2023-03-19 06:56:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 06:56:24] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 06:56:24] [INFO ] Flatten gal took : 77 ms
[2023-03-19 06:56:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 606 labels/synchronizations in 61 ms.
[2023-03-19 06:56:24] [INFO ] Time to serialize gal into /tmp/LTL1913019207464002201.gal : 13 ms
[2023-03-19 06:56:24] [INFO ] Time to serialize properties into /tmp/LTL10938780919433764532.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1913019207464002201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10938780919433764532.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("(i41.u462.p1302==0)"))U(X(X((F(G(!("((i14.u162.p454==1)&&(i15.u169.p475==1))"))))||("((i43.u475.p1339==1)&&(i43.u481.p1355==1))...162
Formula 0 simplified : F!"(i41.u462.p1302==0)" R XX(!"((i43.u475.p1339==1)&&(i43.u481.p1355==1))" & GF"((i14.u162.p454==1)&&(i15.u169.p475==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11097969531092351380
[2023-03-19 06:56:39] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11097969531092351380
Running compilation step : cd /tmp/ltsmin11097969531092351380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2406 ms.
Running link step : cd /tmp/ltsmin11097969531092351380;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin11097969531092351380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U X(X((<>([](!(LTLAPp1==true)))||(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-12 finished in 114743 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||X(X(p1))))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 60 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 06:56:54] [INFO ] Invariant cache hit.
[2023-03-19 06:56:55] [INFO ] Implicit Places using invariants in 859 ms returned []
[2023-03-19 06:56:55] [INFO ] Invariant cache hit.
[2023-03-19 06:56:57] [INFO ] Implicit Places using invariants and state equation in 2140 ms returned []
Implicit Place search using SMT with State Equation took 3005 ms to find 0 implicit places.
[2023-03-19 06:56:57] [INFO ] Invariant cache hit.
[2023-03-19 06:56:58] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4066 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s465 1), p1:(OR (EQ s449 0) (EQ s491 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20047 reset in 1868 ms.
Product exploration explored 100000 steps with 20062 reset in 2038 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 2467 steps, including 0 resets, run visited all 2 properties in 66 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 2512 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 60 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 06:57:06] [INFO ] Invariant cache hit.
[2023-03-19 06:57:08] [INFO ] Implicit Places using invariants in 1145 ms returned []
[2023-03-19 06:57:08] [INFO ] Invariant cache hit.
[2023-03-19 06:57:10] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 3311 ms to find 0 implicit places.
[2023-03-19 06:57:10] [INFO ] Invariant cache hit.
[2023-03-19 06:57:11] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4306 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 2307 steps, including 0 resets, run visited all 2 properties in 85 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 292 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1615 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 658 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 20017 reset in 1934 ms.
Product exploration explored 100000 steps with 20000 reset in 1962 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 6 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 121 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 06:57:18] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:57:18] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-19 06:57:19] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1039 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin498680625433073748
[2023-03-19 06:57:19] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin498680625433073748
Running compilation step : cd /tmp/ltsmin498680625433073748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2373 ms.
Running link step : cd /tmp/ltsmin498680625433073748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin498680625433073748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8427973734985037660.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 37 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 06:57:34] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-19 06:57:35] [INFO ] Implicit Places using invariants in 934 ms returned []
[2023-03-19 06:57:35] [INFO ] Invariant cache hit.
[2023-03-19 06:57:37] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 2966 ms to find 0 implicit places.
[2023-03-19 06:57:37] [INFO ] Invariant cache hit.
[2023-03-19 06:57:38] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3884 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin12754021448975003345
[2023-03-19 06:57:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12754021448975003345
Running compilation step : cd /tmp/ltsmin12754021448975003345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2423 ms.
Running link step : cd /tmp/ltsmin12754021448975003345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin12754021448975003345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17606618114627829953.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 06:57:53] [INFO ] Flatten gal took : 50 ms
[2023-03-19 06:57:54] [INFO ] Flatten gal took : 97 ms
[2023-03-19 06:57:54] [INFO ] Time to serialize gal into /tmp/LTL14507167553714698356.gal : 272 ms
[2023-03-19 06:57:54] [INFO ] Time to serialize properties into /tmp/LTL15919694508594831756.prop : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14507167553714698356.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2749935027509883944.hoa' '-atoms' '/tmp/LTL15919694508594831756.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15919694508594831756.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2749935027509883944.hoa
Detected timeout of ITS tools.
[2023-03-19 06:58:09] [INFO ] Flatten gal took : 56 ms
[2023-03-19 06:58:09] [INFO ] Flatten gal took : 47 ms
[2023-03-19 06:58:09] [INFO ] Time to serialize gal into /tmp/LTL11006442558401843644.gal : 5 ms
[2023-03-19 06:58:09] [INFO ] Time to serialize properties into /tmp/LTL12682909862330098520.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11006442558401843644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12682909862330098520.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p465==1)")||(X(X("((p449==0)||(p491==0))")))))))
Formula 0 simplified : XF(!"(p465==1)" & XX!"((p449==0)||(p491==0))")
Detected timeout of ITS tools.
[2023-03-19 06:58:24] [INFO ] Flatten gal took : 87 ms
[2023-03-19 06:58:24] [INFO ] Applying decomposition
[2023-03-19 06:58:24] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5383871653101311259.txt' '-o' '/tmp/graph5383871653101311259.bin' '-w' '/tmp/graph5383871653101311259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5383871653101311259.bin' '-l' '-1' '-v' '-w' '/tmp/graph5383871653101311259.weights' '-q' '0' '-e' '0.001'
[2023-03-19 06:58:24] [INFO ] Decomposing Gal with order
[2023-03-19 06:58:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 06:58:24] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 06:58:24] [INFO ] Flatten gal took : 59 ms
[2023-03-19 06:58:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 604 labels/synchronizations in 63 ms.
[2023-03-19 06:58:25] [INFO ] Time to serialize gal into /tmp/LTL1820097303316924734.gal : 12 ms
[2023-03-19 06:58:25] [INFO ] Time to serialize properties into /tmp/LTL16294688229305898381.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1820097303316924734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16294688229305898381.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i14.i0.u165.p465==1)")||(X(X("((i14.i3.u161.p449==0)||(i15.i2.u175.p491==0))")))))))
Formula 0 simplified : XF(!"(i14.i0.u165.p465==1)" & XX!"((i14.i3.u161.p449==0)||(i15.i2.u175.p491==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11724591705573773620
[2023-03-19 06:58:40] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11724591705573773620
Running compilation step : cd /tmp/ltsmin11724591705573773620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2377 ms.
Running link step : cd /tmp/ltsmin11724591705573773620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin11724591705573773620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((LTLAPp0==true)||X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-15 finished in 120348 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((G(p1)||p0)))'
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)||G((F(p1)&&F(p2)))))'
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(G((p0||F(p1))))||G(p2)))'
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 X(X((p1||F(G(!p2)))))))'
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||X(X(p1))))))'
[2023-03-19 06:58:56] [INFO ] Flatten gal took : 90 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1496386229786138517
[2023-03-19 06:58:56] [INFO ] Computing symmetric may disable matrix : 1303 transitions.
[2023-03-19 06:58:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:58:56] [INFO ] Computing symmetric may enable matrix : 1303 transitions.
[2023-03-19 06:58:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:58:56] [INFO ] Applying decomposition
[2023-03-19 06:58:56] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11110033205716275604.txt' '-o' '/tmp/graph11110033205716275604.bin' '-w' '/tmp/graph11110033205716275604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11110033205716275604.bin' '-l' '-1' '-v' '-w' '/tmp/graph11110033205716275604.weights' '-q' '0' '-e' '0.001'
[2023-03-19 06:58:56] [INFO ] Decomposing Gal with order
[2023-03-19 06:58:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 06:58:56] [INFO ] Computing Do-Not-Accords matrix : 1303 transitions.
[2023-03-19 06:58:56] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 06:58:56] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 06:58:56] [INFO ] Built C files in 274ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1496386229786138517
Running compilation step : cd /tmp/ltsmin1496386229786138517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 06:58:56] [INFO ] Flatten gal took : 60 ms
[2023-03-19 06:58:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 604 labels/synchronizations in 47 ms.
[2023-03-19 06:58:56] [INFO ] Time to serialize gal into /tmp/LTLFireability8263203213259755089.gal : 15 ms
[2023-03-19 06:58:56] [INFO ] Time to serialize properties into /tmp/LTLFireability11040555081097905599.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8263203213259755089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11040555081097905599.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 5 LTL properties
Checking formula 0 : !((F(("(((i48.i3.u529.p1492==1)&&(i48.i3.u537.p1513==1))||(((i26.i1.u290.p818==1)&&(i26.i3.u291.p820==1))&&(i19.i1.u217.p611==0)))")||...257
Formula 0 simplified : G(!"(((i48.i3.u529.p1492==1)&&(i48.i3.u537.p1513==1))||(((i26.i1.u290.p818==1)&&(i26.i3.u291.p820==1))&&(i19.i1.u217.p611==0)))" & F...251
Compilation finished in 4944 ms.
Running link step : cd /tmp/ltsmin1496386229786138517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin1496386229786138517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin1496386229786138517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1496386229786138517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp2==true))||[]((<>((LTLAPp3==true))&&<>((LTLAPp4==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin1496386229786138517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp2==true))||[]((<>((LTLAPp3==true))&&<>((LTLAPp4==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1496386229786138517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([](((LTLAPp5==true)||<>((LTLAPp6==true)))))||[]((LTLAPp7==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 07:23:19] [INFO ] Applying decomposition
[2023-03-19 07:23:19] [INFO ] Flatten gal took : 156 ms
[2023-03-19 07:23:19] [INFO ] Decomposing Gal with order
[2023-03-19 07:23:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:23:19] [INFO ] Removed a total of 450 redundant transitions.
[2023-03-19 07:23:19] [INFO ] Flatten gal took : 139 ms
[2023-03-19 07:23:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 133 ms.
[2023-03-19 07:23:20] [INFO ] Time to serialize gal into /tmp/LTLFireability11516454714650651299.gal : 29 ms
[2023-03-19 07:23:20] [INFO ] Time to serialize properties into /tmp/LTLFireability14754372286354903963.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11516454714650651299.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14754372286354903963.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 5 LTL properties
Checking formula 0 : !((F(("(((u674.p1492==1)&&(u685.p1513==1))||(((i211.u371.p818==1)&&(i211.u372.p820==1))&&(u278.p611==0)))")||(G("(((i211.u371.p818==0)...222
Formula 0 simplified : G(!"(((u674.p1492==1)&&(u685.p1513==1))||(((i211.u371.p818==1)&&(i211.u372.p820==1))&&(u278.p611==0)))" & F!"(((i211.u371.p818==0)||...216
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin1496386229786138517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([](((LTLAPp5==true)||<>((LTLAPp6==true)))))||[]((LTLAPp7==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1496386229786138517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp8==true)) U X(X(((LTLAPp9==true)||<>([](!(LTLAPp10==true)))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 163212 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16132124 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-050A, 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 r389-oct2-167903713600500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050A.tgz
mv ShieldPPPs-PT-050A 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 ;