Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028200292.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CloudReconfiguration-PT-311, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028200292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 660K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748593124337

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-311
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 08:18:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 08:18:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 08:18:46] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2025-05-30 08:18:46] [INFO ] Transformed 2585 places.
[2025-05-30 08:18:46] [INFO ] Transformed 3095 transitions.
[2025-05-30 08:18:46] [INFO ] Found NUPN structural information;
[2025-05-30 08:18:46] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudReconfiguration-PT-311-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-311-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 518 places :
Symmetric choice reduction at 0 with 518 rule applications. Total rules 518 place count 2067 transition count 2577
Iterating global reduction 0 with 518 rules applied. Total rules applied 1036 place count 2067 transition count 2577
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1064 place count 2067 transition count 2549
Discarding 241 places :
Symmetric choice reduction at 1 with 241 rule applications. Total rules 1305 place count 1826 transition count 2308
Iterating global reduction 1 with 241 rules applied. Total rules applied 1546 place count 1826 transition count 2308
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 1637 place count 1735 transition count 2217
Iterating global reduction 1 with 91 rules applied. Total rules applied 1728 place count 1735 transition count 2217
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1746 place count 1735 transition count 2199
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1794 place count 1687 transition count 2151
Iterating global reduction 2 with 48 rules applied. Total rules applied 1842 place count 1687 transition count 2151
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1850 place count 1687 transition count 2143
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1889 place count 1648 transition count 2099
Iterating global reduction 3 with 39 rules applied. Total rules applied 1928 place count 1648 transition count 2099
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1956 place count 1620 transition count 2071
Iterating global reduction 3 with 28 rules applied. Total rules applied 1984 place count 1620 transition count 2071
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2010 place count 1594 transition count 2045
Iterating global reduction 3 with 26 rules applied. Total rules applied 2036 place count 1594 transition count 2045
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 2062 place count 1568 transition count 2019
Iterating global reduction 3 with 26 rules applied. Total rules applied 2088 place count 1568 transition count 2019
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 2110 place count 1546 transition count 1983
Iterating global reduction 3 with 22 rules applied. Total rules applied 2132 place count 1546 transition count 1983
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2139 place count 1539 transition count 1972
Iterating global reduction 3 with 7 rules applied. Total rules applied 2146 place count 1539 transition count 1972
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2152 place count 1533 transition count 1964
Iterating global reduction 3 with 6 rules applied. Total rules applied 2158 place count 1533 transition count 1964
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2160 place count 1533 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2162 place count 1531 transition count 1960
Iterating global reduction 4 with 2 rules applied. Total rules applied 2164 place count 1531 transition count 1960
Applied a total of 2164 rules in 1669 ms. Remains 1531 /2585 variables (removed 1054) and now considering 1960/3095 (removed 1135) transitions.
// Phase 1: matrix 1960 rows 1531 cols
[2025-05-30 08:18:48] [INFO ] Computed 4 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:18:49] [INFO ] Implicit Places using invariants in 462 ms returned []
[2025-05-30 08:18:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:18:57] [INFO ] Implicit Places using invariants and state equation in 7726 ms returned []
Implicit Place search using SMT with State Equation took 8229 ms to find 0 implicit places.
Running 1959 sub problems to find dead transitions.
[2025-05-30 08:18:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1530 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1530/3491 variables, and 4 constraints, problems are : Problem set: 0 solved, 1959 unsolved in 30070 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1531 constraints, PredecessorRefiner: 1959/1959 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1959 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1530 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1530/3491 variables, and 4 constraints, problems are : Problem set: 0 solved, 1959 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1531 constraints, PredecessorRefiner: 0/1959 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60713ms problems are : Problem set: 0 solved, 1959 unsolved
Search for dead transitions found 0 dead transitions in 60826ms
Starting structural reductions in LTL mode, iteration 1 : 1531/2585 places, 1960/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70756 ms. Remains : 1531/2585 places, 1960/3095 transitions.
Support contains 35 out of 1531 places after structural reductions.
[2025-05-30 08:19:58] [INFO ] Flatten gal took : 126 ms
[2025-05-30 08:19:58] [INFO ] Flatten gal took : 71 ms
[2025-05-30 08:19:58] [INFO ] Input system was already deterministic with 1960 transitions.
RANDOM walk for 40000 steps (415 resets) in 1447 ms. (27 steps per ms) remains 20/37 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (15 resets) in 43 ms. (90 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (15 resets) in 43 ms. (90 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (11 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (15 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (14 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (13 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (11 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (12 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (11 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (18 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (15 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (17 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (17 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (13 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (10 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
[2025-05-30 08:19:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1520 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1950/3470 variables, 1520/1524 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3470 variables, 0/1524 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/3472 variables, 1/1525 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3472 variables, 0/1525 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 2/3474 variables, 1/1526 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3474 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 2/3476 variables, 1/1527 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3476 variables, 0/1527 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 2/3478 variables, 1/1528 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3478/3491 variables, and 1528 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5020 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1524/1531 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1499/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1520 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1950/3470 variables, 1520/1524 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3470 variables, 20/1544 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3470 variables, 0/1544 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/3472 variables, 1/1545 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 0)
(t2 0)
(t3 0)
(t13 38)
(t14 38)
(t15 38)
(t16 38)
(t17 38)
(t18 38)
(t19 38)
(t20 38)
(t21 38)
(t22 38)
(t23 38)
(t24 38)
(t25 38)
(t26 32)
(t27 26)
(t28 26)
(t29 26)
(t30 7)
(t31 7)
(t32 7)
(t33 7)
(t34 2)
(t35 1)
(t36 1)
(t37 1)
(t38 1)
(t39 0)
(t40 0)
(t41 0)
(t42 1)
(t43 1)
(t44 1)
(t45 1)
(t46 1)
(t47 1)
(t48 1)
(t49 1)
(t50 1)
(t51 1)
(t52 1)
(t53 1)
(t54 1)
(t55 0)
(t56 0)
(t57 0)
(t58 1)
(t59 1)
(t60 1)
(t61 1)
(t62 0)
(t63 0)
(t64 0)
(t65 0)
(t66 0)
(t67 1)
(t68 1)
(t69 1)
(t70 1)
(t71 1)
(t72 1)
(t73 1)
(t74 1)
(t75 1)
(t76 1)
(t77 1)
(t78 1)
(t79 1)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 3)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 3)
(t95 3)
(t96 3)
(t97 2)
(t98 2)
(t99 2)
(t100 2)
(t101 2)
(t102 2)
(t103 2)
(t104 1)
(t105 1)
(t106 1)
(t107 1)
(t108 1)
(t109 1)
(t110 1)
(t111 1)
(t112 1)
(t113 0)
(t114 0)
(t115 1)
(t116 1)
(t117 1)
(t118 1)
(t119 1)
(t120 1)
(t121 1)
(t122 1)
(t123 1)
(t124 1)
(t125 1)
(t126 1)
(t127 1)
(t128 1)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 2)
(t146 2)
(t147 1)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 1)
(t160 1)
(t161 1)
(t162 1)
(t163 0)
(t164 1)
(t165 0)
(t166 13)
(t167 13)
(t168 13)
(t169 13)
(t170 11)
(t171 11)
(t172 11)
(t173 11)
(t174 7)
(t175 7)
(t176 1)
(t177 1)
(t178 1)
(t179 0)
(t180 1)
(t181 1)
(t182 1)
(t183 1)
(t184 0)
(t185 1)
(t186 1)
(t187 1)
(t188 0)
(t189 1)
(t190 1)
(t191 1)
(t192 1)
(t193 1)
(t194 1)
(t195 1)
(t196 1)
(t197 1)
(t198 0)
(t199 0)
(t200 1)
(t201 1)
(t202 0)
(t203 1)
(t204 1)
(t205 0)
(t206 1)
(t207 1)
(t208 0)
(t209 3)
(t210 2)
(t211 2)
(t212 2)
(t213 2)
(t214 2)
(t215 2)
(t216 1)
(t217 7)
(t218 0)
(t219 11)
(t220 0)
(t221 11)
(t222 2)
(t223 2)
(t224 2)
(t225 2)
(t226 0)
(t227 2)
(t228 2)
(t229 2)
(t230 1)
(t231 0)
(t232 1)
(t233 1)
(t234 1)
(t235 1)
(t236 0)
(t237 1)
(t238 1)
(t239 1)
(t240 0)
(t241 1)
(t242 1)
(t243 1)
(t244 1)
(t245 1)
(t246 1)
(t247 1)
(t248 1)
(t249 1)
(t250 0)
(t251 0)
(t252 1)
(t253 1)
(t254 0)
(t255 1)
(t256 1)
(t257 0)
(t258 1)
(t259 1)
(t260 0)
(t261 2)
(t262 2)
(t263 2)
(t264 2)
(t265 2)
(t266 2)
(t267 2)
(t268 2)
(t269 2)
(t270 0)
(t271 2)
(t272 0)
(t273 2)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 0)
(t280 0)
(t281 5)
(t282 5)
(t283 5)
(t284 5)
(t285 1)
(t286 1)
(t287 0)
(t288 1)
(t289 1)
(t290 1)
(t291 0)
(t292 1)
(t293 1)
(t294 1)
(t295 1)
(t296 0)
(t297 1)
(t298 1)
(t299 1)
(t300 0)
(t301 1)
(t302 1)
(t303 1)
(t304 1)
(t305 1)
(t306 1)
(t307 1)
(t308 1)
(t309 1)
(t310 0)
(t311 0)
(t312 1)
(t313 1)
(t314 0)
(t315 1)
(t316 1)
(t317 0)
(t318 1)
(t319 1)
(t320 0)
(t321 1)
(t322 1)
(t323 1)
(t324 1)
(t325 1)
(t326 1)
(t327 1)
(t328 1)
(t329 0)
(t330 1)
(t331 0)
(t332 1)
(t333 4)
(t334 4)
(t335 0)
(t336 4)
(t337 3)
(t338 3)
(t339 0)
(t340 3)
(t341 3)
(t342 3)
(t343 3)
(t344 0)
(t345 0)
(t346 3)
(t347 3)
(t348 3)
(t349 0)
(t350 3)
(t351 3)
(t352 3)
(t353 3)
(t354 2)
(t355 1)
(t356 1)
(t357 1)
(t358 1)
(t359 0)
(t360 0)
(t361 3)
(t362 3)
(t363 0)
(t364 3)
(t365 3)
(t366 0)
(t367 3)
(t368 3)
(t369 0)
(t370 4)
(t371 4)
(t372 4)
(t373 4)
(t374 4)
(t375 4)
(t376 4)
(t377 4)
(t378 0)
(t379 4)
(t380 0)
(t381 4)
(t382 0)
(t383 0)
(t384 0)
(t385 6)
(t386 6)
(t387 6)
(t388 6)
(t389 6)
(t390 3)
(t391 1)
(t392 2)
(t393 2)
(t394 0)
(t395 22)
(t396 22)
(t397 1)
(t398 1)
(t399 1)
(t400 1)
(t401 0)
(t402 0)
(t403 1)
(t404 1)
(t405 1)
(t406 0)
(t407 1)
(t408 1)
(t409 1)
(t410 1)
(t411 1)
(t412 1)
(t413 1)
(t414 1)
(t415 1)
(t416 0)
(t417 0)
(t418 1)
(t419 1)
(t420 0)
(t421 1)
(t422 1)
(t423 0)
(t424 1)
(t425 1)
(t426 2)
(t427 2)
(t428 3)
(t429 1)
(t430 1)
(t431 1)
(t432 1)
(t433 1)
(t434 1)
(t435 1)
(t436 0)
(t437 0)
(t438 2)
(t439 2)
(t440 16)
(t441 48)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 48)
(t447 0)
(t448 0)
(t449 0)
(t450 0)
(t451 0)
(t452 0)
(t453 0)
(t454 0)
(t455 6)
(t456 6)
(t457 6)
(t458 6)
(t459 6)
(t460 2)
(t461 2)
(t462 2)
(t463 2)
(t464 2)
(t465 2)
(t466 2)
(t467 0)
(t468 38)
(t469 38)
(t470 4)
(t471 4)
(t472 0)
(t473 0)
(t474 0)
(t475 2)
(t476 2)
(t477 4)
(t478 4)
(t479 2)
(t480 2)
(t481 2)
(t482 2)
(t483 2)
(t484 2)
(t485 0)
(t486 38)
(t487 4)
(t488 4)
(t489 38)
(t490 38)
(t491 33)
(t492 27)
(t493 20)
(t494 20)
(t495 20)
(t496 10)
(t497 10)
(t498 10)
(t499 10)
(t500 6)
(t501 3)
(t502 3)
(t503 3)
(t504 3)
(t505 2)
(t506 2)
(t507 1)
(t508 0)
(t509 1)
(t510 1)
(t511 1)
(t512 1)
(t513 1)
(t514 1)
(t515 1)
(t516 1)
(t517 1)
(t518 1)
(t519 1)
(t520 1)
(t521 1)
(t522 0)
(t523 0)
(t524 0)
(t525 3)
(t526 3)
(t527 3)
(t528 3)
(t529 0)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t534 3)
(t535 1)
(t536 1)
(t537 1)
(t538 1)
(t539 1)
(t540 1)
(t541 1)
(t542 1)
(t543 1)
(t544 1)
(t545 1)
(t546 1)
(t547 0)
(t548 2)
(t549 0)
(t550 2)
(t551 2)
(t552 2)
(t553 1)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 3)
(t559 0)
(t560 0)
(t561 0)
(t562 0)
(t563 0)
(t564 0)
(t565 0)
(t566 3)
(t567 3)
(t568 3)
(t569 2)
(t570 2)
(t571 2)
(t572 2)
(t573 2)
(t574 2)
(t575 2)
(t576 1)
(t577 1)
(t578 1)
(t579 1)
(t580 1)
(t581 1)
(t582 1)
(t583 1)
(t584 1)
(t585 0)
(t586 0)
(t587 1)
(t588 1)
(t589 1)
(t590 1)
(t591 1)
(t592 1)
(t593 1)
(t594 1)
(t595 1)
(t596 1)
(t597 1)
(t598 1)
(t599 1)
(t600 1)
(t601 0)
(t602 0)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 0)
(t609 0)
(t610 0)
(t611 0)
(t612 0)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 1)
(t622 1)
(t623 1)
(t624 1)
(t625 1)
(t626 0)
(t627 0)
(t628 0)
(t629 0)
(t630 0)
(t631 0)
(t632 0)
(t633 0)
(t634 0)
(t635 0)
(t636 0)
(t637 0)
(t638 0)
(t639 0)
(t640 0)
(t641 0)
(t642 3)
(t643 3)
(t644 3)
(t645 3)
(t646 1)
(t647 1)
(t648 1)
(t649 1)
(t650 1)
(t651 1)
(t652 1)
(t653 1)
(t654 1)
(t655 0)
(t656 1)
(t657 1)
(t658 1)
(t659 1)
(t660 0)
(t661 1)
(t662 1)
(t663 1)
(t664 0)
(t665 1)
(t666 1)
(t667 1)
(t668 1)
(t669 1)
(t670 1)
(t671 1)
(t672 1)
(t673 1)
(t674 0)
(t675 0)
(t676 1)
(t677 1)
(t678 0)
(t679 1)
(t680 1)
(t681 0)
(t682 1)
(t683 1)
(t684 0)
(t685 0)
(t686 0)
(t687 0)
(t688 0)
(t689 0)
(t690 0)
(t691 0)
(t692 0)
(t693 1)
(t694 0)
(t695 1)
(t696 0)
(t697 1)
(t698 2)
(t699 2)
(t700 2)
(t701 2)
(t702 2)
(t703 2)
(t704 2)
(t705 2)
(t706 1)
(t707 0)
(t708 1)
(t709 1)
(t710 1)
(t711 1)
(t712 0)
(t713 1)
(t714 1)
(t715 1)
(t716 0)
(t717 1)
(t718 1)
(t719 1)
(t720 1)
(t721 1)
(t722 1)
(t723 1)
(t724 1)
(t725 1)
(t726 0)
(t727 0)
(t728 1)
(t729 1)
(t730 0)
(t731 1)
(t732 1)
(t733 0)
(t734 1)
(t735 1)
(t736 0)
(t737 0)
(t738 0)
(t739 0)
(t740 0)
(t741 0)
(t742 0)
(t743 0)
(t744 0)
(t745 2)
(t746 0)
(t747 2)
(t748 0)
(t749 2)
(t750 0)
(t751 0)
(t752 0)
(t753 0)
(t754 0)
(t755 0)
(t756 0)
(t757 7)
(t758 7)
(t759 7)
(t760 7)
(t761 1)
(t762 1)
(t763 1)
(t764 1)
(t765 1)
(t766 1)
(t767 0)
(t768 1)
(t769 1)
(t770 1)
(t771 1)
(t772 0)
(t773 1)
(t774 1)
(t775 1)
(t776 0)
(t777 1)
(t778 1)
(t779 1)
(t780 1)
(t781 1)
(t782 1)
(t783 1)
(t784 1)
(t785 1)
(t786 0)
(t787 0)
(t788 1)
(t789 1)
(t790 0)
(t791 1)
(t792 1)
(t793 0)
(t794 1)
(t795 1)
(t796 0)
(t797 0)
(t798 0)
(t799 0)
(t800 0)
(t801 0)
(t802 0)
(t803 0)
(t804 1)
(t805 0)
(t806 1)
(t807 0)
(t808 1)
(t809 6)
(t810 6)
(t811 0)
(t812 6)
(t813 5)
(t814 5)
(t815 0)
(t816 5)
(t817 5)
(t818 5)
(t819 5)
(t820 2)
(t821 1)
(t822 0)
(t823 0)
(t824 4)
(t825 4)
(t826 4)
(t827 1)
(t828 2)
(t829 1)
(t830 1)
(t831 1)
(t832 1)
(t833 1)
(t834 1)
(t835 1)
(t836 1)
(t837 1)
(t838 0)
(t839 4)
(t840 4)
(t841 0)
(t842 6)
(t843 6)
(t844 0)
(t845 5)
(t846 5)
(t847 0)
(t848 6)
(t849 6)
(t850 6)
(t851 6)
(t852 6)
(t853 6)
(t854 6)
(t855 6)
(t856 0)
(t857 6)
(t858 0)
(t859 6)
(t860 0)
(t861 0)
(t862 0)
(t863 8)
(t864 8)
(t865 8)
(t866 8)
(t867 8)
(t868 5)
(t869 1)
(t870 4)
(t871 4)
(t872 0)
(t873 8)
(t874 8)
(t875 3)
(t876 3)
(t877 3)
(t878 3)
(t879 0)
(t880 0)
(t881 3)
(t882 3)
(t883 3)
(t884 0)
(t885 3)
(t886 3)
(t887 3)
(t888 3)
(t889 2)
(t890 1)
(t891 1)
(t892 1)
(t893 1)
(t894 0)
(t895 0)
(t896 3)
(t897 3)
(t898 0)
(t899 3)
(t900 3)
(t901 0)
(t902 3)
(t903 3)
(t904 4)
(t905 4)
(t906 3)
(t907 1)
(t908 1)
(t909 1)
(t910 1)
(t911 1)
(t912 1)
(t913 1)
(t914 0)
(t915 0)
(t916 2)
(t917 2)
(t918 0)
(t919 28)
(t920 0)
(t921 0)
(t922 0)
(t923 0)
(t924 28)
(t925 0)
(t926 0)
(t927 0)
(t928 0)
(t929 0)
(t930 0)
(t931 0)
(t932 0)
(t933 6)
(t934 6)
(t935 6)
(t936 6)
(t937 6)
(t938 2)
(t939 2)
(t940 2)
(t941 2)
(t942 2)
(t943 2)
(t944 2)
(t945 0)
(t946 33)
(t947 33)
(t948 4)
(t949 4)
(t950 0)
(t951 0)
(t952 0)
(t953 2)
(t954 2)
(t955 4)
(t956 4)
(t957 2)
(t958 2)
(t959 2)
(t960 2)
(t961 2)
(t962 2)
(t963 0)
(t964 33)
(t965 4)
(t966 4)
(t967 38)
(t968 38)
(t969 32)
(t970 23)
(t971 22)
(t972 22)
(t973 9)
(t974 9)
(t975 9)
(t976 9)
(t977 6)
(t978 1)
(t979 1)
(t980 1)
(t981 1)
(t982 0)
(t983 0)
(t984 0)
(t985 1)
(t986 1)
(t987 1)
(t988 1)
(t989 1)
(t990 1)
(t991 1)
(t992 1)
(t993 1)
(t994 1)
(t995 1)
(t996 1)
(t997 1)
(t998 0)
(t999 0)
(t1000 0)
(t1001 3)
(t1002 3)
(t1003 3)
(t1004 3)
(t1005 0)
(t1006 0)
(t1007 0)
(t1008 0)
(t1009 0)
(t1010 3)
(t1011 3)
(t1012 3)
(t1013 3)
(t1014 3)
(t1015 3)
(t1016 3)
(t1017 3)
(t1018 3)
(t1019 3)
(t1020 2)
(t1021 3)
(t1022 3)
(t1023 0)
(t1024 0)
(t1025 0)
(t1026 0)
(t1027 2)
(t1028 2)
(t1029 2)
(t1030 2)
(t1031 1)
(t1032 0)
(t1033 0)
(t1034 0)
(t1035 3)
(t1036 0)
(t1037 0)
(t1038 0)
(t1039 0)
(t1040 0)
(t1041 0)
(t1042 0)
(t1043 3)
(t1044 3)
(t1045 3)
(t1046 2)
(t1047 2)
(t1048 2)
(t1049 2)
(t1050 2)
(t1051 2)
(t1052 2)
(t1053 1)
(t1054 1)
(t1055 1)
(t1056 1)
(t1057 1)
(t1058 1)
(t1059 1)
(t1060 1)
(t1061 1)
(t1062 0)
(t1063 0)
(t1064 1)
(t1065 1)
(t1066 1)
(t1067 1)
(t1068 1)
(t1069 1)
(t1070 1)
(t1071 1)
(t1072 1)
(t1073 1)
(t1074 1)
(t1075 1)
(t1076 1)
(t1077 1)
(t1078 0)
(t1079 0)
(t1080 0)
(t1081 0)
(t1082 0)
(t1083 0)
(t1084 0)
(t1085 0)
(t1086 0)
(t1087 0)
(t1088 0)
(t1089 0)
(t1090 0)
(t1091 0)
(t1092 0)
(t1093 0)
(t1094 0)
(t1095 0)
(t1096 0)
(t1097 0)
(t1098 0)
(t1099 0)
(t1100 0)
(t1101 0)
(t1102 0)
(t1103 0)
(t1104 0)
(t1105 0)
(t1106 0)
(t1107 0)
(t1108 1)
(t1109 1)
(t1110 1)
(t1111 1)
(t1112 0)
(t1113 1)
(t1114 0)
(t1115 7)
(t1116 7)
(t1117 7)
(t1118 7)
(t1119 5)
(t1120 5)
(t1121 5)
(t1122 5)
(t1123 5)
(t1124 5)
(t1125 5)
(t1126 5)
(t1127 5)
(t1128 0)
(t1129 5)
(t1130 5)
(t1131 5)
(t1132 3)
(t1133 0)
(t1134 2)
(t1135 1)
(t1136 1)
(t1137 0)
(t1138 1)
(t1139 1)
(t1140 1)
(t1141 1)
(t1142 1)
(t1143 1)
(t1144 1)
(t1145 1)
(t1146 1)
(t1147 0)
(t1148 0)
(t1149 1)
(t1150 1)
(t1151 0)
(t1152 2)
(t1153 2)
(t1154 1)
(t1155 5)
(t1156 5)
(t1157 0)
(t1158 0)
(t1159 0)
(t1160 0)
(t1161 0)
(t1162 0)
(t1163 0)
(t1164 0)
(t1165 0)
(t1166 5)
(t1167 0)
(t1168 5)
(t1169 0)
(t1170 5)
(t1171 2)
(t1172 2)
(t1173 2)
(t1174 2)
(t1175 2)
(t1176 2)
(t1177 2)
(t1178 2)
(t1179 1)
(t1180 0)
(t1181 1)
(t1182 1)
(t1183 1)
(t1184 1)
(t1185 0)
(t1186 1)
(t1187 1)
(t1188 1)
(t1189 0)
(t1190 1)
(t1191 1)
(t1192 1)
(t1193 1)
(t1194 1)
(t1195 1)
(t1196 1)
(t1197 1)
(t1198 1)
(t1199 0)
(t1200 0)
(t1201 1)
(t1202 1)
(t1203 0)
(t1204 1)
(t1205 1)
(t1206 0)
(t1207 1)
(t1208 1)
(t1209 0)
(t1210 0)
(t1211 0)
(t1212 0)
(t1213 0)
(t1214 0)
(t1215 0)
(t1216 0)
(t1217 0)
(t1218 2)
(t1219 0)
(t1220 2)
(t1221 0)
(t1222 2)
(t1223 0)
(t1224 0)
(t1225 0)
(t1226 0)
(t1227 0)
(t1228 0)
(t1229 0)
(t1230 5)
(t1231 5)
(t1232 5)
(t1233 5)
(t1234 3)
(t1235 3)
(t1236 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3472/3491 variables, and 1545 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1521/1531 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10060ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 21 out of 1531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Graph (trivial) has 1827 edges and 1531 vertex of which 642 / 1531 are part of one of the 61 SCC in 5 ms
Free SCC test removed 581 places
Drop transitions (Empty/Sink Transition effects.) removed 734 transitions
Reduce isomorphic transitions removed 734 transitions.
Graph (complete) has 1399 edges and 950 vertex of which 941 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 502 transitions
Trivial Post-agglo rules discarded 502 transitions
Performed 502 trivial Post agglomeration. Transition count delta: 502
Iterating post reduction 0 with 508 rules applied. Total rules applied 510 place count 941 transition count 714
Reduce places removed 502 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 557 rules applied. Total rules applied 1067 place count 439 transition count 659
Reduce places removed 36 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 44 rules applied. Total rules applied 1111 place count 403 transition count 651
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1119 place count 395 transition count 651
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 52 Pre rules applied. Total rules applied 1119 place count 395 transition count 599
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 1223 place count 343 transition count 599
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 1233 place count 333 transition count 584
Iterating global reduction 4 with 10 rules applied. Total rules applied 1243 place count 333 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 1246 place count 333 transition count 581
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1248 place count 331 transition count 581
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1254 place count 325 transition count 574
Iterating global reduction 6 with 6 rules applied. Total rules applied 1260 place count 325 transition count 574
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1265 place count 325 transition count 569
Performed 161 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 7 with 322 rules applied. Total rules applied 1587 place count 164 transition count 312
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 1604 place count 164 transition count 295
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1608 place count 160 transition count 291
Iterating global reduction 8 with 4 rules applied. Total rules applied 1612 place count 160 transition count 291
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1613 place count 159 transition count 290
Iterating global reduction 8 with 1 rules applied. Total rules applied 1614 place count 159 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1615 place count 159 transition count 289
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 1637 place count 148 transition count 276
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1650 place count 148 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1652 place count 147 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1654 place count 147 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1656 place count 146 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1658 place count 146 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1660 place count 145 transition count 256
Performed 32 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 12 with 64 rules applied. Total rules applied 1724 place count 113 transition count 302
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 1751 place count 113 transition count 275
Discarding 16 places :
Symmetric choice reduction at 13 with 16 rule applications. Total rules 1767 place count 97 transition count 243
Iterating global reduction 13 with 16 rules applied. Total rules applied 1783 place count 97 transition count 243
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 1790 place count 97 transition count 236
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1794 place count 93 transition count 228
Iterating global reduction 14 with 4 rules applied. Total rules applied 1798 place count 93 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1802 place count 93 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 15 with 10 rules applied. Total rules applied 1812 place count 93 transition count 214
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1813 place count 92 transition count 213
Iterating global reduction 15 with 1 rules applied. Total rules applied 1814 place count 92 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1816 place count 91 transition count 212
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1818 place count 91 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 1820 place count 89 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1821 place count 89 transition count 209
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1823 place count 89 transition count 209
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1824 place count 89 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1825 place count 89 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1826 place count 88 transition count 207
Applied a total of 1826 rules in 216 ms. Remains 88 /1531 variables (removed 1443) and now considering 207/1960 (removed 1753) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 88/1531 places, 207/1960 transitions.
RANDOM walk for 40000 steps (5369 resets) in 552 ms. (72 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40003 steps (1260 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1221 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
[2025-05-30 08:20:09] [INFO ] Flow matrix only has 197 transitions (discarded 10 similar events)
// Phase 1: matrix 197 rows 88 cols
[2025-05-30 08:20:09] [INFO ] Computed 3 invariants in 2 ms
[2025-05-30 08:20:09] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 127/180 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 64/244 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/278 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/283 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/285 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/285 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/285 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 96 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 88/88 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 127/180 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 64/244 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 34/278 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:20:10] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 7 ms to minimize.
Problem AtomicPropp8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:20:10] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Int declared 278/285 variables, and 94 constraints, problems are : Problem set: 2 solved, 0 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 83/88 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 510ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CloudReconfiguration-PT-311-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 28 stabilizing places and 30 stable transitions
Graph (complete) has 2137 edges and 1531 vertex of which 1522 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.25 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((F((p0&&F(p1)))&&X(p2))||G((F(p1)&&F(p0)))))))))'
Support contains 3 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1522 transition count 1950
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1522 transition count 1950
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1517 transition count 1945
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1517 transition count 1945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1517 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 1515 transition count 1942
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 1515 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1513 transition count 1939
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1513 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 1513 transition count 1938
Applied a total of 38 rules in 323 ms. Remains 1513 /1531 variables (removed 18) and now considering 1938/1960 (removed 22) transitions.
// Phase 1: matrix 1938 rows 1513 cols
[2025-05-30 08:20:11] [INFO ] Computed 4 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:20:11] [INFO ] Implicit Places using invariants in 302 ms returned []
[2025-05-30 08:20:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:20:12] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2025-05-30 08:20:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 0)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 1)
(s700 0)
(s701 1)
(s702 1)
(s703 0)
(s704 0)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 1)
(s718 0)
(s719 0)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)timeout

( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60463ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1531 places, 1938/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62037 ms. Remains : 1513/1531 places, 1938/1960 transitions.
Stuttering acceptance computed with spot in 524 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-00
Product exploration explored 100000 steps with 20000 reset in 416 ms.
Product exploration explored 100000 steps with 20000 reset in 294 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2115 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.12 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 40000 steps (404 resets) in 211 ms. (188 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (138 resets) in 91 ms. (434 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (141 resets) in 133 ms. (298 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (144 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
[2025-05-30 08:21:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 822/825 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/825 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 677/1502 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3430 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3442 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3444 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3444 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3446 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3446 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3448 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3448 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5023ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1513/1513 places, 1938/1938 transitions.
Graph (trivial) has 1845 edges and 1513 vertex of which 689 / 1513 are part of one of the 63 SCC in 5 ms
Free SCC test removed 626 places
Drop transitions (Empty/Sink Transition effects.) removed 791 transitions
Reduce isomorphic transitions removed 791 transitions.
Graph (complete) has 1319 edges and 887 vertex of which 878 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 501 rules applied. Total rules applied 503 place count 878 transition count 642
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 554 rules applied. Total rules applied 1057 place count 384 transition count 582
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1096 place count 345 transition count 582
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1096 place count 345 transition count 533
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1194 place count 296 transition count 533
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1205 place count 285 transition count 517
Iterating global reduction 3 with 11 rules applied. Total rules applied 1216 place count 285 transition count 517
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1219 place count 285 transition count 514
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1222 place count 282 transition count 514
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1230 place count 274 transition count 504
Iterating global reduction 5 with 8 rules applied. Total rules applied 1238 place count 274 transition count 504
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1244 place count 274 transition count 498
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1246 place count 272 transition count 486
Iterating global reduction 6 with 2 rules applied. Total rules applied 1248 place count 272 transition count 486
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1249 place count 272 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1250 place count 271 transition count 485
Performed 144 Post agglomeration using F-continuation condition with reduction of 100 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 8 with 288 rules applied. Total rules applied 1538 place count 127 transition count 241
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 12 rules applied. Total rules applied 1550 place count 127 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1552 place count 126 transition count 228
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1555 place count 123 transition count 225
Iterating global reduction 10 with 3 rules applied. Total rules applied 1558 place count 123 transition count 225
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1582 place count 111 transition count 210
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1595 place count 111 transition count 197
Performed 32 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 11 with 64 rules applied. Total rules applied 1659 place count 79 transition count 231
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 11 with 55 rules applied. Total rules applied 1714 place count 79 transition count 176
Discarding 22 places :
Symmetric choice reduction at 12 with 22 rule applications. Total rules 1736 place count 57 transition count 154
Iterating global reduction 12 with 22 rules applied. Total rules applied 1758 place count 57 transition count 154
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1772 place count 57 transition count 140
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1777 place count 52 transition count 130
Iterating global reduction 13 with 5 rules applied. Total rules applied 1782 place count 52 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1787 place count 52 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 14 with 33 rules applied. Total rules applied 1820 place count 52 transition count 92
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1824 place count 48 transition count 82
Iterating global reduction 14 with 4 rules applied. Total rules applied 1828 place count 48 transition count 82
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1831 place count 45 transition count 79
Iterating global reduction 14 with 3 rules applied. Total rules applied 1834 place count 45 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1837 place count 45 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1840 place count 45 transition count 73
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1843 place count 45 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1846 place count 42 transition count 70
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1848 place count 42 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1849 place count 42 transition count 69
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1850 place count 42 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1851 place count 42 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1852 place count 41 transition count 67
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 39 edges and 40 vertex of which 25 / 40 are part of one of the 9 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 18 with 3 rules applied. Total rules applied 1855 place count 24 transition count 66
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 19 with 34 rules applied. Total rules applied 1889 place count 23 transition count 33
Discarding 3 places :
Symmetric choice reduction at 20 with 3 rule applications. Total rules 1892 place count 20 transition count 30
Iterating global reduction 20 with 3 rules applied. Total rules applied 1895 place count 20 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 20 with 6 rules applied. Total rules applied 1901 place count 17 transition count 27
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 20 with 7 rules applied. Total rules applied 1908 place count 17 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 1909 place count 17 transition count 19
Free-agglomeration rule applied 3 times.
Iterating global reduction 21 with 3 rules applied. Total rules applied 1912 place count 17 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 1915 place count 14 transition count 16
Applied a total of 1915 rules in 100 ms. Remains 14 /1513 variables (removed 1499) and now considering 16/1938 (removed 1922) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 14/1513 places, 16/1938 transitions.
RANDOM walk for 957 steps (112 resets) in 7 ms. (119 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0 p2)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 220 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1938/1938 transitions.
Applied a total of 0 rules in 58 ms. Remains 1513 /1513 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
[2025-05-30 08:21:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:21:21] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-30 08:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:21:21] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2025-05-30 08:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30059 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60447ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60452ms
Finished structural reductions in LTL mode , in 1 iterations and 61645 ms. Remains : 1513/1513 places, 1938/1938 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2115 edges and 1513 vertex of which 1504 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.10 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 387 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 40000 steps (403 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (132 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (123 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (143 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (136 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (134 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 318098 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 5
Probabilistic random walk after 318098 steps, saw 86958 distinct states, run finished after 3007 ms. (steps per millisecond=105 ) properties seen :0
[2025-05-30 08:22:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 822/825 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/825 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 677/1502 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3430 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3430 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/3432 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3432 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/3434 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3434 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/3436 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3436 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/3438 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3438 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/3440 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3440 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/3442 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t8 1.0)
(t9 1.0)
(t10 1.0)
(t11 1.0)
(t12 1.0)
(t13 1.0)
(t14 1.0)
(t15 1.0)
(t16 1.0)
(t17 1.0)
(t18 1.0)
(t19 1.0)
(t20 1.0)
(t21 1.0)
(t22 1.0)
(t23 1.0)
(t24 1.0)
(t25 1.0)
(t26 1.0)
(t27 1.0)
(t28 1.0)
(t29 1.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 1.0)
(t167 1.0)
(t168 1.0)
(t169 1.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 0.0)
(t177 0.0)
(t178 0.0)
(t179 0.0)
(t180 0.0)
(t181 0.0)
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 0.0)
(t189 0.0)
(t190 0.0)
(t191 0.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 1.0)
(t223 1.0)
(t224 1.0)
(t225 1.0)
(t226 0.0)
(t227 1.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 0.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 0.0)
(t241 0.0)
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 0.0)
(t252 0.0)
(t253 0.0)
(t254 0.0)
(t255 0.0)
(t256 0.0)
(t257 0.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 1.0)
(t262 1.0)
(t263 1.0)
(t264 1.0)
(t265 1.0)
(t266 1.0)
(t267 1.0)
(t268 1.0)
(t269 1.0)
(t270 0.0)
(t271 1.0)
(t272 0.0)
(t273 1.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 0.0)
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 0.0)
(t286 0.0)
(t287 0.0)
(t288 0.0)
(t289 0.0)
(t290 0.0)
(t291 0.0)
(t292 0.0)
(t293 0.0)
(t294 0.0)
(t295 0.0)
(t296 0.0)
(t297 0.0)
(t298 0.0)
(t299 0.0)
(t300 0.0)
(t301 0.0)
(t302 0.0)
(t303 0.0)
(t304 0.0)
(t305 0.0)
(t306 0.0)
(t307 0.0)
(t308 0.0)
(t309 0.0)
(t310 0.0)
(t311 0.0)
(t312 0.0)
(t313 0.0)
(t314 0.0)
(t315 0.0)
(t316 0.0)
(t317 0.0)
(t318 0.0)
(t319 0.0)
(t320 0.0)
(t321 0.0)
(t322 0.0)
(t323 0.0)
(t324 0.0)
(t325 0.0)
(t326 0.0)
(t327 0.0)
(t328 0.0)
(t329 0.0)
(t330 0.0)
(t331 0.0)
(t332 0.0)
(t333 0.0)
(t334 0.0)
(t335 0.0)
(t336 0.0)
(t337 0.0)
(t338 0.0)
(t339 0.0)
(t340 0.0)
(t341 0.0)
(t342 0.0)
(t343 0.0)
(t344 0.0)
(t345 0.0)
(t346 1.0)
(t347 1.0)
(t348 1.0)
(t349 0.0)
(t350 1.0)
(t351 1.0)
(t352 1.0)
(t353 1.0)
(t354 1.0)
(t355 1.0)
(t356 1.0)
(t357 1.0)
(t358 1.0)
(t359 1.0)
(t360 0.0)
(t361 1.0)
(t362 1.0)
(t363 0.0)
(t364 1.0)
(t365 1.0)
(t366 0.0)
(t367 0.0)
(t368 0.0)
(t369 0.0)
(t370 0.0)
(t371 0.0)
(t372 0.0)
(t373 0.0)
(t374 0.0)
(t375 0.0)
(t376 0.0)
(t377 0.0)
(t378 0.0)
(t379 0.0)
(t380 0.0)
(t381 0.0)
(t382 0.0)
(t383 0.0)
(t384 0.0)
(t385 0.0)
(t386 0.0)
(t387 0.0)
(t388 0.0)
(t389 0.0)
(t390 0.0)
(t391 0.0)
(t392 0.0)
(t393 0.0)
(t394 0.0)
(t395 0.0)
(t396 0.0)
(t397 0.0)
(t398 0.0)
(t399 0.0)
(t400 0.0)
(t401 0.0)
(t402 0.0)
(t403 0.0)
(t404 0.0)
(t405 0.0)
(t406 0.0)
(t407 0.0)
(t408 0.0)
(t409 0.0)
(t410 0.0)
(t411 0.0)
(t412 0.0)
(t413 0.0)
(t414 0.0)
(t415 0.0)
(t416 0.0)
(t417 0.0)
(t418 0.0)
(t419 0.0)
(t420 0.0)
(t421 0.0)
(t422 0.0)
(t423 0.0)
(t424 0.0)
(t425 0.0)
(t426 0.0)
(t427 0.0)
(t428 0.0)
(t429 0.0)
(t430 0.0)
(t431 0.0)
(t432 0.0)
(t433 0.0)
(t434 0.0)
(t435 0.0)
(t436 0.0)
(t437 0.0)
(t438 0.0)
(t439 0.0)
(t440 0.0)
(t441 1.0)
(t442 0.0)
(t443 0.0)
(t444 0.0)
(t445 0.0)
(t446 1.0)
(t447 0.0)
(t448 0.0)
(t449 0.0)
(t450 0.0)
(t451 0.0)
(t452 0.0)
(t453 0.0)
(t454 0.0)
(t455 0.0)
(t456 0.0)
(t457 0.0)
(t458 0.0)
(t459 0.0)
(t460 0.0)
(t461 0.0)
(t462 0.0)
(t463 0.0)
(t464 0.0)
(t465 0.0)
(t466 0.0)
(t467 0.0)
(t468 1.0)
(t469 1.0)
(t470 0.0)
(t471 0.0)
(t472 0.0)
(t473 0.0)
(t474 0.0)
(t475 0.0)
(t476 0.0)
(t477 0.0)
(t478 0.0)
(t479 0.0)
(t480 0.0)
(t481 0.0)
(t482 0.0)
(t483 0.0)
(t484 0.0)
(t485 0.0)
(t486 1.0)
(t487 0.0)
(t488 0.0)
(t489 1.0)
(t490 1.0)
(t491 1.0)
(t492 1.0)
(t493 1.0)
(t494 1.0)
(t495 1.0)
(t496 0.0)
(t497 0.0)
(t498 0.0)
(t499 0.0)
(t500 0.0)
(t501 0.0)
(t502 0.0)
(t503 0.0)
(t504 0.0)
(t505 0.0)
(t506 0.0)
(t507 0.0)
(t508 0.0)
(t509 0.0)
(t510 0.0)
(t511 0.0)
(t512 0.0)
(t513 0.0)
(t514 0.0)
(t515 0.0)
(t516 0.0)
(t517 0.0)
(t518 0.0)
(t519 0.0)
(t520 0.0)
(t521 0.0)
(t522 0.0)
(t523 0.0)
(t524 0.0)
(t525 0.0)
(t526 0.0)
(t527 0.0)
(t528 0.0)
(t529 0.0)
(t530 0.0)
(t531 0.0)
(t532 0.0)
(t533 0.0)
(t534 0.0)
(t535 0.0)
(t536 0.0)
(t537 0.0)
(t538 0.0)
(t539 0.0)
(t540 0.0)
(t541 0.0)
(t542 0.0)
(t543 0.0)
(t544 0.0)
(t545 0.0)
(t546 0.0)
(t547 0.0)
(t548 0.0)
(t549 0.0)
(t550 0.0)
(t551 0.0)
(t552 0.0)
(t553 0.0)
(t554 0.0)
(t555 0.0)
(t556 0.0)
(t557 0.0)
(t558 0.0)
(t559 0.0)
(t560 0.0)
(t561 0.0)
(t562 0.0)
(t563 0.0)
(t564 0.0)
(t565 0.0)
(t566 0.0)
(t567 0.0)
(t568 0.0)
(t569 0.0)
(t570 0.0)
(t571 0.0)
(t572 0.0)
(t573 0.0)
(t574 0.0)
(t575 0.0)
(t576 0.0)
(t577 0.0)
(t578 0.0)
(t579 0.0)
(t580 0.0)
(t581 0.0)
(t582 0.0)
(t583 0.0)
(t584 0.0)
(t585 0.0)
(t586 0.0)
(t587 0.0)
(t588 0.0)
(t589 0.0)
(t590 0.0)
(t591 0.0)
(t592 0.0)
(t593 0.0)
(t594 0.0)
(t595 0.0)
(t596 0.0)
(t597 0.0)
(t598 0.0)
(t599 0.0)
(t600 0.0)
(t601 0.0)
(t602 0.0)
(t603 0.0)
(t604 0.0)
(t605 0.0)
(t606 0.0)
(t607 0.0)
(t608 0.0)
(t609 0.0)
(t610 0.0)
(t611 0.0)
(t612 0.0)
(t613 0.0)
(t614 0.0)
(t615 0.0)
(t616 0.0)
(t617 0.0)
(t618 0.0)
(t619 0.0)
(t620 0.0)
(t621 0.0)
(t622 0.0)
(t623 0.0)
(t624 0.0)
(t625 0.0)
(t626 0.0)
(t627 0.0)
(t628 0.0)
(t629 0.0)
(t630 0.0)
(t631 0.0)
(t632 0.0)
(t633 0.0)
(t634 0.0)
(t635 0.0)
(t636 0.0)
(t637 0.0)
(t638 0.0)
(t639 0.0)
(t640 0.0)
(t641 0.0)
(t642 0.0)
(t643 0.0)
(t644 0.0)
(t645 0.0)
(t646 0.0)
(t647 0.0)
(t648 0.0)
(t649 0.0)
(t650 0.0)
(t651 0.0)
(t652 0.0)
(t653 0.0)
(t654 0.0)
(t655 0.0)
(t656 0.0)
(t657 0.0)
(t658 0.0)
(t659 0.0)
(t660 0.0)
(t661 0.0)
(t662 0.0)
(t663 0.0)
(t664 0.0)
(t665 0.0)
(t666 0.0)
(t667 0.0)
(t668 0.0)
(t669 0.0)
(t670 0.0)
(t671 0.0)
(t672 0.0)
(t673 0.0)
(t674 0.0)
(t675 0.0)
(t676 0.0)
(t677 0.0)
(t678 0.0)
(t679 0.0)
(t680 0.0)
(t681 0.0)
(t682 0.0)
(t683 0.0)
(t684 0.0)
(t685 0.0)
(t686 0.0)
(t687 0.0)
(t688 0.0)
(t689 0.0)
(t690 0.0)
(t691 0.0)
(t692 0.0)
(t693 0.0)
(t694 0.0)
(t695 0.0)
(t696 0.0)
(t697 0.0)
(t698 0.0)
(t699 0.0)
(t700 0.0)
(t701 0.0)
(t702 0.0)
(t703 0.0)
(t704 0.0)
(t705 0.0)
(t706 0.0)
(t707 0.0)
(t708 0.0)
(t709 0.0)
(t710 0.0)
(t711 0.0)
(t712 0.0)
(t713 0.0)
(t714 0.0)
(t715 0.0)
(t716 0.0)
(t717 0.0)
(t718 0.0)
(t719 0.0)
(t720 0.0)
(t721 0.0)
(t722 0.0)
(t723 0.0)
(t724 0.0)
(t725 0.0)
(t726 0.0)
(t727 0.0)
(t728 0.0)
(t729 0.0)
(t730 0.0)
(t731 0.0)
(t732 0.0)
(t733 0.0)
(t734 0.0)
(t735 0.0)
(t736 0.0)
(t737 0.0)
(t738 0.0)
(t739 0.0)
(t740 0.0)
(t741 0.0)
(t742 0.0)
(t743 0.0)
(t744 0.0)
(t745 0.0)
(t746 0.0)
(t747 1.0)
(t748 1.0)
(t749 1.0)
(t750 1.0)
(t751 0.0)
(t752 0.0)
(t753 0.0)
(t754 0.0)
(t755 0.0)
(t756 0.0)
(t757 0.0)
(t758 0.0)
(t759 0.0)
(t760 0.0)
(t761 0.0)
(t762 0.0)
(t763 0.0)
(t764 0.0)
(t765 0.0)
(t766 0.0)
(t767 0.0)
(t768 0.0)
(t769 0.0)
(t770 0.0)
(t771 0.0)
(t772 0.0)
(t773 0.0)
(t774 0.0)
(t775 0.0)
(t776 0.0)
(t777 0.0)
(t778 0.0)
(t779 0.0)
(t780 0.0)
(t781 0.0)
(t782 0.0)
(t783 0.0)
(t784 0.0)
(t785 0.0)
(t786 0.0)
(t787 0.0)
(t788 0.0)
(t789 0.0)
(t790 0.0)
(t791 0.0)
(t792 0.0)
(t793 0.0)
(t794 0.0)
(t795 0.0)
(t796 0.0)
(t797 0.0)
(t798 0.0)
(t799 1.0)
(t800 1.0)
(t801 1.0)
(t802 1.0)
(t803 1.0)
(t804 1.0)
(t805 0.0)
(t806 1.0)
(t807 1.0)
(t808 1.0)
(t809 1.0)
(t810 1.0)
(t811 0.0)
(t812 0.0)
(t813 0.0)
(t814 0.0)
(t815 0.0)
(t816 0.0)
(t817 0.0)
(t818 0.0)
(t819 0.0)
(t820 0.0)
(t821 0.0)
(t822 0.0)
(t823 0.0)
(t824 0.0)
(t825 0.0)
(t826 0.0)
(t827 0.0)
(t828 0.0)
(t829 0.0)
(t830 0.0)
(t831 0.0)
(t832 1.0)
(t833 1.0)
(t834 0.0)
(t835 1.0)
(t836 1.0)
(t837 0.0)
(t838 0.0)
(t839 0.0)
(t840 0.0)
(t841 0.0)
(t842 0.0)
(t843 0.0)
(t844 0.0)
(t845 1.0)
(t846 0.0)
(t847 1.0)
(t848 0.0)
(t849 1.0)
(t850 0.0)
(t851 0.0)
(t852 0.0)
(t853 0.0)
(t854 0.0)
(t855 0.0)
(t856 0.0)
(t857 0.0)
(t858 0.0)
(t859 0.0)
(t860 0.0)
(t861 0.0)
(t862 0.0)
(t863 0.0)
(t864 0.0)
(t865 0.0)
(t866 0.0)
(t867 0.0)
(t868 0.0)
(t869 0.0)
(t870 0.0)
(t871 0.0)
(t872 0.0)
(t873 0.0)
(t874 0.0)
(t875 0.0)
(t876 0.0)
(t877 0.0)
(t878 0.0)
(t879 0.0)
(t880 0.0)
(t881 0.0)
(t882 0.0)
(t883 0.0)
(t884 0.0)
(t885 0.0)
(t886 0.0)
(t887 0.0)
(t888 0.0)
(t889 0.0)
(t890 0.0)
(t891 0.0)
(t892 0.0)
(t893 0.0)
(t894 0.0)
(t895 0.0)
(t896 0.0)
(t897 0.0)
(t898 0.0)
(t899 0.0)
(t900 0.0)
(t901 0.0)
(t902 0.0)
(t903 0.0)
(t904 0.0)
(t905 0.0)
(t906 0.0)
(t907 0.0)
(t908 0.0)
(t909 1.0)
(t910 0.0)
(t911 0.0)
(t912 0.0)
(t913 0.0)
(t914 1.0)
(t915 0.0)
(t916 0.0)
(t917 0.0)
(t918 0.0)
(t919 0.0)
(t920 0.0)
(t921 0.0)
(t922 0.0)
(t923 0.0)
(t924 0.0)
(t925 0.0)
(t926 0.0)
(t927 0.0)
(t928 0.0)
(t929 0.0)
(t930 0.0)
(t931 0.0)
(t932 0.0)
(t933 0.0)
(t934 0.0)
(t935 0.0)
(t936 1.0)
(t937 1.0)
(t938 0.0)
(t939 0.0)
(t940 0.0)
(t941 0.0)
(t942 0.0)
(t943 0.0)
(t944 0.0)
(t945 0.0)
(t946 0.0)
(t947 0.0)
(t948 0.0)
(t949 0.0)
(t950 0.0)
(t951 0.0)
(t952 0.0)
(t953 0.0)
(t954 1.0)
(t955 0.0)
(t956 0.0)
(t957 1.0)
(t958 1.0)
(t959 1.0)
(t960 1.0)
(t961 1.0)
(t962 1.0)
(t963 1.0)
(t964 1.0)
(t965 1.0)
(t966 1.0)
(t967 1.0)
(t968 0.0)
(t969 0.0)
(t970 0.0)
(t971 0.0)
(t972 0.0)
(t973 0.0)
(t974 0.0)
(t975 0.0)
(t976 0.0)
(t977 0.0)
(t978 0.0)
(t979 0.0)
(t980 0.0)
(t981 0.0)
(t982 0.0)
(t983 0.0)
(t984 0.0)
(t985 0.0)
(t986 0.0)
(t987 0.0)
(t988 0.0)
(t989 0.0)
(t990 0.0)
(t991 0.0)
(t992 0.0)
(t993 0.0)
(t994 0.0)
(t995 0.0)
(t996 0.0)
(t997 0.0)
(t998 0.0)
(t999 0.0)
(t1000 0.0)
(t1001 0.0)
(t1002 0.0)
(t1003 0.0)
(t1004 0.0)
(t1005 0.0)
(t1006 0.0)
(t1007 0.0)
(t1008 0.0)
(t1009 0.0)
(t1010 0.0)
(t1011 0.0)
(t1012 0.0)
(t1013 0.0)
(t1014 0.0)
(t1015 0.0)
(t1016 0.0)
(t1017 1.0)
(t1018 1.0)
(t1019 1.0)
(t1020 1.0)
(t1021 0.0)
(t1022 0.0)
(t1023 0.0)
(t1024 0.0)
(t1025 0.0)
(t1026 0.0)
(t1027 0.0)
(t1028 0.0)
(t1029 0.0)
(t1030 0.0)
(t1031 0.0)
(t1032 0.0)
(t1033 0.0)
(t1034 0.0)
(t1035 0.0)
(t1036 0.0)
(t1037 0.0)
(t1038 0.0)
(t1039 0.0)
(t1040 0.0)
(t1041 0.0)
(t1042 0.0)
(t1043 0.0)
(t1044 0.0)
(t1045 0.0)
(t1046 0.0)
(t1047 0.0)
(t1048 0.0)
(t1049 0.0)
(t1050 0.0)
(t1051 0.0)
(t1052 0.0)
(t1053 0.0)
(t1054 0.0)
(t1055 0.0)
(t1056 0.0)
(t1057 0.0)
(t1058 0.0)
(t1059 0.0)
(t1060 0.0)
(t1061 0.0)
(t1062 0.0)
(t1063 0.0)
(t1064 0.0)
(t1065 0.0)
(t1066 0.0)
(t1067 0.0)
(t1068 0.0)
(t1069 0.0)
(t1070 0.0)
(t1071 0.0)
(t1072 0.0)
(t1073 0.0)
(t1074 0.0)
(t1075 0.0)
(t1076 0.0)
(t1077 0.0)
(t1078 0.0)
(t1079 0.0)
(t1080 0.0)
(t1081 0.0)
(t1082 0.0)
(t1083 0.0)
(t1084 0.0)
(t1085 0.0)
(t1086 0.0)
(t1087 0.0)
(t1088 0.0)
(t1089 0.0)
(t1090 0.0)
(t1091 0.0)
(t1092 0.0)
(t1093 0.0)
(t1094 0.0)
(t1095 0.0)
(t1096 0.0)
(t1097 0.0)
(t1098 0.0)
(t1099 0.0)
(t1100 0.0)
(t1101 0.0)
(t1102 0.0)
(t1103 0.0)
(t1104 0.0)
(t1105 0.0)
(t1106 0.0)
(t1107 0.0)
(t1108 0.0)
(t1109 0.0)
(t1110 0.0)
(t1111 0.0)
(t1112 0.0)
(t1113 0.0)
(t1114 0.0)
(t1115 0.0)
(t1116 0.0)
(t1117 0.0)
(t1118 0.0)
(t1119 0.0)
(t1120 0.0)
(t1121 0.0)
(t1122 0.0)
(t1123 0.0)
(t1124 0.0)
(t1125 0.0)
(t1126 0.0)
(t1127 0.0)
(t1128 0.0)
(t1129 0.0)
(t1130 0.0)
(t1131 0.0)
(t1132 0.0)
(t1133 0.0)
(t1134 0.0)
(t1135 0.0)
(t1136 0.0)
(t1137 0.0)
(t1138 0.0)
(t1139 0.0)
(t1140 0.0)
(t1141 0.0)
(t1142 0.0)
(t1143 0.0)
(t1144 0.0)
(t1145 0.0)
(t1146 0.0)
(t1147 0.0)
(t1148 0.0)
(t1149 0.0)
(t1150 0.0)
(t1151 0.0)
(t1152 0.0)
(t1153 0.0)
(t1154 0.0)
(t1155 0.0)
(t1156 0.0)
(t1157 0.0)
(t1158 0.0)
(t1159 0.0)
(t1160 0.0)
(t1161 0.0)
(t1162 0.0)
(t1163 0.0)
(t1164 0.0)
(t1165 0.0)
(t1166 0.0)
(t1167 0.0)
(t1168 0.0)
(t1169 0.0)
(t1170 0.0)
(t1171 0.0)
(t1172 0.0)
(t1173 0.0)
(t1174 0.0)
(t1175 0.0)
(t1176 0.0)
(t1177 0.0)
(t1178 0.0)
(t1179 0.0)
(t1180 0.0)
(t1181 0.0)
(t1182 0.0)
(t1183 0.0)
(t1184 0.0)
(t1185 0.0)
(t1186 0.0)
(t1187 0.0)
(t1188 0.0)
(t1189 0.0)
(t1190 0.0)
(t1191 0.0)
(t1192 0.0)
(t1193 0.0)
(t1194 0.0)
(t1195 0.0)
(t1196 0.0)
(t1197 0.0)
(t1198 0.0)
(t1199 0.0)
(t1200 0.0)
(t1201 0.0)
(t1202 0.0)
(t1203 0.0)
(t1204 0.0)
(t1205 0.0)
(t1206 0.0)
(t1207 0.0)
(t1208 0.0)
(t1209 0.0)
(t1210 0.0)
(t1211 0.0)
(t1212 0.0)
(t1213 0.0)
(t1214 0.0)
(t1215 0.0)
(t1216 0.0)
(t1217 0.0)
(t1218 0.0)
(t1219 0.0)
(t1220 0.0)
(t1221 0.0)
(t1222 0.0)
(t1223 0.0)
(t1224 0.0)
(t1225 0.0)
(t1226 0.0)
(t1227 0.0)
(t1228 0.0)
(t1229 0.0)
(t1230 0.0)
(t1231 0.0)
(t1232 0.0)
(t1233 0.0)
(t1234 0.0)
(t1235 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3442/3451 variables, and 1512 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5013 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1513 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 822/825 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/825 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 677/1502 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1502 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1928/3430 variables, 1502/1506 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3430 variables, 5/1511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3430 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/3432 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3432 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/3434 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3434 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/3436 variables, 1/1514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3436 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/3438 variables, 1/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3438 variables, 0/1515 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/3440 variables, 1/1516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3440 variables, 0/1516 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/3442 variables, 1/1517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3442 variables, 0/1517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 2/3444 variables, 1/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3444 variables, 0/1518 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 2/3446 variables, 1/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 0)
(t2 0)
(t3 0)
(t6 4)
(t7 4)
(t8 4)
(t9 4)
(t10 4)
(t11 4)
(t12 4)
(t13 4)
(t14 4)
(t15 4)
(t16 4)
(t17 4)
(t18 4)
(t19 4)
(t20 4)
(t21 4)
(t22 4)
(t23 4)
(t24 4)
(t25 4)
(t26 4)
(t27 4)
(t28 4)
(t29 4)
(t30 0)
(t31 0)
(t32 0)
(t33 0)
(t34 0)
(t35 0)
(t36 0)
(t37 0)
(t38 0)
(t39 0)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 0)
(t46 0)
(t47 0)
(t48 0)
(t49 0)
(t50 0)
(t51 0)
(t52 0)
(t53 0)
(t54 0)
(t55 0)
(t56 0)
(t57 0)
(t58 0)
(t59 0)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 0)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 0)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 4)
(t167 4)
(t168 4)
(t169 4)
(t170 0)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t178 0)
(t179 0)
(t180 0)
(t181 0)
(t182 0)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 4)
(t223 4)
(t224 4)
(t225 4)
(t226 0)
(t227 0)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 0)
(t238 0)
(t239 0)
(t240 0)
(t241 0)
(t242 0)
(t243 0)
(t244 0)
(t245 0)
(t246 0)
(t247 0)
(t248 0)
(t249 0)
(t250 0)
(t251 0)
(t252 0)
(t253 0)
(t254 0)
(t255 0)
(t256 0)
(t257 0)
(t258 0)
(t259 0)
(t260 0)
(t261 4)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 4)
(t272 0)
(t273 4)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 0)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 0)
(t308 0)
(t309 0)
(t310 0)
(t311 0)
(t312 0)
(t313 0)
(t314 0)
(t315 0)
(t316 0)
(t317 0)
(t318 0)
(t319 0)
(t320 0)
(t321 0)
(t322 0)
(t323 0)
(t324 0)
(t325 0)
(t326 0)
(t327 0)
(t328 0)
(t329 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 0)
(t338 0)
(t339 0)
(t340 0)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 0)
(t346 0)
(t347 0)
(t348 0)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 0)
(t354 0)
(t355 0)
(t356 0)
(t357 0)
(t358 0)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t363 0)
(t364 0)
(t365 0)
(t366 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 0)
(t374 0)
(t375 0)
(t376 0)
(t377 0)
(t378 0)
(t379 0)
(t380 0)
(t381 0)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 0)
(t389 0)
(t390 0)
(t391 0)
(t392 0)
(t393 0)
(t394 0)
(t395 0)
(t396 0)
(t397 0)
(t398 0)
(t399 0)
(t400 0)
(t401 0)
(t402 0)
(t403 0)
(t404 0)
(t405 0)
(t406 0)
(t407 0)
(t408 0)
(t409 0)
(t410 0)
(t411 0)
(t412 0)
(t413 0)
(t414 0)
(t415 0)
(t416 0)
(t417 0)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 0)
(t423 0)
(t424 0)
(t425 0)
(t426 0)
(t427 0)
(t428 0)
(t429 0)
(t430 0)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 0)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 4)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 4)
(t447 0)
(t448 0)
(t449 0)
(t450 0)
(t451 0)
(t452 0)
(t453 0)
(t454 0)
(t455 0)
(t456 0)
(t457 0)
(t458 0)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 0)
(t464 0)
(t465 0)
(t466 0)
(t467 0)
(t468 4)
(t469 4)
(t470 0)
(t471 0)
(t472 0)
(t473 0)
(t474 0)
(t475 0)
(t476 0)
(t477 0)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t482 0)
(t483 0)
(t484 0)
(t485 0)
(t486 4)
(t487 0)
(t488 0)
(t489 4)
(t490 4)
(t491 2)
(t492 2)
(t493 2)
(t494 2)
(t495 2)
(t496 0)
(t497 0)
(t498 0)
(t499 0)
(t500 0)
(t501 0)
(t502 0)
(t503 0)
(t504 0)
(t505 0)
(t506 0)
(t507 0)
(t508 0)
(t509 0)
(t510 0)
(t511 0)
(t512 0)
(t513 0)
(t514 0)
(t515 0)
(t516 0)
(t517 0)
(t518 0)
(t519 0)
(t520 0)
(t521 0)
(t522 0)
(t523 0)
(t524 0)
(t525 0)
(t526 0)
(t527 0)
(t528 0)
(t529 0)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t534 0)
(t535 0)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 0)
(t541 0)
(t542 0)
(t543 0)
(t544 0)
(t545 0)
(t546 0)
(t547 0)
(t548 0)
(t549 0)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 0)
(t559 0)
(t560 0)
(t561 0)
(t562 0)
(t563 0)
(t564 0)
(t565 0)
(t566 0)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 0)
(t573 0)
(t574 0)
(t575 0)
(t576 0)
(t577 0)
(t578 0)
(t579 0)
(t580 0)
(t581 0)
(t582 0)
(t583 0)
(t584 0)
(t585 0)
(t586 0)
(t587 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3446/3451 variables, and 1519 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1510/1513 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10033ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1513/1513 places, 1938/1938 transitions.
Graph (trivial) has 1845 edges and 1513 vertex of which 689 / 1513 are part of one of the 63 SCC in 2 ms
Free SCC test removed 626 places
Drop transitions (Empty/Sink Transition effects.) removed 791 transitions
Reduce isomorphic transitions removed 791 transitions.
Graph (complete) has 1319 edges and 887 vertex of which 878 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 501 rules applied. Total rules applied 503 place count 878 transition count 642
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 554 rules applied. Total rules applied 1057 place count 384 transition count 582
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1096 place count 345 transition count 582
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 1096 place count 345 transition count 533
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1194 place count 296 transition count 533
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1205 place count 285 transition count 517
Iterating global reduction 3 with 11 rules applied. Total rules applied 1216 place count 285 transition count 517
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1219 place count 285 transition count 514
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1222 place count 282 transition count 514
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1230 place count 274 transition count 504
Iterating global reduction 5 with 8 rules applied. Total rules applied 1238 place count 274 transition count 504
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1244 place count 274 transition count 498
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1246 place count 272 transition count 486
Iterating global reduction 6 with 2 rules applied. Total rules applied 1248 place count 272 transition count 486
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 1249 place count 272 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1250 place count 271 transition count 485
Performed 144 Post agglomeration using F-continuation condition with reduction of 100 identical transitions.
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 8 with 288 rules applied. Total rules applied 1538 place count 127 transition count 241
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 12 rules applied. Total rules applied 1550 place count 127 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1552 place count 126 transition count 228
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1555 place count 123 transition count 225
Iterating global reduction 10 with 3 rules applied. Total rules applied 1558 place count 123 transition count 225
Performed 12 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1582 place count 111 transition count 210
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1595 place count 111 transition count 197
Performed 32 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 11 with 64 rules applied. Total rules applied 1659 place count 79 transition count 231
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 11 with 55 rules applied. Total rules applied 1714 place count 79 transition count 176
Discarding 22 places :
Symmetric choice reduction at 12 with 22 rule applications. Total rules 1736 place count 57 transition count 154
Iterating global reduction 12 with 22 rules applied. Total rules applied 1758 place count 57 transition count 154
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1772 place count 57 transition count 140
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 1777 place count 52 transition count 130
Iterating global reduction 13 with 5 rules applied. Total rules applied 1782 place count 52 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1787 place count 52 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 14 with 33 rules applied. Total rules applied 1820 place count 52 transition count 92
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 1824 place count 48 transition count 82
Iterating global reduction 14 with 4 rules applied. Total rules applied 1828 place count 48 transition count 82
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1831 place count 45 transition count 79
Iterating global reduction 14 with 3 rules applied. Total rules applied 1834 place count 45 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1837 place count 45 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1840 place count 45 transition count 73
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 1843 place count 45 transition count 70
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1846 place count 42 transition count 70
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 1848 place count 42 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1849 place count 42 transition count 69
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1850 place count 42 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1851 place count 42 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1852 place count 41 transition count 67
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 39 edges and 40 vertex of which 25 / 40 are part of one of the 9 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 18 with 3 rules applied. Total rules applied 1855 place count 24 transition count 66
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 19 with 34 rules applied. Total rules applied 1889 place count 23 transition count 33
Discarding 3 places :
Symmetric choice reduction at 20 with 3 rule applications. Total rules 1892 place count 20 transition count 30
Iterating global reduction 20 with 3 rules applied. Total rules applied 1895 place count 20 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 20 with 6 rules applied. Total rules applied 1901 place count 17 transition count 27
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 20 with 7 rules applied. Total rules applied 1908 place count 17 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 1909 place count 17 transition count 19
Free-agglomeration rule applied 3 times.
Iterating global reduction 21 with 3 rules applied. Total rules applied 1912 place count 17 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 1915 place count 14 transition count 16
Applied a total of 1915 rules in 78 ms. Remains 14 /1513 variables (removed 1499) and now considering 16/1938 (removed 1922) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 14/1513 places, 16/1938 transitions.
RANDOM walk for 1099 steps (114 resets) in 5 ms. (183 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0 p2)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 20000 reset in 252 ms.
Product exploration explored 100000 steps with 20000 reset in 293 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 3 out of 1513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1513/1513 places, 1938/1938 transitions.
Graph (trivial) has 1845 edges and 1513 vertex of which 689 / 1513 are part of one of the 63 SCC in 6 ms
Free SCC test removed 626 places
Ensure Unique test removed 727 transitions
Reduce isomorphic transitions removed 727 transitions.
Graph (complete) has 1382 edges and 887 vertex of which 878 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 479 rules applied. Total rules applied 481 place count 878 transition count 1206
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 493 place count 878 transition count 1194
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 493 place count 878 transition count 1206
Deduced a syphon composed of 499 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 513 place count 878 transition count 1206
Discarding 285 places :
Symmetric choice reduction at 2 with 285 rule applications. Total rules 798 place count 593 transition count 911
Deduced a syphon composed of 230 places in 1 ms
Iterating global reduction 2 with 285 rules applied. Total rules applied 1083 place count 593 transition count 911
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1095 place count 581 transition count 895
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 1107 place count 581 transition count 895
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1113 place count 581 transition count 889
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1125 place count 569 transition count 877
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1137 place count 569 transition count 877
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1139 place count 567 transition count 873
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1141 place count 567 transition count 873
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1143 place count 565 transition count 869
Deduced a syphon composed of 218 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1145 place count 565 transition count 869
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1149 place count 561 transition count 865
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1153 place count 561 transition count 865
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1155 place count 559 transition count 861
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1157 place count 559 transition count 861
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1159 place count 557 transition count 857
Deduced a syphon composed of 216 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1161 place count 557 transition count 857
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1165 place count 553 transition count 851
Deduced a syphon composed of 214 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1169 place count 553 transition count 851
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1173 place count 549 transition count 835
Deduced a syphon composed of 212 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1177 place count 549 transition count 835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1178 place count 549 transition count 835
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1182 place count 545 transition count 831
Deduced a syphon composed of 211 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 1186 place count 545 transition count 831
Performed 106 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 317 places in 0 ms
Iterating global reduction 4 with 106 rules applied. Total rules applied 1292 place count 545 transition count 908
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1331 place count 545 transition count 869
Discarding 101 places :
Symmetric choice reduction at 5 with 101 rule applications. Total rules 1432 place count 444 transition count 757
Deduced a syphon composed of 226 places in 1 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 1533 place count 444 transition count 757
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1535 place count 444 transition count 755
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1541 place count 438 transition count 747
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 1547 place count 438 transition count 747
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 227 places in 1 ms
Iterating global reduction 6 with 7 rules applied. Total rules applied 1554 place count 438 transition count 747
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1558 place count 438 transition count 743
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1573 place count 423 transition count 724
Deduced a syphon composed of 216 places in 1 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1588 place count 423 transition count 724
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1595 place count 423 transition count 717
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1599 place count 419 transition count 713
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 8 with 4 rules applied. Total rules applied 1603 place count 419 transition count 713
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 215 places in 0 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 1606 place count 419 transition count 713
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1612 place count 419 transition count 707
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1615 place count 416 transition count 704
Deduced a syphon composed of 212 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 1618 place count 416 transition count 704
Performed 71 Post agglomeration using F-continuation condition with reduction of 115 identical transitions.
Deduced a syphon composed of 283 places in 1 ms
Iterating global reduction 9 with 71 rules applied. Total rules applied 1689 place count 416 transition count 1020
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 9 with 115 rules applied. Total rules applied 1804 place count 416 transition count 905
Discarding 126 places :
Symmetric choice reduction at 10 with 126 rule applications. Total rules 1930 place count 290 transition count 572
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 10 with 126 rules applied. Total rules applied 2056 place count 290 transition count 572
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 2071 place count 290 transition count 557
Discarding 25 places :
Symmetric choice reduction at 11 with 25 rule applications. Total rules 2096 place count 265 transition count 507
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 11 with 25 rules applied. Total rules applied 2121 place count 265 transition count 507
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2124 place count 265 transition count 557
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2127 place count 262 transition count 529
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2130 place count 262 transition count 529
Deduced a syphon composed of 141 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 11 with 48 rules applied. Total rules applied 2178 place count 262 transition count 481
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2182 place count 258 transition count 477
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 11 with 4 rules applied. Total rules applied 2186 place count 258 transition count 477
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2189 place count 258 transition count 537
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 2192 place count 255 transition count 522
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 11 with 3 rules applied. Total rules applied 2195 place count 255 transition count 522
Deduced a syphon composed of 137 places in 0 ms
Applied a total of 2195 rules in 384 ms. Remains 255 /1513 variables (removed 1258) and now considering 522/1938 (removed 1416) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:22:39] [INFO ] Redundant transitions in 29 ms returned []
Running 521 sub problems to find dead transitions.
[2025-05-30 08:22:39] [INFO ] Flow matrix only has 465 transitions (discarded 57 similar events)
// Phase 1: matrix 465 rows 255 cols
[2025-05-30 08:22:39] [INFO ] Computed 0 invariants in 2 ms
[2025-05-30 08:22:39] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 521 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
At refinement iteration 1 (OVERLAPS) 464/718 variables, 254/254 constraints. Problems are: Problem set: 251 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 2/256 constraints. Problems are: Problem set: 251 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/718 variables, 0/256 constraints. Problems are: Problem set: 251 solved, 270 unsolved
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/719 variables, 1/257 constraints. Problems are: Problem set: 261 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/719 variables, 0/257 constraints. Problems are: Problem set: 261 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 1/720 variables, 1/258 constraints. Problems are: Problem set: 261 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/720 variables, 0/258 constraints. Problems are: Problem set: 261 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 720/720 variables, and 258 constraints, problems are : Problem set: 261 solved, 260 unsolved in 30013 ms.
Refiners :[State Equation: 255/255 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 521/521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 261 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 261 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 461/578 variables, 117/117 constraints. Problems are: Problem set: 261 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 2/119 constraints. Problems are: Problem set: 261 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 260/379 constraints. Problems are: Problem set: 261 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/379 constraints. Problems are: Problem set: 261 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 141/719 variables, 138/517 constraints. Problems are: Problem set: 261 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/719 variables, 0/517 constraints. Problems are: Problem set: 261 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 1/720 variables, 1/518 constraints. Problems are: Problem set: 261 solved, 260 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 720/720 variables, and 518 constraints, problems are : Problem set: 261 solved, 260 unsolved in 30018 ms.
Refiners :[State Equation: 255/255 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 260/521 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 261 solved, 260 unsolved
Search for dead transitions found 261 dead transitions in 60145ms
Found 261 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 261 transitions
Dead transitions reduction (with SMT) removed 261 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 255/1513 places, 261/1938 transitions.
Graph (complete) has 400 edges and 255 vertex of which 118 are kept as prefixes of interest. Removing 137 places using SCC suffix rule.1 ms
Discarding 137 places :
Also discarding 0 output transitions
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 36 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 104 transition count 225
Applied a total of 15 rules in 10 ms. Remains 104 /255 variables (removed 151) and now considering 225/261 (removed 36) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/1513 places, 225/1938 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60581 ms. Remains : 104/1513 places, 225/1938 transitions.
Built C files in :
/tmp/ltsmin14362579126225170743
[2025-05-30 08:23:39] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14362579126225170743
Running compilation step : cd /tmp/ltsmin14362579126225170743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14362579126225170743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14362579126225170743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1513/1513 places, 1938/1938 transitions.
Applied a total of 0 rules in 50 ms. Remains 1513 /1513 variables (removed 0) and now considering 1938/1938 (removed 0) transitions.
// Phase 1: matrix 1938 rows 1513 cols
[2025-05-30 08:23:42] [INFO ] Computed 4 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:23:42] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-05-30 08:23:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:23:43] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 1937 sub problems to find dead transitions.
[2025-05-30 08:23:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1937/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1937 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1937 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3451 variables, and 4 constraints, problems are : Problem set: 0 solved, 1937 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60473ms problems are : Problem set: 0 solved, 1937 unsolved
Search for dead transitions found 0 dead transitions in 60477ms
Finished structural reductions in LTL mode , in 1 iterations and 61638 ms. Remains : 1513/1513 places, 1938/1938 transitions.
Built C files in :
/tmp/ltsmin12556855037608884222
[2025-05-30 08:24:44] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12556855037608884222
Running compilation step : cd /tmp/ltsmin12556855037608884222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12556855037608884222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12556855037608884222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 08:24:47] [INFO ] Flatten gal took : 53 ms
[2025-05-30 08:24:47] [INFO ] Flatten gal took : 47 ms
[2025-05-30 08:24:47] [INFO ] Time to serialize gal into /tmp/LTL7652022240203866678.gal : 15 ms
[2025-05-30 08:24:47] [INFO ] Time to serialize properties into /tmp/LTL15848846267919342159.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7652022240203866678.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16721837525043072118.hoa' '-atoms' '/tmp/LTL15848846267919342159.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15848846267919342159.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16721837525043072118.hoa
Detected timeout of ITS tools.
[2025-05-30 08:25:02] [INFO ] Flatten gal took : 44 ms
[2025-05-30 08:25:02] [INFO ] Flatten gal took : 43 ms
[2025-05-30 08:25:02] [INFO ] Time to serialize gal into /tmp/LTL3898626582039681681.gal : 8 ms
[2025-05-30 08:25:02] [INFO ] Time to serialize properties into /tmp/LTL17211032908515363308.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3898626582039681681.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17211032908515363308.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G((F("(p1111!=1)"))&&(F("(p793!=1)"))))||((F(("(p793!=1)")&&(F("(p1111!=1)"))))&&(X("(p1420!=1)")))))))))
Formula 0 simplified : XXXG(F(G!"(p1111!=1)" | G!"(p793!=1)") & (G(!"(p793!=1)" | G!"(p1111!=1)") | X!"(p1420!=1)"))
Detected timeout of ITS tools.
[2025-05-30 08:25:17] [INFO ] Flatten gal took : 41 ms
[2025-05-30 08:25:17] [INFO ] Applying decomposition
[2025-05-30 08:25:17] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7987487717629502421.txt' '-o' '/tmp/graph7987487717629502421.bin' '-w' '/tmp/graph7987487717629502421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7987487717629502421.bin' '-l' '-1' '-v' '-w' '/tmp/graph7987487717629502421.weights' '-q' '0' '-e' '0.001'
[2025-05-30 08:25:17] [INFO ] Decomposing Gal with order
[2025-05-30 08:25:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:25:18] [INFO ] Removed a total of 506 redundant transitions.
[2025-05-30 08:25:18] [INFO ] Flatten gal took : 121 ms
[2025-05-30 08:25:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 36 ms.
[2025-05-30 08:25:18] [INFO ] Time to serialize gal into /tmp/LTL3142809673712747220.gal : 19 ms
[2025-05-30 08:25:18] [INFO ] Time to serialize properties into /tmp/LTL11376351536097395657.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3142809673712747220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11376351536097395657.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G((F("(i9.i0.i2.u252.p1111!=1)"))&&(F("(i12.i0.i0.u172.p793!=1)"))))||((F(("(i12.i0.i0.u172.p793!=1)")&&(F("(i9.i0.i2.u252...205
Formula 0 simplified : XXXG(F(G!"(i9.i0.i2.u252.p1111!=1)" | G!"(i12.i0.i0.u172.p793!=1)") & (G(!"(i12.i0.i0.u172.p793!=1)" | G!"(i9.i0.i2.u252.p1111!=1)")...183
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t260, t320, t369, t440, t684, t736, t767, t796, t1157, t1224, t1228, t1240, t1271,...2117
Computing Next relation with stutter on 62480 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
316 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.32803,136848,1,0,229847,9871,19377,391033,618,76175,1018287
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-311-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudReconfiguration-PT-311-LTLFireability-00 finished in 311443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(X(p0)) U (p1 U G(p2))) U (p3 U p1))))'
Support contains 4 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1520 transition count 1948
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1520 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1520 transition count 1947
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 1514 transition count 1940
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 1514 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 1514 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 1511 transition count 1935
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 1511 transition count 1935
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 1508 transition count 1931
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 1508 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 1508 transition count 1930
Applied a total of 49 rules in 285 ms. Remains 1508 /1531 variables (removed 23) and now considering 1930/1960 (removed 30) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2025-05-30 08:25:22] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:25:22] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-05-30 08:25:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:25:23] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 08:25:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60413ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60417ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1531 places, 1930/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61831 ms. Remains : 1508/1531 places, 1930/1960 transitions.
Stuttering acceptance computed with spot in 653 ms :[(NOT p1), (NOT p0), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-02
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-02 finished in 62537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(p1)&&F(p2))))'
Support contains 3 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1519 transition count 1947
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1519 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1519 transition count 1946
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 1512 transition count 1938
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 1512 transition count 1938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 1512 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 1509 transition count 1933
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 1509 transition count 1933
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 1506 transition count 1929
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 1506 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 1506 transition count 1928
Applied a total of 53 rules in 302 ms. Remains 1506 /1531 variables (removed 25) and now considering 1928/1960 (removed 32) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 08:26:24] [INFO ] Computed 4 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:25] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-30 08:26:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:26:26] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 08:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1531 places, 1928/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61837 ms. Remains : 1506/1531 places, 1928/1960 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-03
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-03 finished in 62062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 1531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Graph (trivial) has 1867 edges and 1531 vertex of which 688 / 1531 are part of one of the 63 SCC in 2 ms
Free SCC test removed 625 places
Ensure Unique test removed 725 transitions
Reduce isomorphic transitions removed 725 transitions.
Graph (complete) has 1407 edges and 906 vertex of which 897 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 491 place count 896 transition count 740
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 513 rules applied. Total rules applied 1004 place count 407 transition count 716
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 1018 place count 395 transition count 714
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1020 place count 393 transition count 714
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1020 place count 393 transition count 668
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1112 place count 347 transition count 668
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1128 place count 331 transition count 641
Iterating global reduction 4 with 16 rules applied. Total rules applied 1144 place count 331 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 1148 place count 331 transition count 637
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1151 place count 328 transition count 637
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1160 place count 319 transition count 624
Iterating global reduction 6 with 9 rules applied. Total rules applied 1169 place count 319 transition count 624
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1174 place count 319 transition count 619
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1176 place count 317 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 1178 place count 317 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1180 place count 315 transition count 611
Iterating global reduction 7 with 2 rules applied. Total rules applied 1182 place count 315 transition count 611
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1184 place count 313 transition count 607
Iterating global reduction 7 with 2 rules applied. Total rules applied 1186 place count 313 transition count 607
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1188 place count 311 transition count 603
Iterating global reduction 7 with 2 rules applied. Total rules applied 1190 place count 311 transition count 603
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1192 place count 309 transition count 599
Iterating global reduction 7 with 2 rules applied. Total rules applied 1194 place count 309 transition count 599
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1195 place count 308 transition count 592
Iterating global reduction 7 with 1 rules applied. Total rules applied 1196 place count 308 transition count 592
Performed 145 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 7 with 290 rules applied. Total rules applied 1486 place count 163 transition count 367
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1499 place count 163 transition count 354
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1505 place count 157 transition count 343
Iterating global reduction 8 with 6 rules applied. Total rules applied 1511 place count 157 transition count 343
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1512 place count 156 transition count 342
Iterating global reduction 8 with 1 rules applied. Total rules applied 1513 place count 156 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1514 place count 156 transition count 341
Performed 12 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1538 place count 144 transition count 327
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1551 place count 144 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1553 place count 143 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1555 place count 143 transition count 311
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1589 place count 126 transition count 345
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 1606 place count 126 transition count 328
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1615 place count 117 transition count 310
Iterating global reduction 12 with 9 rules applied. Total rules applied 1624 place count 117 transition count 310
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1629 place count 117 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 13 with 37 rules applied. Total rules applied 1666 place count 117 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1667 place count 116 transition count 267
Applied a total of 1667 rules in 98 ms. Remains 116 /1531 variables (removed 1415) and now considering 267/1960 (removed 1693) transitions.
[2025-05-30 08:27:26] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
// Phase 1: matrix 210 rows 116 cols
[2025-05-30 08:27:26] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:27:27] [INFO ] Implicit Places using invariants in 512 ms returned []
[2025-05-30 08:27:27] [INFO ] Flow matrix only has 210 transitions (discarded 57 similar events)
[2025-05-30 08:27:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:27:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:27:27] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [40, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 641 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/1531 places, 267/1960 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 112 transition count 265
Applied a total of 4 rules in 5 ms. Remains 112 /114 variables (removed 2) and now considering 265/267 (removed 2) transitions.
[2025-05-30 08:27:27] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
// Phase 1: matrix 208 rows 112 cols
[2025-05-30 08:27:27] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:27:27] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-30 08:27:27] [INFO ] Flow matrix only has 208 transitions (discarded 57 similar events)
[2025-05-30 08:27:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:27:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:27:27] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/1531 places, 265/1960 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 987 ms. Remains : 112/1531 places, 265/1960 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-04
Stuttering criterion allowed to conclude after 63 steps with 10 reset in 1 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-04 finished in 1081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 3 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1520 transition count 1948
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1520 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1520 transition count 1947
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1513 transition count 1939
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1513 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 1513 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 1510 transition count 1934
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 1510 transition count 1934
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 1507 transition count 1930
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 1507 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 1507 transition count 1929
Applied a total of 51 rules in 297 ms. Remains 1507 /1531 variables (removed 24) and now considering 1929/1960 (removed 31) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2025-05-30 08:27:28] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:27:28] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-30 08:27:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:27:29] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2025-05-30 08:27:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1531 places, 1929/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61855 ms. Remains : 1507/1531 places, 1929/1960 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-06
Product exploration explored 100000 steps with 1014 reset in 324 ms.
Product exploration explored 100000 steps with 981 reset in 282 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (428 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (122 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (82 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (54 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (73 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 324878 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 4
Probabilistic random walk after 324878 steps, saw 88331 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2025-05-30 08:28:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 691/694 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/694 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 802/1496 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3433/3436 variables, and 1509 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1505/1507 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 691/694 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/694 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 802/1496 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 4/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3415 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/3417 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3417 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/3419 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3419 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/3421 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/3423 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3429/3436 variables, and 1511 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1503/1507 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10051ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Graph (trivial) has 1834 edges and 1507 vertex of which 693 / 1507 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 795 transitions
Reduce isomorphic transitions removed 795 transitions.
Graph (complete) has 1306 edges and 877 vertex of which 868 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 483 transitions
Trivial Post-agglo rules discarded 483 transitions
Performed 483 trivial Post agglomeration. Transition count delta: 483
Iterating post reduction 0 with 489 rules applied. Total rules applied 491 place count 868 transition count 641
Reduce places removed 483 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 541 rules applied. Total rules applied 1032 place count 385 transition count 583
Reduce places removed 38 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 41 rules applied. Total rules applied 1073 place count 347 transition count 580
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1076 place count 344 transition count 580
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1076 place count 344 transition count 530
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1176 place count 294 transition count 530
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1187 place count 283 transition count 514
Iterating global reduction 4 with 11 rules applied. Total rules applied 1198 place count 283 transition count 514
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1201 place count 283 transition count 511
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1204 place count 280 transition count 511
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1211 place count 273 transition count 503
Iterating global reduction 6 with 7 rules applied. Total rules applied 1218 place count 273 transition count 503
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1224 place count 273 transition count 497
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1225 place count 272 transition count 491
Iterating global reduction 7 with 1 rules applied. Total rules applied 1226 place count 272 transition count 491
Performed 143 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 7 with 286 rules applied. Total rules applied 1512 place count 129 transition count 252
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1527 place count 129 transition count 237
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1530 place count 126 transition count 234
Iterating global reduction 8 with 3 rules applied. Total rules applied 1533 place count 126 transition count 234
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1559 place count 113 transition count 218
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1574 place count 113 transition count 203
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1576 place count 112 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1578 place count 112 transition count 200
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1580 place count 111 transition count 199
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 1646 place count 78 transition count 230
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 1673 place count 78 transition count 203
Discarding 20 places :
Symmetric choice reduction at 11 with 20 rule applications. Total rules 1693 place count 58 transition count 163
Iterating global reduction 11 with 20 rules applied. Total rules applied 1713 place count 58 transition count 163
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 1724 place count 58 transition count 152
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1730 place count 52 transition count 140
Iterating global reduction 12 with 6 rules applied. Total rules applied 1736 place count 52 transition count 140
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1742 place count 52 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1743 place count 52 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1745 place count 51 transition count 132
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1747 place count 51 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1748 place count 50 transition count 131
Applied a total of 1748 rules in 61 ms. Remains 50 /1507 variables (removed 1457) and now considering 131/1929 (removed 1798) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 50/1507 places, 131/1929 transitions.
RANDOM walk for 40000 steps (5519 resets) in 90 ms. (439 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (913 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2025-05-30 08:28:43] [INFO ] Flow matrix only has 119 transitions (discarded 12 similar events)
// Phase 1: matrix 119 rows 50 cols
[2025-05-30 08:28:43] [INFO ] Computed 3 invariants in 0 ms
[2025-05-30 08:28:43] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 94/110 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 167/169 variables, and 49 constraints, problems are : Problem set: 1 solved, 0 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 48/50 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 184 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Graph (trivial) has 1834 edges and 1507 vertex of which 693 / 1507 are part of one of the 63 SCC in 1 ms
Free SCC test removed 630 places
Ensure Unique test removed 731 transitions
Reduce isomorphic transitions removed 731 transitions.
Graph (complete) has 1369 edges and 877 vertex of which 868 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 468 transitions
Trivial Post-agglo rules discarded 468 transitions
Performed 468 trivial Post agglomeration. Transition count delta: 468
Iterating post reduction 0 with 468 rules applied. Total rules applied 470 place count 867 transition count 724
Reduce places removed 468 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 492 rules applied. Total rules applied 962 place count 399 transition count 700
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 977 place count 387 transition count 697
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 980 place count 384 transition count 697
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 980 place count 384 transition count 650
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1074 place count 337 transition count 650
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1089 place count 322 transition count 626
Iterating global reduction 4 with 15 rules applied. Total rules applied 1104 place count 322 transition count 626
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1107 place count 322 transition count 623
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1110 place count 319 transition count 623
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1119 place count 310 transition count 611
Iterating global reduction 6 with 9 rules applied. Total rules applied 1128 place count 310 transition count 611
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1134 place count 310 transition count 605
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1135 place count 309 transition count 603
Iterating global reduction 7 with 1 rules applied. Total rules applied 1136 place count 309 transition count 603
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1137 place count 308 transition count 601
Iterating global reduction 7 with 1 rules applied. Total rules applied 1138 place count 308 transition count 601
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1139 place count 307 transition count 599
Iterating global reduction 7 with 1 rules applied. Total rules applied 1140 place count 307 transition count 599
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1141 place count 306 transition count 597
Iterating global reduction 7 with 1 rules applied. Total rules applied 1142 place count 306 transition count 597
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1143 place count 305 transition count 595
Iterating global reduction 7 with 1 rules applied. Total rules applied 1144 place count 305 transition count 595
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1145 place count 304 transition count 588
Iterating global reduction 7 with 1 rules applied. Total rules applied 1146 place count 304 transition count 588
Performed 138 Post agglomeration using F-continuation condition with reduction of 78 identical transitions.
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 7 with 276 rules applied. Total rules applied 1422 place count 166 transition count 372
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1433 place count 166 transition count 361
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1437 place count 162 transition count 356
Iterating global reduction 8 with 4 rules applied. Total rules applied 1441 place count 162 transition count 356
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1467 place count 149 transition count 340
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1481 place count 149 transition count 326
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1482 place count 148 transition count 324
Iterating global reduction 9 with 1 rules applied. Total rules applied 1483 place count 148 transition count 324
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1521 place count 129 transition count 361
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1543 place count 129 transition count 339
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1551 place count 121 transition count 323
Iterating global reduction 10 with 8 rules applied. Total rules applied 1559 place count 121 transition count 323
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1564 place count 121 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 11 with 41 rules applied. Total rules applied 1605 place count 121 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1606 place count 120 transition count 276
Applied a total of 1606 rules in 84 ms. Remains 120 /1507 variables (removed 1387) and now considering 276/1929 (removed 1653) transitions.
[2025-05-30 08:28:44] [INFO ] Flow matrix only has 217 transitions (discarded 59 similar events)
// Phase 1: matrix 217 rows 120 cols
[2025-05-30 08:28:44] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:28:44] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 08:28:44] [INFO ] Flow matrix only has 217 transitions (discarded 59 similar events)
[2025-05-30 08:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:28:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 08:28:44] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [14, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 167 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1507 places, 276/1929 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 116 transition count 274
Applied a total of 4 rules in 4 ms. Remains 116 /118 variables (removed 2) and now considering 274/276 (removed 2) transitions.
[2025-05-30 08:28:44] [INFO ] Flow matrix only has 215 transitions (discarded 59 similar events)
// Phase 1: matrix 215 rows 116 cols
[2025-05-30 08:28:44] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:28:44] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-30 08:28:44] [INFO ] Flow matrix only has 215 transitions (discarded 59 similar events)
[2025-05-30 08:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:28:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 08:28:44] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1507 places, 274/1929 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 408 ms. Remains : 116/1507 places, 274/1929 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 78 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (5070 resets) in 1030 ms. (38 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (184 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2025-05-30 08:28:45] [INFO ] Flow matrix only has 215 transitions (discarded 59 similar events)
[2025-05-30 08:28:45] [INFO ] Invariant cache hit.
[2025-05-30 08:28:45] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 219/294 variables, 86/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 35/329 variables, 26/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 330/331 variables, and 119 constraints, problems are : Problem set: 1 solved, 0 unsolved in 84 ms.
Refiners :[State Equation: 116/116 constraints, ReadFeed: 3/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 10 factoid took 195 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 10724 reset in 141 ms.
Product exploration explored 100000 steps with 10725 reset in 249 ms.
Built C files in :
/tmp/ltsmin8110540344262918985
[2025-05-30 08:28:46] [INFO ] Computing symmetric may disable matrix : 274 transitions.
[2025-05-30 08:28:46] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:28:46] [INFO ] Computing symmetric may enable matrix : 274 transitions.
[2025-05-30 08:28:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:28:46] [INFO ] Computing Do-Not-Accords matrix : 274 transitions.
[2025-05-30 08:28:46] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:28:46] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8110540344262918985
Running compilation step : cd /tmp/ltsmin8110540344262918985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 489 ms.
Running link step : cd /tmp/ltsmin8110540344262918985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8110540344262918985;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10021921990212542804.hoa' '--buchi-type=spotba'
LTSmin run took 1463 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-311-LTLFireability-06 finished in 80416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!p0)) U (p1 U p2))))'
Support contains 2 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1520 transition count 1948
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1520 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1520 transition count 1947
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 1514 transition count 1940
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 1514 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 1514 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 1511 transition count 1935
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 1511 transition count 1935
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 1508 transition count 1931
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 1508 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 1508 transition count 1930
Applied a total of 49 rules in 292 ms. Remains 1508 /1531 variables (removed 23) and now considering 1930/1960 (removed 30) transitions.
// Phase 1: matrix 1930 rows 1508 cols
[2025-05-30 08:28:48] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:28:48] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-30 08:28:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:28:49] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-30 08:28:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1531 places, 1930/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61858 ms. Remains : 1508/1531 places, 1930/1960 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (NOT p2), p0]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-08
Product exploration explored 100000 steps with 25037 reset in 320 ms.
Product exploration explored 100000 steps with 24981 reset in 354 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p2), (NOT p2), p0, false, false, false, false]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (424 resets) in 124 ms. (320 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (130 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (125 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (132 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (135 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (140 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
[2025-05-30 08:29:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 693/695 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/695 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 802/1497 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3417 variables, 1497/1501 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/3438 variables, 1/1512 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3438/3438 variables, and 1512 constraints, problems are : Problem set: 2 solved, 3 unsolved in 4780 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 693/695 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/695 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 802/1497 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3417 variables, 1497/1501 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3417 variables, 3/1504 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3417 variables, 0/1504 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/3419 variables, 1/1505 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3419 variables, 0/1505 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3421 variables, 1/1506 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3421 variables, 0/1506 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/3423 variables, 1/1507 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3423 variables, 0/1507 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/3425 variables, 1/1508 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3425 variables, 0/1508 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/3427 variables, 1/1509 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3427 variables, 0/1509 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/3429 variables, 1/1510 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3429 variables, 0/1510 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/3431 variables, 1/1511 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3431 variables, 0/1511 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/3433 variables, 1/1512 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3433 variables, 0/1512 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 2/3435 variables, 1/1513 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3435 variables, 0/1513 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 2/3437 variables, 1/1514 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3437 variables, 0/1514 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 1/3438 variables, 1/1515 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3438 variables, 0/1515 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 0/3438 variables, 0/1515 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3438/3438 variables, and 1515 constraints, problems are : Problem set: 2 solved, 3 unsolved in 4994 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9787ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 300 ms.
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Graph (trivial) has 1839 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 0 ms
Free SCC test removed 630 places
Drop transitions (Empty/Sink Transition effects.) removed 796 transitions
Reduce isomorphic transitions removed 796 transitions.
Graph (complete) has 1306 edges and 878 vertex of which 869 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 486 transitions
Trivial Post-agglo rules discarded 486 transitions
Performed 486 trivial Post agglomeration. Transition count delta: 486
Iterating post reduction 0 with 493 rules applied. Total rules applied 495 place count 869 transition count 637
Reduce places removed 486 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 546 rules applied. Total rules applied 1041 place count 383 transition count 577
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 40 rules applied. Total rules applied 1081 place count 344 transition count 576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1082 place count 343 transition count 576
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 1082 place count 343 transition count 526
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1182 place count 293 transition count 526
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 1193 place count 282 transition count 510
Iterating global reduction 4 with 11 rules applied. Total rules applied 1204 place count 282 transition count 510
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1207 place count 282 transition count 507
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1210 place count 279 transition count 507
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1218 place count 271 transition count 497
Iterating global reduction 6 with 8 rules applied. Total rules applied 1226 place count 271 transition count 497
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1232 place count 271 transition count 491
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1233 place count 270 transition count 485
Iterating global reduction 7 with 1 rules applied. Total rules applied 1234 place count 270 transition count 485
Performed 141 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 7 with 282 rules applied. Total rules applied 1516 place count 129 transition count 249
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1529 place count 129 transition count 236
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1532 place count 126 transition count 233
Iterating global reduction 8 with 3 rules applied. Total rules applied 1535 place count 126 transition count 233
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1561 place count 113 transition count 217
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1576 place count 113 transition count 202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1578 place count 112 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1580 place count 112 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1582 place count 111 transition count 198
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1584 place count 111 transition count 196
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 11 with 66 rules applied. Total rules applied 1650 place count 78 transition count 227
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 11 with 47 rules applied. Total rules applied 1697 place count 78 transition count 180
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 1720 place count 55 transition count 150
Iterating global reduction 12 with 23 rules applied. Total rules applied 1743 place count 55 transition count 150
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1757 place count 55 transition count 136
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 1763 place count 49 transition count 124
Iterating global reduction 13 with 6 rules applied. Total rules applied 1769 place count 49 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1775 place count 49 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 14 with 20 rules applied. Total rules applied 1795 place count 49 transition count 98
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1797 place count 47 transition count 92
Iterating global reduction 14 with 2 rules applied. Total rules applied 1799 place count 47 transition count 92
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1801 place count 45 transition count 90
Iterating global reduction 14 with 2 rules applied. Total rules applied 1803 place count 45 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1805 place count 45 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1807 place count 45 transition count 86
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 1811 place count 45 transition count 82
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1816 place count 41 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1817 place count 41 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1818 place count 41 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1819 place count 40 transition count 79
Applied a total of 1819 rules in 51 ms. Remains 40 /1508 variables (removed 1468) and now considering 79/1930 (removed 1851) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 40/1508 places, 79/1930 transitions.
RANDOM walk for 40000 steps (1301 resets) in 61 ms. (645 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (422 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2025-05-30 08:30:01] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 40 cols
[2025-05-30 08:30:01] [INFO ] Computed 4 invariants in 4 ms
[2025-05-30 08:30:01] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 08:30:01] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 17/114 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, State Equation: 0/40 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT p2)), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR p1 (NOT p2) p0))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 (NOT p2) (NOT p0))))]
Knowledge based reduction with 11 factoid took 318 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p2), p0, false, false, false, false]
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (NOT p2), p0, false, false, false, false]
// Phase 1: matrix 1930 rows 1508 cols
[2025-05-30 08:30:02] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 08:30:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 08:30:03] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2025-05-30 08:30:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 08:30:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 08:30:05] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2025-05-30 08:30:05] [INFO ] Computed and/alt/rep : 1923/2352/1923 causal constraints (skipped 6 transitions) in 83 ms.
Could not prove EG (NOT p2)
Support contains 2 out of 1508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Graph (trivial) has 1839 edges and 1508 vertex of which 693 / 1508 are part of one of the 63 SCC in 2 ms
Free SCC test removed 630 places
Ensure Unique test removed 732 transitions
Reduce isomorphic transitions removed 732 transitions.
Graph (complete) has 1369 edges and 878 vertex of which 869 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 471 rules applied. Total rules applied 473 place count 868 transition count 721
Reduce places removed 471 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 495 rules applied. Total rules applied 968 place count 397 transition count 697
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 980 place count 385 transition count 697
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 980 place count 385 transition count 650
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1074 place count 338 transition count 650
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 1090 place count 322 transition count 624
Iterating global reduction 3 with 16 rules applied. Total rules applied 1106 place count 322 transition count 624
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1109 place count 322 transition count 621
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1112 place count 319 transition count 621
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1122 place count 309 transition count 607
Iterating global reduction 5 with 10 rules applied. Total rules applied 1132 place count 309 transition count 607
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1138 place count 309 transition count 601
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1140 place count 307 transition count 597
Iterating global reduction 6 with 2 rules applied. Total rules applied 1142 place count 307 transition count 597
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1144 place count 305 transition count 593
Iterating global reduction 6 with 2 rules applied. Total rules applied 1146 place count 305 transition count 593
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1148 place count 303 transition count 589
Iterating global reduction 6 with 2 rules applied. Total rules applied 1150 place count 303 transition count 589
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1152 place count 301 transition count 585
Iterating global reduction 6 with 2 rules applied. Total rules applied 1154 place count 301 transition count 585
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1156 place count 299 transition count 581
Iterating global reduction 6 with 2 rules applied. Total rules applied 1158 place count 299 transition count 581
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1159 place count 298 transition count 574
Iterating global reduction 6 with 1 rules applied. Total rules applied 1160 place count 298 transition count 574
Performed 136 Post agglomeration using F-continuation condition with reduction of 77 identical transitions.
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 6 with 272 rules applied. Total rules applied 1432 place count 162 transition count 361
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1443 place count 162 transition count 350
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1447 place count 158 transition count 345
Iterating global reduction 7 with 4 rules applied. Total rules applied 1451 place count 158 transition count 345
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1477 place count 145 transition count 329
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1491 place count 145 transition count 315
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 1527 place count 127 transition count 349
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 1545 place count 127 transition count 331
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1554 place count 118 transition count 313
Iterating global reduction 9 with 9 rules applied. Total rules applied 1563 place count 118 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1569 place count 118 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 10 with 37 rules applied. Total rules applied 1606 place count 118 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1607 place count 117 transition count 269
Applied a total of 1607 rules in 69 ms. Remains 117 /1508 variables (removed 1391) and now considering 269/1930 (removed 1661) transitions.
[2025-05-30 08:30:18] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
// Phase 1: matrix 213 rows 117 cols
[2025-05-30 08:30:18] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:30:19] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-05-30 08:30:19] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
[2025-05-30 08:30:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:30:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 08:30:19] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [11, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 206 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1508 places, 269/1930 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 267
Applied a total of 4 rules in 5 ms. Remains 113 /115 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2025-05-30 08:30:19] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
// Phase 1: matrix 211 rows 113 cols
[2025-05-30 08:30:19] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:30:19] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-05-30 08:30:19] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2025-05-30 08:30:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:30:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 08:30:19] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1508 places, 267/1930 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 478 ms. Remains : 113/1508 places, 267/1930 transitions.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p1 p2 p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 110 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 297 ms :[(NOT p2), (NOT p2), p0, false, false, false, false]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (6051 resets) in 98 ms. (404 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (1491 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1463 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1487 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
[2025-05-30 08:30:19] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2025-05-30 08:30:19] [INFO ] Invariant cache hit.
[2025-05-30 08:30:19] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/43 variables, 4/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 140/183 variables, 25/31 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 136/319 variables, 78/110 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 2/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/323 variables, 4/116 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/324 variables, 1/117 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/324 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 117 constraints, problems are : Problem set: 2 solved, 1 unsolved in 135 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/43 variables, 4/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 140/183 variables, 25/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/319 variables, 78/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 2/113 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/113 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/323 variables, 4/117 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/324 variables, 1/118 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 0/118 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/324 variables, 0/118 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 118 constraints, problems are : Problem set: 2 solved, 1 unsolved in 142 ms.
Refiners :[State Equation: 113/113 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 267/267 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 113 transition count 204
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 70 place count 106 transition count 204
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 116 place count 83 transition count 181
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 127 place count 83 transition count 170
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 136 place count 74 transition count 161
Iterating global reduction 3 with 9 rules applied. Total rules applied 145 place count 74 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 148 place count 74 transition count 158
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 168 place count 64 transition count 148
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 178 place count 64 transition count 138
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 186 place count 56 transition count 128
Iterating global reduction 5 with 8 rules applied. Total rules applied 194 place count 56 transition count 128
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 202 place count 56 transition count 120
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 216 place count 49 transition count 121
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 226 place count 49 transition count 111
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 232 place count 43 transition count 103
Iterating global reduction 7 with 6 rules applied. Total rules applied 238 place count 43 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 244 place count 43 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 254 place count 43 transition count 87
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 256 place count 41 transition count 81
Iterating global reduction 8 with 2 rules applied. Total rules applied 258 place count 41 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 260 place count 41 transition count 79
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 262 place count 39 transition count 77
Iterating global reduction 9 with 2 rules applied. Total rules applied 264 place count 39 transition count 77
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 268 place count 39 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 270 place count 38 transition count 83
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 275 place count 38 transition count 78
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 281 place count 33 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 282 place count 33 transition count 76
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 283 place count 33 transition count 76
Applied a total of 283 rules in 25 ms. Remains 33 /113 variables (removed 80) and now considering 76/267 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 33/113 places, 76/267 transitions.
RANDOM walk for 40000 steps (1106 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (354 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Probably explored full state space saw : 1436 states, properties seen :0
Probabilistic random walk after 5494 steps, saw 1436 distinct states, run finished after 9 ms. (steps per millisecond=610 ) properties seen :0
Explored full state space saw : 1436 states, properties seen :0
Exhaustive walk after 5494 steps, saw 1436 distinct states, run finished after 15 ms. (steps per millisecond=366 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p2)), (X (NOT (AND p1 p2 p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR p1 (NOT p2) p0))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 (NOT p2) (NOT p0))))]
Knowledge based reduction with 20 factoid took 254 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter insensitive) to 7 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p2), (NOT p2), p0, false, false, false, false]
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (NOT p2), p0, false, false, false, false]
[2025-05-30 08:30:21] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2025-05-30 08:30:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 08:30:21] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-30 08:30:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 08:30:21] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-05-30 08:30:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 08:30:21] [INFO ] [Nat]Added 4 Read/Feed constraints in 5 ms returned sat
[2025-05-30 08:30:21] [INFO ] Computed and/alt/rep : 152/253/151 causal constraints (skipped 55 transitions) in 10 ms.
[2025-05-30 08:30:21] [INFO ] Added : 30 causal constraints over 11 iterations in 154 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (NOT p2), p0, false, false, false, false]
Stuttering criterion allowed to conclude after 7 steps with 2 reset in 1 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-08 finished in 93561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Graph (trivial) has 1870 edges and 1531 vertex of which 692 / 1531 are part of one of the 63 SCC in 0 ms
Free SCC test removed 629 places
Ensure Unique test removed 730 transitions
Reduce isomorphic transitions removed 730 transitions.
Graph (complete) has 1402 edges and 902 vertex of which 893 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 489 transitions
Trivial Post-agglo rules discarded 489 transitions
Performed 489 trivial Post agglomeration. Transition count delta: 489
Iterating post reduction 0 with 489 rules applied. Total rules applied 491 place count 892 transition count 735
Reduce places removed 489 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 513 rules applied. Total rules applied 1004 place count 403 transition count 711
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 1017 place count 391 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1018 place count 390 transition count 710
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1018 place count 390 transition count 666
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1106 place count 346 transition count 666
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1122 place count 330 transition count 639
Iterating global reduction 4 with 16 rules applied. Total rules applied 1138 place count 330 transition count 639
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 1142 place count 330 transition count 635
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1145 place count 327 transition count 635
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1154 place count 318 transition count 622
Iterating global reduction 6 with 9 rules applied. Total rules applied 1163 place count 318 transition count 622
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1168 place count 318 transition count 617
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1170 place count 316 transition count 613
Iterating global reduction 7 with 2 rules applied. Total rules applied 1172 place count 316 transition count 613
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1174 place count 314 transition count 609
Iterating global reduction 7 with 2 rules applied. Total rules applied 1176 place count 314 transition count 609
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1178 place count 312 transition count 605
Iterating global reduction 7 with 2 rules applied. Total rules applied 1180 place count 312 transition count 605
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1182 place count 310 transition count 601
Iterating global reduction 7 with 2 rules applied. Total rules applied 1184 place count 310 transition count 601
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1186 place count 308 transition count 597
Iterating global reduction 7 with 2 rules applied. Total rules applied 1188 place count 308 transition count 597
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1189 place count 307 transition count 590
Iterating global reduction 7 with 1 rules applied. Total rules applied 1190 place count 307 transition count 590
Performed 145 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 7 with 290 rules applied. Total rules applied 1480 place count 162 transition count 361
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1492 place count 162 transition count 349
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1498 place count 156 transition count 338
Iterating global reduction 8 with 6 rules applied. Total rules applied 1504 place count 156 transition count 338
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1505 place count 155 transition count 337
Iterating global reduction 8 with 1 rules applied. Total rules applied 1506 place count 155 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1507 place count 155 transition count 336
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1533 place count 142 transition count 320
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1546 place count 142 transition count 307
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 10 with 34 rules applied. Total rules applied 1580 place count 125 transition count 341
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 1597 place count 125 transition count 324
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 1606 place count 116 transition count 306
Iterating global reduction 11 with 9 rules applied. Total rules applied 1615 place count 116 transition count 306
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1621 place count 116 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 12 with 36 rules applied. Total rules applied 1657 place count 116 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1658 place count 115 transition count 263
Applied a total of 1658 rules in 69 ms. Remains 115 /1531 variables (removed 1416) and now considering 263/1960 (removed 1697) transitions.
[2025-05-30 08:30:21] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
// Phase 1: matrix 206 rows 115 cols
[2025-05-30 08:30:21] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:30:22] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-30 08:30:22] [INFO ] Flow matrix only has 206 transitions (discarded 57 similar events)
[2025-05-30 08:30:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:30:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:30:22] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [41, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 331 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/1531 places, 263/1960 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 111 transition count 261
Applied a total of 4 rules in 4 ms. Remains 111 /113 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2025-05-30 08:30:22] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
// Phase 1: matrix 204 rows 111 cols
[2025-05-30 08:30:22] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:30:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-30 08:30:22] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2025-05-30 08:30:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:30:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:30:22] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/1531 places, 261/1960 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 554 ms. Remains : 111/1531 places, 261/1960 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-10
Product exploration explored 100000 steps with 12875 reset in 105 ms.
Product exploration explored 100000 steps with 12660 reset in 108 ms.
Computed a total of 3 stabilizing places and 17 stable transitions
Computed a total of 3 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (6173 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1436 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8737 steps, run visited all 1 properties in 24 ms. (steps per millisecond=364 )
Probabilistic random walk after 8737 steps, saw 2733 distinct states, run finished after 27 ms. (steps per millisecond=323 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 261/261 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2025-05-30 08:30:23] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2025-05-30 08:30:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:30:23] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 08:30:23] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2025-05-30 08:30:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:30:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:30:23] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 08:30:23] [INFO ] Redundant transitions in 22 ms returned []
Running 256 sub problems to find dead transitions.
[2025-05-30 08:30:23] [INFO ] Flow matrix only has 204 transitions (discarded 57 similar events)
[2025-05-30 08:30:23] [INFO ] Invariant cache hit.
[2025-05-30 08:30:23] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 203/313 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/314 variables, 1/113 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/113 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 1/315 variables, 1/114 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/114 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/114 constraints. Problems are: Problem set: 10 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 114 constraints, problems are : Problem set: 10 solved, 246 unsolved in 15640 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 246 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 203/313 variables, 110/110 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 2/112 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 246/358 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/358 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 1/314 variables, 1/359 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/359 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 7 (OVERLAPS) 1/315 variables, 1/360 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/360 constraints. Problems are: Problem set: 10 solved, 246 unsolved
At refinement iteration 9 (OVERLAPS) 0/315 variables, 0/360 constraints. Problems are: Problem set: 10 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 360 constraints, problems are : Problem set: 10 solved, 246 unsolved in 26052 ms.
Refiners :[State Equation: 111/111 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 246/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41747ms problems are : Problem set: 10 solved, 246 unsolved
Search for dead transitions found 10 dead transitions in 41748ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 251/261 transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 36 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 97 transition count 215
Applied a total of 14 rules in 10 ms. Remains 97 /111 variables (removed 14) and now considering 215/251 (removed 36) transitions.
[2025-05-30 08:31:04] [INFO ] Flow matrix only has 166 transitions (discarded 49 similar events)
// Phase 1: matrix 166 rows 97 cols
[2025-05-30 08:31:04] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:31:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-30 08:31:05] [INFO ] Flow matrix only has 166 transitions (discarded 49 similar events)
[2025-05-30 08:31:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:31:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 08:31:05] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/111 places, 215/261 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42069 ms. Remains : 97/111 places, 215/261 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (6138 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1396 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8737 steps, run visited all 1 properties in 12 ms. (steps per millisecond=728 )
Probabilistic random walk after 8737 steps, saw 2733 distinct states, run finished after 12 ms. (steps per millisecond=728 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12803 reset in 105 ms.
Product exploration explored 100000 steps with 12778 reset in 99 ms.
Built C files in :
/tmp/ltsmin468914132972850742
[2025-05-30 08:31:05] [INFO ] Computing symmetric may disable matrix : 215 transitions.
[2025-05-30 08:31:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:31:05] [INFO ] Computing symmetric may enable matrix : 215 transitions.
[2025-05-30 08:31:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:31:05] [INFO ] Computing Do-Not-Accords matrix : 215 transitions.
[2025-05-30 08:31:05] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 08:31:05] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin468914132972850742
Running compilation step : cd /tmp/ltsmin468914132972850742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 374 ms.
Running link step : cd /tmp/ltsmin468914132972850742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin468914132972850742;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6060575335238396749.hoa' '--buchi-type=spotba'
LTSmin run took 583 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudReconfiguration-PT-311-LTLFireability-10 finished in 45249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X((p1&&F(G(p2)))))) U X(p2))))'
Support contains 3 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1520 transition count 1948
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1520 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1520 transition count 1947
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1513 transition count 1939
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1513 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 1513 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 1510 transition count 1934
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 1510 transition count 1934
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 1507 transition count 1930
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 1507 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 1507 transition count 1929
Applied a total of 51 rules in 294 ms. Remains 1507 /1531 variables (removed 24) and now considering 1929/1960 (removed 31) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2025-05-30 08:31:07] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:31:07] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-30 08:31:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:31:08] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2025-05-30 08:31:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1531 places, 1929/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61826 ms. Remains : 1507/1531 places, 1929/1960 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-11 finished in 62141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(p1)))'
Support contains 1 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1520 transition count 1948
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1520 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1520 transition count 1947
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 1513 transition count 1939
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 1513 transition count 1939
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 1513 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 1510 transition count 1934
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 1510 transition count 1934
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 1507 transition count 1930
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 1507 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 1507 transition count 1929
Applied a total of 51 rules in 297 ms. Remains 1507 /1531 variables (removed 24) and now considering 1929/1960 (removed 31) transitions.
// Phase 1: matrix 1929 rows 1507 cols
[2025-05-30 08:32:09] [INFO ] Computed 4 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:32:09] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-05-30 08:32:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:32:10] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2025-05-30 08:32:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1531 places, 1929/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61854 ms. Remains : 1507/1531 places, 1929/1960 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-12 finished in 62028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0))) U (p0&&X(X(G(p0)))))))'
Support contains 1 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1519 transition count 1947
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1519 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1519 transition count 1946
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 1512 transition count 1938
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 1512 transition count 1938
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 1512 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 1509 transition count 1933
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 1509 transition count 1933
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 1506 transition count 1929
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 1506 transition count 1929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 1506 transition count 1928
Applied a total of 53 rules in 289 ms. Remains 1506 /1531 variables (removed 25) and now considering 1928/1960 (removed 32) transitions.
// Phase 1: matrix 1928 rows 1506 cols
[2025-05-30 08:33:11] [INFO ] Computed 4 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:33:11] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-30 08:33:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:33:12] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2025-05-30 08:33:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3434 variables, and 4 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60421ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1531 places, 1928/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61819 ms. Remains : 1506/1531 places, 1928/1960 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-13 finished in 62002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(p1)))&&F(p2)))'
Support contains 3 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1520 transition count 1948
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1520 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1520 transition count 1947
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 1514 transition count 1940
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 1514 transition count 1940
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 1514 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 1512 transition count 1936
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 1512 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 1510 transition count 1933
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 1510 transition count 1933
Applied a total of 44 rules in 296 ms. Remains 1510 /1531 variables (removed 21) and now considering 1933/1960 (removed 27) transitions.
// Phase 1: matrix 1933 rows 1510 cols
[2025-05-30 08:34:13] [INFO ] Computed 4 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:34:13] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-30 08:34:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:34:14] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2025-05-30 08:34:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3443 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1531 places, 1933/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61850 ms. Remains : 1510/1531 places, 1933/1960 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-14
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-311-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-311-LTLFireability-14 finished in 62052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||(p2&&X(F(p3)))))))'
Support contains 3 out of 1531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1531/1531 places, 1960/1960 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1521 transition count 1950
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1521 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 1521 transition count 1949
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 1515 transition count 1942
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 1515 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 1512 transition count 1938
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 1512 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 1509 transition count 1934
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 1509 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 1509 transition count 1933
Applied a total of 46 rules in 291 ms. Remains 1509 /1531 variables (removed 22) and now considering 1933/1960 (removed 27) transitions.
// Phase 1: matrix 1933 rows 1509 cols
[2025-05-30 08:35:15] [INFO ] Computed 4 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:35:15] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-05-30 08:35:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 08:35:16] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2025-05-30 08:35:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60422ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1531 places, 1933/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61983 ms. Remains : 1509/1531 places, 1933/1960 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-311-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 382 ms.
Product exploration explored 100000 steps with 50000 reset in 381 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2110 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT p0))), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 21 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-311-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-311-LTLFireability-15 finished in 63066 ms.
All properties solved by simple procedures.
Total runtime 1051765 ms.

BK_STOP 1748594178304

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

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