Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900000315.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DES-PT-50b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 127K Mar 24 05:37 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 DES-PT-50b-CTLCardinality-00
FORMULA_NAME DES-PT-50b-CTLCardinality-01
FORMULA_NAME DES-PT-50b-CTLCardinality-02
FORMULA_NAME DES-PT-50b-CTLCardinality-03
FORMULA_NAME DES-PT-50b-CTLCardinality-04
FORMULA_NAME DES-PT-50b-CTLCardinality-05
FORMULA_NAME DES-PT-50b-CTLCardinality-06
FORMULA_NAME DES-PT-50b-CTLCardinality-07
FORMULA_NAME DES-PT-50b-CTLCardinality-08
FORMULA_NAME DES-PT-50b-CTLCardinality-09
FORMULA_NAME DES-PT-50b-CTLCardinality-10
FORMULA_NAME DES-PT-50b-CTLCardinality-11
FORMULA_NAME DES-PT-50b-CTLCardinality-12
FORMULA_NAME DES-PT-50b-CTLCardinality-13
FORMULA_NAME DES-PT-50b-CTLCardinality-14
FORMULA_NAME DES-PT-50b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591197925154

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:25:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 15:25:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:25:28] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2020-06-03 15:25:28] [INFO ] Transformed 479 places.
[2020-06-03 15:25:28] [INFO ] Transformed 430 transitions.
[2020-06-03 15:25:28] [INFO ] Found NUPN structural information;
[2020-06-03 15:25:28] [INFO ] Parsed PT model containing 479 places and 430 transitions in 246 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 74 ms.
Incomplete random walk after 100000 steps, including 831 resets, run finished after 677 ms. (steps per millisecond=147 ) properties seen :[1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 430 rows 479 cols
[2020-06-03 15:25:29] [INFO ] Computed 65 place invariants in 93 ms
[2020-06-03 15:25:29] [INFO ] [Real]Absence check using 40 positive place invariants in 73 ms returned sat
[2020-06-03 15:25:29] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 15:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:31] [INFO ] [Real]Absence check using state equation in 1308 ms returned sat
[2020-06-03 15:25:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:25:31] [INFO ] [Nat]Absence check using 40 positive place invariants in 222 ms returned sat
[2020-06-03 15:25:31] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 138 ms returned sat
[2020-06-03 15:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:34] [INFO ] [Nat]Absence check using state equation in 2205 ms returned sat
[2020-06-03 15:25:34] [INFO ] Deduced a trap composed of 43 places in 347 ms
[2020-06-03 15:25:34] [INFO ] Deduced a trap composed of 36 places in 269 ms
[2020-06-03 15:25:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 817 ms
[2020-06-03 15:25:34] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 47 ms.
[2020-06-03 15:25:41] [INFO ] Added : 374 causal constraints over 76 iterations in 6501 ms. Result :sat
[2020-06-03 15:25:41] [INFO ] Deduced a trap composed of 33 places in 260 ms
[2020-06-03 15:25:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2020-06-03 15:25:42] [INFO ] [Real]Absence check using 40 positive place invariants in 58 ms returned sat
[2020-06-03 15:25:42] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 50 ms returned sat
[2020-06-03 15:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:43] [INFO ] [Real]Absence check using state equation in 1328 ms returned sat
[2020-06-03 15:25:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:25:43] [INFO ] [Nat]Absence check using 40 positive place invariants in 87 ms returned sat
[2020-06-03 15:25:43] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 89 ms returned sat
[2020-06-03 15:25:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:45] [INFO ] [Nat]Absence check using state equation in 1431 ms returned sat
[2020-06-03 15:25:45] [INFO ] Deduced a trap composed of 8 places in 370 ms
[2020-06-03 15:25:46] [INFO ] Deduced a trap composed of 12 places in 389 ms
[2020-06-03 15:25:46] [INFO ] Deduced a trap composed of 30 places in 363 ms
[2020-06-03 15:25:46] [INFO ] Deduced a trap composed of 25 places in 310 ms
[2020-06-03 15:25:47] [INFO ] Deduced a trap composed of 25 places in 490 ms
[2020-06-03 15:25:47] [INFO ] Deduced a trap composed of 23 places in 315 ms
[2020-06-03 15:25:48] [INFO ] Deduced a trap composed of 32 places in 276 ms
[2020-06-03 15:25:48] [INFO ] Deduced a trap composed of 40 places in 325 ms
[2020-06-03 15:25:48] [INFO ] Deduced a trap composed of 34 places in 293 ms
[2020-06-03 15:25:49] [INFO ] Deduced a trap composed of 23 places in 234 ms
[2020-06-03 15:25:49] [INFO ] Deduced a trap composed of 29 places in 238 ms
[2020-06-03 15:25:49] [INFO ] Deduced a trap composed of 35 places in 226 ms
[2020-06-03 15:25:49] [INFO ] Deduced a trap composed of 43 places in 227 ms
[2020-06-03 15:25:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4776 ms
[2020-06-03 15:25:49] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 49 ms.
[2020-06-03 15:25:54] [INFO ] Added : 271 causal constraints over 55 iterations in 4807 ms. Result :sat
[2020-06-03 15:25:55] [INFO ] Deduced a trap composed of 56 places in 266 ms
[2020-06-03 15:25:55] [INFO ] Deduced a trap composed of 34 places in 307 ms
[2020-06-03 15:25:55] [INFO ] Deduced a trap composed of 40 places in 379 ms
[2020-06-03 15:25:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1310 ms
[2020-06-03 15:25:56] [INFO ] [Real]Absence check using 40 positive place invariants in 49 ms returned sat
[2020-06-03 15:25:56] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 15:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:57] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2020-06-03 15:25:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:25:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 76 ms returned sat
[2020-06-03 15:25:57] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 108 ms returned sat
[2020-06-03 15:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:25:59] [INFO ] [Nat]Absence check using state equation in 1590 ms returned sat
[2020-06-03 15:25:59] [INFO ] Deduced a trap composed of 37 places in 326 ms
[2020-06-03 15:25:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2020-06-03 15:25:59] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 71 ms.
[2020-06-03 15:26:06] [INFO ] Added : 331 causal constraints over 67 iterations in 6324 ms. Result :sat
[2020-06-03 15:26:06] [INFO ] [Real]Absence check using 40 positive place invariants in 54 ms returned sat
[2020-06-03 15:26:06] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 62 ms returned sat
[2020-06-03 15:26:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:08] [INFO ] [Real]Absence check using state equation in 2287 ms returned sat
[2020-06-03 15:26:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:26:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 85 ms returned sat
[2020-06-03 15:26:09] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 95 ms returned sat
[2020-06-03 15:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:11] [INFO ] [Nat]Absence check using state equation in 1801 ms returned sat
[2020-06-03 15:26:11] [INFO ] Deduced a trap composed of 48 places in 756 ms
[2020-06-03 15:26:12] [INFO ] Deduced a trap composed of 18 places in 236 ms
[2020-06-03 15:26:12] [INFO ] Deduced a trap composed of 49 places in 221 ms
[2020-06-03 15:26:12] [INFO ] Deduced a trap composed of 20 places in 300 ms
[2020-06-03 15:26:13] [INFO ] Deduced a trap composed of 51 places in 244 ms
[2020-06-03 15:26:13] [INFO ] Deduced a trap composed of 34 places in 185 ms
[2020-06-03 15:26:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2326 ms
[2020-06-03 15:26:13] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 42 ms.
[2020-06-03 15:26:22] [INFO ] Added : 308 causal constraints over 70 iterations in 9036 ms. Result :sat
[2020-06-03 15:26:23] [INFO ] Deduced a trap composed of 42 places in 796 ms
[2020-06-03 15:26:23] [INFO ] Deduced a trap composed of 28 places in 439 ms
[2020-06-03 15:26:24] [INFO ] Deduced a trap composed of 36 places in 320 ms
[2020-06-03 15:26:24] [INFO ] Deduced a trap composed of 31 places in 313 ms
[2020-06-03 15:26:25] [INFO ] Deduced a trap composed of 55 places in 563 ms
[2020-06-03 15:26:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3092 ms
[2020-06-03 15:26:25] [INFO ] [Real]Absence check using 40 positive place invariants in 163 ms returned sat
[2020-06-03 15:26:26] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 151 ms returned sat
[2020-06-03 15:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:28] [INFO ] [Real]Absence check using state equation in 2241 ms returned sat
[2020-06-03 15:26:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:26:28] [INFO ] [Nat]Absence check using 40 positive place invariants in 161 ms returned sat
[2020-06-03 15:26:28] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 86 ms returned sat
[2020-06-03 15:26:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:31] [INFO ] [Nat]Absence check using state equation in 2645 ms returned sat
[2020-06-03 15:26:31] [INFO ] Deduced a trap composed of 37 places in 338 ms
[2020-06-03 15:26:32] [INFO ] Deduced a trap composed of 15 places in 289 ms
[2020-06-03 15:26:32] [INFO ] Deduced a trap composed of 13 places in 209 ms
[2020-06-03 15:26:33] [INFO ] Deduced a trap composed of 18 places in 326 ms
[2020-06-03 15:26:33] [INFO ] Deduced a trap composed of 16 places in 290 ms
[2020-06-03 15:26:33] [INFO ] Deduced a trap composed of 13 places in 288 ms
[2020-06-03 15:26:34] [INFO ] Deduced a trap composed of 17 places in 379 ms
[2020-06-03 15:26:34] [INFO ] Deduced a trap composed of 15 places in 390 ms
[2020-06-03 15:26:35] [INFO ] Deduced a trap composed of 14 places in 339 ms
[2020-06-03 15:26:35] [INFO ] Deduced a trap composed of 32 places in 313 ms
[2020-06-03 15:26:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4125 ms
[2020-06-03 15:26:35] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 46 ms.
[2020-06-03 15:26:45] [INFO ] Added : 394 causal constraints over 80 iterations in 9581 ms. Result :sat
[2020-06-03 15:26:45] [INFO ] Deduced a trap composed of 25 places in 307 ms
[2020-06-03 15:26:45] [INFO ] Deduced a trap composed of 24 places in 276 ms
[2020-06-03 15:26:46] [INFO ] Deduced a trap composed of 34 places in 247 ms
[2020-06-03 15:26:46] [INFO ] Deduced a trap composed of 34 places in 255 ms
[2020-06-03 15:26:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1615 ms
[2020-06-03 15:26:47] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-06-03 15:26:47] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 15:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:49] [INFO ] [Real]Absence check using state equation in 2081 ms returned sat
[2020-06-03 15:26:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:26:49] [INFO ] [Nat]Absence check using 40 positive place invariants in 130 ms returned sat
[2020-06-03 15:26:49] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 129 ms returned sat
[2020-06-03 15:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:26:51] [INFO ] [Nat]Absence check using state equation in 1369 ms returned sat
[2020-06-03 15:26:52] [INFO ] Deduced a trap composed of 20 places in 823 ms
[2020-06-03 15:26:52] [INFO ] Deduced a trap composed of 44 places in 651 ms
[2020-06-03 15:26:53] [INFO ] Deduced a trap composed of 10 places in 348 ms
[2020-06-03 15:26:53] [INFO ] Deduced a trap composed of 29 places in 336 ms
[2020-06-03 15:26:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2476 ms
[2020-06-03 15:26:53] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 50 ms.
[2020-06-03 15:27:01] [INFO ] Added : 349 causal constraints over 71 iterations in 7286 ms. Result :sat
[2020-06-03 15:27:01] [INFO ] [Real]Absence check using 40 positive place invariants in 54 ms returned sat
[2020-06-03 15:27:01] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 50 ms returned sat
[2020-06-03 15:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:02] [INFO ] [Real]Absence check using state equation in 1556 ms returned sat
[2020-06-03 15:27:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:27:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 249 ms returned sat
[2020-06-03 15:27:03] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 165 ms returned sat
[2020-06-03 15:27:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:05] [INFO ] [Nat]Absence check using state equation in 1894 ms returned sat
[2020-06-03 15:27:06] [INFO ] Deduced a trap composed of 12 places in 651 ms
[2020-06-03 15:27:06] [INFO ] Deduced a trap composed of 8 places in 334 ms
[2020-06-03 15:27:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1135 ms
[2020-06-03 15:27:06] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 63 ms.
[2020-06-03 15:27:13] [INFO ] Added : 306 causal constraints over 62 iterations in 6216 ms. Result :sat
[2020-06-03 15:27:13] [INFO ] Deduced a trap composed of 43 places in 343 ms
[2020-06-03 15:27:13] [INFO ] Deduced a trap composed of 34 places in 274 ms
[2020-06-03 15:27:14] [INFO ] Deduced a trap composed of 64 places in 256 ms
[2020-06-03 15:27:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1396 ms
[2020-06-03 15:27:14] [INFO ] [Real]Absence check using 40 positive place invariants in 49 ms returned sat
[2020-06-03 15:27:14] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 15:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:15] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2020-06-03 15:27:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:27:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 256 ms returned sat
[2020-06-03 15:27:16] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 106 ms returned sat
[2020-06-03 15:27:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:18] [INFO ] [Nat]Absence check using state equation in 1545 ms returned sat
[2020-06-03 15:27:18] [INFO ] Deduced a trap composed of 12 places in 271 ms
[2020-06-03 15:27:18] [INFO ] Deduced a trap composed of 8 places in 218 ms
[2020-06-03 15:27:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 799 ms
[2020-06-03 15:27:18] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 43 ms.
[2020-06-03 15:27:25] [INFO ] Added : 328 causal constraints over 66 iterations in 6216 ms. Result :sat
[2020-06-03 15:27:25] [INFO ] Deduced a trap composed of 29 places in 316 ms
[2020-06-03 15:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 473 ms
[2020-06-03 15:27:25] [INFO ] [Real]Absence check using 40 positive place invariants in 202 ms returned sat
[2020-06-03 15:27:26] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 140 ms returned sat
[2020-06-03 15:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:27] [INFO ] [Real]Absence check using state equation in 1419 ms returned sat
[2020-06-03 15:27:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:27:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 173 ms returned sat
[2020-06-03 15:27:28] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 166 ms returned sat
[2020-06-03 15:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:29] [INFO ] [Nat]Absence check using state equation in 1489 ms returned sat
[2020-06-03 15:27:29] [INFO ] Deduced a trap composed of 20 places in 397 ms
[2020-06-03 15:27:30] [INFO ] Deduced a trap composed of 80 places in 216 ms
[2020-06-03 15:27:30] [INFO ] Deduced a trap composed of 81 places in 209 ms
[2020-06-03 15:27:30] [INFO ] Deduced a trap composed of 83 places in 211 ms
[2020-06-03 15:27:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1291 ms
[2020-06-03 15:27:30] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 152 ms.
[2020-06-03 15:27:38] [INFO ] Added : 383 causal constraints over 77 iterations in 7413 ms. Result :sat
[2020-06-03 15:27:38] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-06-03 15:27:38] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 64 ms returned sat
[2020-06-03 15:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:40] [INFO ] [Real]Absence check using state equation in 2402 ms returned sat
[2020-06-03 15:27:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:27:41] [INFO ] [Nat]Absence check using 40 positive place invariants in 111 ms returned sat
[2020-06-03 15:27:41] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 125 ms returned sat
[2020-06-03 15:27:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:43] [INFO ] [Nat]Absence check using state equation in 1957 ms returned sat
[2020-06-03 15:27:43] [INFO ] Deduced a trap composed of 20 places in 276 ms
[2020-06-03 15:27:43] [INFO ] Deduced a trap composed of 17 places in 239 ms
[2020-06-03 15:27:44] [INFO ] Deduced a trap composed of 24 places in 239 ms
[2020-06-03 15:27:44] [INFO ] Deduced a trap composed of 23 places in 167 ms
[2020-06-03 15:27:44] [INFO ] Deduced a trap composed of 19 places in 149 ms
[2020-06-03 15:27:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1366 ms
[2020-06-03 15:27:44] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 47 ms.
[2020-06-03 15:27:52] [INFO ] Added : 319 causal constraints over 67 iterations in 7524 ms. Result :sat
[2020-06-03 15:27:52] [INFO ] Deduced a trap composed of 35 places in 498 ms
[2020-06-03 15:27:53] [INFO ] Deduced a trap composed of 35 places in 303 ms
[2020-06-03 15:27:53] [INFO ] Deduced a trap composed of 32 places in 494 ms
[2020-06-03 15:27:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1765 ms
[2020-06-03 15:27:54] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2020-06-03 15:27:54] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 15:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:56] [INFO ] [Real]Absence check using state equation in 2074 ms returned sat
[2020-06-03 15:27:56] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 50 ms.
[2020-06-03 15:27:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:27:56] [INFO ] [Nat]Absence check using 40 positive place invariants in 224 ms returned sat
[2020-06-03 15:27:56] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 98 ms returned sat
[2020-06-03 15:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:27:58] [INFO ] [Nat]Absence check using state equation in 1635 ms returned sat
[2020-06-03 15:27:58] [INFO ] Deduced a trap composed of 18 places in 193 ms
[2020-06-03 15:27:59] [INFO ] Deduced a trap composed of 22 places in 367 ms
[2020-06-03 15:27:59] [INFO ] Deduced a trap composed of 20 places in 514 ms
[2020-06-03 15:27:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1306 ms
[2020-06-03 15:27:59] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 58 ms.
[2020-06-03 15:28:08] [INFO ] Added : 401 causal constraints over 81 iterations in 8571 ms. Result :sat
[2020-06-03 15:28:08] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 15:28:09] [INFO ] Flatten gal took : 191 ms
[2020-06-03 15:28:09] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 15:28:09] [INFO ] Flatten gal took : 74 ms
FORMULA DES-PT-50b-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 15:28:09] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 7 ms.
[2020-06-03 15:28:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DES-PT-50b @ 3570 seconds

FORMULA DES-PT-50b-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3549
rslt: Output for CTLCardinality @ DES-PT-50b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 15:28:09 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p281 <= 0) OR ((p46 <= 0)) OR ((1 <= p192)) OR (((1 <= p335)) AND ((p432 <= 0))))",
"processed_size": 86,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((((p302 <= 0)) OR ((1 <= p197)))))",
"processed_size": 41,
"rewrites": 16
},
"result":
{
"edges": 88,
"markings": 89,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 88,
"markings": 89,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p128))))",
"processed_size": 21,
"rewrites": 16
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p282)) AND ((p81 <= 0)))))",
"processed_size": 40,
"rewrites": 16
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p49 <= 0)) OR ((1 <= p95)))))",
"processed_size": 39,
"rewrites": 17
},
"result":
{
"edges": 898,
"markings": 899,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 887
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG(AF((((1 <= p146)) AND ((p121 <= 0)))))",
"processed_size": 41,
"rewrites": 17
},
"net":
{
"conflict_clusters": 192,
"singleton_clusters": 0
},
"result":
{
"edges": 85,
"markings": 85,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p332 <= 0)) OR ((1 <= p304)))",
"processed_size": 33,
"rewrites": 18
},
"result":
{
"edges": 84,
"markings": 85,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1774
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1774
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p23 <= 0)) OR ((1 <= p203)))",
"processed_size": 32,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3549
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p226 <= 0))))",
"processed_size": 21,
"rewrites": 17
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3549
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3549
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p151)) AND ((p76 <= 0)))",
"processed_size": 32,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((((p476 <= 0)) OR ((1 <= p438))) AND (((p465 <= 0)) OR ((1 <= p71))))))",
"processed_size": 80,
"rewrites": 17
},
"result":
{
"edges": 29,
"markings": 30,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p23 <= 0)) OR ((1 <= p203)))",
"processed_size": 32,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p226 <= 0))))",
"processed_size": 21,
"rewrites": 17
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p373 <= 0)) OR ((1 <= p178)))))",
"processed_size": 41,
"rewrites": 17
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 32416,
"runtime": 21.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(E(F(**)))) : (A(F(**)) AND (A(G(**)) AND (E(F(**)) OR A(F(**))))) : A(G(**)) : ((A(G(**)) AND **) OR (A(G(**)) AND E(F(**)))) : (E(X(**)) OR **) : (E(G(**)) OR E(X(**))) : E(F(DEADLOCK)) : E(G(A(F(*)))) : E(F(*)) : E(F(**))"
},
"net":
{
"arcs": 1463,
"conflict_clusters": 192,
"places": 479,
"places_significant": 414,
"singleton_clusters": 0,
"transitions": 430
},
"result":
{
"preliminary_value": "yes no no no yes yes yes no yes yes ",
"value": "yes no no no yes yes yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 909/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 479
lola: finding significant places
lola: 479 places, 430 transitions, 414 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p304 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p281 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p432 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p438 <= 1)
lola: LP says that atomic proposition is always true: (p398 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: E (G (E (F ((((p332 <= 0)) OR ((1 <= p304))))))) : ((A (F (((1 <= p281)))) AND A (G (((((p476 <= 0)) OR ((1 <= p438))) AND (((p465 <= 0)) OR ((1 <= p71))))))) AND (E (F ((((p160 <= 0)) OR ((1 <= p17))))) OR A (F ((((p151 <= 0)) OR ((1 <= p76))))))) : E (G (A (G ((((p49 <= 0)) OR ((1 <= p95))))))) : ((A (G ((((p373 <= 0)) OR ((1 <= p178))))) AND (((p23 <= 0)) OR ((1 <= p203)))) OR (A (G (((p226 <= 0)))) AND E (F (((((p157 <= 0)) OR ((1 <= p176))) AND (((p371 <= 0)) OR ((1 <= p228)))))))) : (E (X ((((p208 <= 0)) OR ((1 <= p404))))) OR (E (G ((0 <= 0))) AND ((p281 <= 0) OR ((p46 <= 0)) OR ((1 <= p192)) OR (((1 <= p335)) AND ((p432 <= 0)))))) : (E (G ((((p302 <= 0)) OR ((1 <= p197))))) OR E (X (((((1 <= p40)) AND ((p438 <= 0))) OR (((1 <= p408)) AND ((p398 <= 0))))))) : E (F (A (X ((1 <= 0))))) : E (G (NOT(E (G ((((p146 <= 0)) OR ((1 <= p121)))))))) : E (F (NOT(E (G ((((p282 <= 0)) OR ((1 <= p81)))))))) : E (F (((1 <= p128))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((p208 <= 0)) OR ((1 <= p404))))) OR ((p281 <= 0) OR ((p46 <= 0)) OR ((1 <= p192)) OR (((1 <= p335)) AND ((p432 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p281 <= 0) OR ((p46 <= 0)) OR ((1 <= p192)) OR (((1 <= p335)) AND ((p432 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p281 <= 0) OR ((p46 <= 0)) OR ((1 <= p192)) OR (((1 <= p335)) AND ((p432 <= 0))))
lola: processed formula length: 86
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p302 <= 0)) OR ((1 <= p197))))) OR E (X (((((1 <= p40)) AND ((p438 <= 0))) OR (((1 <= p408)) AND ((p398 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p302 <= 0)) OR ((1 <= p197)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p302 <= 0)) OR ((1 <= p197)))))
lola: processed formula length: 41
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p302)) AND ((p197 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 89 markings, 88 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The net has deadlock(s).
lola: 89 markings, 88 edges
lola: ========================================
lola: subprocess 3 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p128))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p128))))
lola: processed formula length: 21
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p128))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: subprocess 4 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p282)) AND ((p81 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p282)) AND ((p81 <= 0)))))
lola: processed formula length: 40
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: ========================================
lola: formula 0: (((1 <= p282)) AND ((p81 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p49 <= 0)) OR ((1 <= p95)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p49 <= 0)) OR ((1 <= p95)))))
lola: processed formula length: 39
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p49)) AND ((p95 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 899 markings, 898 edges
lola: ========================================
lola: subprocess 6 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((((1 <= p146)) AND ((p121 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((((1 <= p146)) AND ((p121 <= 0)))))
lola: processed formula length: 41
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 85 markings, 85 edges
lola: ========================================
lola: subprocess 7 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((p332 <= 0)) OR ((1 <= p304)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (((p332 <= 0)) OR ((1 <= p304)))
lola: processed formula length: 33
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p332)) AND ((p304 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 85 markings, 84 edges
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p332 <= 0)) OR ((1 <= p304)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((((p373 <= 0)) OR ((1 <= p178))))) AND (((p23 <= 0)) OR ((1 <= p203)))) OR (A (G (((p226 <= 0)))) AND E (F (((((p157 <= 0)) OR ((1 <= p176))) AND (((p371 <= 0)) OR ((1 <= p228))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p23 <= 0)) OR ((1 <= p203)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p23 <= 0)) OR ((1 <= p203)))
lola: processed formula length: 32
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 3549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p226 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p226 <= 0))))
lola: processed formula length: 21
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p226))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 9 will run for 3549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p281)))) AND (A (G (((((p476 <= 0)) OR ((1 <= p438))) AND (((p465 <= 0)) OR ((1 <= p71)))))) AND (E (F ((((p160 <= 0)) OR ((1 <= p17))))) OR A (F ((((p151 <= 0)) OR ((1 <= p76))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p151 <= 0)) OR ((1 <= p76)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p151)) AND ((p76 <= 0)))
lola: processed formula length: 32
lola: 18 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p151 <= 0)) OR ((1 <= p76)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p476 <= 0)) OR ((1 <= p438))) AND (((p465 <= 0)) OR ((1 <= p71))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((((p476 <= 0)) OR ((1 <= p438))) AND (((p465 <= 0)) OR ((1 <= p71))))))
lola: processed formula length: 80
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p476)) AND ((p438 <= 0))) OR (((1 <= p465)) AND ((p71 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (G ((((p373 <= 0)) OR ((1 <= p178))))) AND (((p23 <= 0)) OR ((1 <= p203)))) OR (A (G (((p226 <= 0)))) AND E (F (((((p157 <= 0)) OR ((1 <= p176))) AND (((p371 <= 0)) OR ((1 <= p228))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p23 <= 0)) OR ((1 <= p203)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p23 <= 0)) OR ((1 <= p203)))
lola: processed formula length: 32
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((p226 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p226 <= 0))))
lola: processed formula length: 21
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p226))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((p373 <= 0)) OR ((1 <= p178)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p373 <= 0)) OR ((1 <= p178)))))
lola: processed formula length: 41
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p373)) AND ((p178 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes yes no yes yes
lola:
preliminary result: yes no no no yes yes yes no yes yes
lola: memory consumption: 32416 KB
lola: time consumption: 21 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

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

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="DES-PT-50b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is DES-PT-50b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900000315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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