Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067000204.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 DLCround-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067000204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 1.1M 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 DLCround-PT-08b-LTLFireability-00
FORMULA_NAME DLCround-PT-08b-LTLFireability-01
FORMULA_NAME DLCround-PT-08b-LTLFireability-02
FORMULA_NAME DLCround-PT-08b-LTLFireability-03
FORMULA_NAME DLCround-PT-08b-LTLFireability-04
FORMULA_NAME DLCround-PT-08b-LTLFireability-05
FORMULA_NAME DLCround-PT-08b-LTLFireability-06
FORMULA_NAME DLCround-PT-08b-LTLFireability-07
FORMULA_NAME DLCround-PT-08b-LTLFireability-08
FORMULA_NAME DLCround-PT-08b-LTLFireability-09
FORMULA_NAME DLCround-PT-08b-LTLFireability-10
FORMULA_NAME DLCround-PT-08b-LTLFireability-11
FORMULA_NAME DLCround-PT-08b-LTLFireability-12
FORMULA_NAME DLCround-PT-08b-LTLFireability-13
FORMULA_NAME DLCround-PT-08b-LTLFireability-14
FORMULA_NAME DLCround-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748673816503

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 06:43:37] [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-31 06:43:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:43:37] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2025-05-31 06:43:37] [INFO ] Transformed 3088 places.
[2025-05-31 06:43:37] [INFO ] Transformed 4732 transitions.
[2025-05-31 06:43:37] [INFO ] Found NUPN structural information;
[2025-05-31 06:43:37] [INFO ] Parsed PT model containing 3088 places and 4732 transitions and 13004 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DLCround-PT-08b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-08b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 3088 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3088/3088 places, 4732/4732 transitions.
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 540 place count 2548 transition count 4192
Iterating global reduction 0 with 540 rules applied. Total rules applied 1080 place count 2548 transition count 4192
Discarding 429 places :
Symmetric choice reduction at 0 with 429 rule applications. Total rules 1509 place count 2119 transition count 3763
Iterating global reduction 0 with 429 rules applied. Total rules applied 1938 place count 2119 transition count 3763
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 1946 place count 2119 transition count 3755
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 2002 place count 2063 transition count 3630
Iterating global reduction 1 with 56 rules applied. Total rules applied 2058 place count 2063 transition count 3630
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 2092 place count 2029 transition count 3596
Iterating global reduction 1 with 34 rules applied. Total rules applied 2126 place count 2029 transition count 3596
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 2129 place count 2029 transition count 3593
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 2149 place count 2009 transition count 3573
Iterating global reduction 2 with 20 rules applied. Total rules applied 2169 place count 2009 transition count 3573
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 2189 place count 1989 transition count 3553
Iterating global reduction 2 with 20 rules applied. Total rules applied 2209 place count 1989 transition count 3553
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 2229 place count 1969 transition count 3533
Iterating global reduction 2 with 20 rules applied. Total rules applied 2249 place count 1969 transition count 3533
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 2260 place count 1958 transition count 3522
Iterating global reduction 2 with 11 rules applied. Total rules applied 2271 place count 1958 transition count 3522
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2278 place count 1951 transition count 3515
Iterating global reduction 2 with 7 rules applied. Total rules applied 2285 place count 1951 transition count 3515
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2292 place count 1944 transition count 3508
Iterating global reduction 2 with 7 rules applied. Total rules applied 2299 place count 1944 transition count 3508
Applied a total of 2299 rules in 1307 ms. Remains 1944 /3088 variables (removed 1144) and now considering 3508/4732 (removed 1224) transitions.
// Phase 1: matrix 3508 rows 1944 cols
[2025-05-31 06:43:39] [INFO ] Computed 157 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:43:41] [INFO ] Implicit Places using invariants in 1774 ms returned []
[2025-05-31 06:43:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:43:43] [INFO ] Implicit Places using invariants and state equation in 2449 ms returned []
Implicit Place search using SMT with State Equation took 4254 ms to find 0 implicit places.
Running 3507 sub problems to find dead transitions.
[2025-05-31 06:43: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: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1943/5452 variables, and 0 constraints, problems are : Problem set: 0 solved, 3507 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1944 constraints, PredecessorRefiner: 3507/3507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3507 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1943/5452 variables, and 0 constraints, problems are : Problem set: 0 solved, 3507 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1944 constraints, PredecessorRefiner: 0/3507 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61637ms problems are : Problem set: 0 solved, 3507 unsolved
Search for dead transitions found 0 dead transitions in 61664ms
Starting structural reductions in LTL mode, iteration 1 : 1944/3088 places, 3508/4732 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67258 ms. Remains : 1944/3088 places, 3508/4732 transitions.
Support contains 45 out of 1944 places after structural reductions.
[2025-05-31 06:44:45] [INFO ] Flatten gal took : 192 ms
[2025-05-31 06:44:46] [INFO ] Flatten gal took : 130 ms
[2025-05-31 06:44:46] [INFO ] Input system was already deterministic with 3508 transitions.
Support contains 44 out of 1944 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (8 resets) in 1507 ms. (26 steps per ms) remains 4/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
[2025-05-31 06:44:46] [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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 498/509 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/509 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1435/1944 variables, 147/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1944 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3508/5452 variables, 1944/2101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5452 variables, 0/2101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/5452 variables, 0/2101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5452/5452 variables, and 2101 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1484 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1944/1944 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 498/509 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/509 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1435/1944 variables, 147/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1944 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3508/5452 variables, 1944/2101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5452 variables, 4/2105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:44:50] [INFO ] Deduced a trap composed of 84 places in 575 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:44:51] [INFO ] Deduced a trap composed of 124 places in 720 ms of which 237 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:44:51] [INFO ] Deduced a trap composed of 129 places in 464 ms of which 45 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/5452 variables, 3/2108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5452 variables, 0/2108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5452/5452 variables, and 2108 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1944/1944 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6528ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 1944 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Graph (trivial) has 1720 edges and 1944 vertex of which 485 / 1944 are part of one of the 40 SCC in 6 ms
Free SCC test removed 445 places
Drop transitions (Empty/Sink Transition effects.) removed 507 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 521 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 311 rules applied. Total rules applied 312 place count 1499 transition count 2676
Reduce places removed 311 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 353 rules applied. Total rules applied 665 place count 1188 transition count 2634
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 692 place count 1161 transition count 2634
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 692 place count 1161 transition count 2480
Deduced a syphon composed of 154 places in 8 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 1000 place count 1007 transition count 2480
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 1065 place count 942 transition count 2031
Iterating global reduction 3 with 65 rules applied. Total rules applied 1130 place count 942 transition count 2031
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1134 place count 942 transition count 2027
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1134 place count 942 transition count 2023
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1142 place count 938 transition count 2023
Performed 355 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 355 places in 2 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 4 with 710 rules applied. Total rules applied 1852 place count 583 transition count 1661
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1861 place count 583 transition count 1652
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1885 place count 559 transition count 1376
Iterating global reduction 5 with 24 rules applied. Total rules applied 1909 place count 559 transition count 1376
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1931 place count 559 transition count 1354
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -351
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 2005 place count 522 transition count 1705
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 2025 place count 522 transition count 1685
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 2044 place count 503 transition count 1247
Iterating global reduction 7 with 19 rules applied. Total rules applied 2063 place count 503 transition count 1247
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 2081 place count 503 transition count 1229
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2089 place count 499 transition count 1258
Drop transitions (Redundant composition of simpler transitions.) removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 8 with 130 rules applied. Total rules applied 2219 place count 499 transition count 1128
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 2228 place count 490 transition count 1018
Iterating global reduction 8 with 9 rules applied. Total rules applied 2237 place count 490 transition count 1018
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 2245 place count 490 transition count 1010
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2253 place count 486 transition count 1043
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 2259 place count 486 transition count 1037
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 2281 place count 486 transition count 1015
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2289 place count 482 transition count 1042
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2295 place count 482 transition count 1036
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 2316 place count 482 transition count 1015
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2324 place count 478 transition count 1042
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2330 place count 478 transition count 1036
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 2351 place count 478 transition count 1015
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2359 place count 474 transition count 1042
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2365 place count 474 transition count 1036
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 2386 place count 474 transition count 1015
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2394 place count 470 transition count 1042
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2400 place count 470 transition count 1036
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 2421 place count 470 transition count 1015
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2429 place count 466 transition count 1046
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2435 place count 466 transition count 1040
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 2456 place count 466 transition count 1019
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2464 place count 462 transition count 1051
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2470 place count 462 transition count 1045
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 16 with 22 rules applied. Total rules applied 2492 place count 462 transition count 1023
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2500 place count 458 transition count 1052
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2506 place count 458 transition count 1046
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 17 with 23 rules applied. Total rules applied 2529 place count 458 transition count 1023
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2537 place count 454 transition count 1051
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2543 place count 454 transition count 1045
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 18 with 22 rules applied. Total rules applied 2565 place count 454 transition count 1023
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2573 place count 450 transition count 1054
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2579 place count 450 transition count 1048
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2600 place count 450 transition count 1027
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2608 place count 446 transition count 1058
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2614 place count 446 transition count 1052
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2635 place count 446 transition count 1031
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2643 place count 442 transition count 1058
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2649 place count 442 transition count 1052
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2670 place count 442 transition count 1031
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2678 place count 438 transition count 1058
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2684 place count 438 transition count 1052
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2705 place count 438 transition count 1031
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2713 place count 434 transition count 1058
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2719 place count 434 transition count 1052
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2740 place count 434 transition count 1031
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 2748 place count 430 transition count 1058
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 2754 place count 430 transition count 1052
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 2775 place count 430 transition count 1031
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 2783 place count 426 transition count 1058
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 2789 place count 426 transition count 1052
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 25 with 21 rules applied. Total rules applied 2810 place count 426 transition count 1031
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 2818 place count 422 transition count 1059
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 25 with 5 rules applied. Total rules applied 2823 place count 422 transition count 1054
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 26 with 21 rules applied. Total rules applied 2844 place count 422 transition count 1033
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 2852 place count 418 transition count 1065
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 2856 place count 418 transition count 1061
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 27 with 20 rules applied. Total rules applied 2876 place count 418 transition count 1041
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 2884 place count 414 transition count 1066
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2888 place count 414 transition count 1062
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 28 with 19 rules applied. Total rules applied 2907 place count 414 transition count 1043
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 2915 place count 410 transition count 1063
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 2919 place count 410 transition count 1059
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 29 with 20 rules applied. Total rules applied 2939 place count 410 transition count 1039
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 2947 place count 406 transition count 1058
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 2951 place count 406 transition count 1054
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 2970 place count 406 transition count 1035
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 2978 place count 402 transition count 1055
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 2982 place count 402 transition count 1051
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 31 with 20 rules applied. Total rules applied 3002 place count 402 transition count 1031
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 3010 place count 398 transition count 1056
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 3014 place count 398 transition count 1052
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 3033 place count 398 transition count 1033
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 3041 place count 394 transition count 1061
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 3045 place count 394 transition count 1057
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 33 with 20 rules applied. Total rules applied 3065 place count 394 transition count 1037
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 3073 place count 390 transition count 1056
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 3077 place count 390 transition count 1052
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 3096 place count 390 transition count 1033
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 3104 place count 386 transition count 1052
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 3108 place count 386 transition count 1048
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 3127 place count 386 transition count 1029
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 3135 place count 382 transition count 1057
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 3139 place count 382 transition count 1053
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 36 with 20 rules applied. Total rules applied 3159 place count 382 transition count 1033
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 3167 place count 378 transition count 1058
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 3171 place count 378 transition count 1054
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 3190 place count 378 transition count 1035
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 37 with 8 rules applied. Total rules applied 3198 place count 374 transition count 1055
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 3202 place count 374 transition count 1051
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 38 with 20 rules applied. Total rules applied 3222 place count 374 transition count 1031
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 38 with 8 rules applied. Total rules applied 3230 place count 370 transition count 1050
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 3234 place count 370 transition count 1046
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 39 with 19 rules applied. Total rules applied 3253 place count 370 transition count 1027
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 39 with 8 rules applied. Total rules applied 3261 place count 366 transition count 1046
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3265 place count 366 transition count 1042
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 40 with 18 rules applied. Total rules applied 3283 place count 366 transition count 1024
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 40 with 6 rules applied. Total rules applied 3289 place count 363 transition count 1041
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 40 with 3 rules applied. Total rules applied 3292 place count 363 transition count 1038
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 41 with 17 rules applied. Total rules applied 3309 place count 363 transition count 1021
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 41 with 6 rules applied. Total rules applied 3315 place count 360 transition count 1038
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 41 with 3 rules applied. Total rules applied 3318 place count 360 transition count 1035
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 42 with 17 rules applied. Total rules applied 3335 place count 360 transition count 1018
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 42 with 6 rules applied. Total rules applied 3341 place count 357 transition count 1036
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 42 with 3 rules applied. Total rules applied 3344 place count 357 transition count 1033
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 43 with 18 rules applied. Total rules applied 3362 place count 357 transition count 1015
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 43 with 2 rules applied. Total rules applied 3364 place count 356 transition count 1018
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 43 with 1 rules applied. Total rules applied 3365 place count 356 transition count 1017
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 44 with 3 rules applied. Total rules applied 3368 place count 356 transition count 1014
Free-agglomeration rule applied 40 times with reduction of 5 identical transitions.
Iterating global reduction 44 with 40 rules applied. Total rules applied 3408 place count 356 transition count 969
Reduce places removed 40 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 329 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 330 transitions.
Graph (complete) has 985 edges and 316 vertex of which 230 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.1 ms
Discarding 86 places :
Also discarding 0 output transitions
Iterating post reduction 44 with 371 rules applied. Total rules applied 3779 place count 230 transition count 639
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 45 with 88 rules applied. Total rules applied 3867 place count 230 transition count 551
Drop transitions (Redundant composition of simpler transitions.) removed 81 transitions
Redundant transition composition rules discarded 81 transitions
Iterating global reduction 46 with 81 rules applied. Total rules applied 3948 place count 230 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 46 with 1 rules applied. Total rules applied 3949 place count 229 transition count 469
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 46 with 5 rules applied. Total rules applied 3954 place count 224 transition count 469
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 47 with 72 rules applied. Total rules applied 4026 place count 176 transition count 445
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 47 with 63 rules applied. Total rules applied 4089 place count 176 transition count 382
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 48 with 99 rules applied. Total rules applied 4188 place count 110 transition count 349
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 102 transitions.
Graph (trivial) has 13 edges and 110 vertex of which 12 / 110 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 48 with 103 rules applied. Total rules applied 4291 place count 104 transition count 247
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 210 edges and 100 vertex of which 68 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Iterating post reduction 49 with 92 rules applied. Total rules applied 4383 place count 68 transition count 144
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 50 with 16 rules applied. Total rules applied 4399 place count 68 transition count 128
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 51 with 12 rules applied. Total rules applied 4411 place count 60 transition count 124
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 51 with 8 rules applied. Total rules applied 4419 place count 60 transition count 116
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 52 with 33 rules applied. Total rules applied 4452 place count 38 transition count 105
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 52 with 36 rules applied. Total rules applied 4488 place count 38 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 53 with 14 rules applied. Total rules applied 4502 place count 38 transition count 55
Graph (complete) has 85 edges and 38 vertex of which 32 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 53 with 1 rules applied. Total rules applied 4503 place count 32 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 54 with 9 rules applied. Total rules applied 4512 place count 32 transition count 46
Applied a total of 4512 rules in 1713 ms. Remains 32 /1944 variables (removed 1912) and now considering 46/3508 (removed 3462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1713 ms. Remains : 32/1944 places, 46/3508 transitions.
RANDOM walk for 26725 steps (6 resets) in 155 ms. (171 steps per ms) remains 0/4 properties
Computed a total of 324 stabilizing places and 324 stable transitions
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 (G(p1) U X(p2)))||(F(p3) U p2))))'
Support contains 4 out of 1944 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1929 transition count 3471
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1929 transition count 3471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1929 transition count 3470
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 1921 transition count 3451
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 1921 transition count 3451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1920 transition count 3450
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1920 transition count 3450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1919 transition count 3449
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1919 transition count 3449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1918 transition count 3448
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1918 transition count 3448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1917 transition count 3447
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1917 transition count 3447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1916 transition count 3446
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1916 transition count 3446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 1915 transition count 3445
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 1915 transition count 3445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 1914 transition count 3444
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 1914 transition count 3444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 1913 transition count 3443
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 1913 transition count 3443
Applied a total of 63 rules in 626 ms. Remains 1913 /1944 variables (removed 31) and now considering 3443/3508 (removed 65) transitions.
// Phase 1: matrix 3443 rows 1913 cols
[2025-05-31 06:44:56] [INFO ] Computed 157 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:44:57] [INFO ] Implicit Places using invariants in 876 ms returned []
[2025-05-31 06:44:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:44:59] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 3031 ms to find 0 implicit places.
Running 3442 sub problems to find dead transitions.
[2025-05-31 06:44:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1912/5356 variables, and 0 constraints, problems are : Problem set: 0 solved, 3442 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1913 constraints, PredecessorRefiner: 3442/3442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3442 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1912/5356 variables, and 0 constraints, problems are : Problem set: 0 solved, 3442 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1913 constraints, PredecessorRefiner: 0/3442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61308ms problems are : Problem set: 0 solved, 3442 unsolved
Search for dead transitions found 0 dead transitions in 61319ms
Starting structural reductions in LTL mode, iteration 1 : 1913/1944 places, 3443/3508 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64988 ms. Remains : 1913/1944 places, 3443/3508 transitions.
Stuttering acceptance computed with spot in 435 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-00
Product exploration explored 100000 steps with 26 reset in 533 ms.
Product exploration explored 100000 steps with 29 reset in 535 ms.
Computed a total of 310 stabilizing places and 310 stable transitions
Computed a total of 310 stabilizing places and 310 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 142 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p3) (NOT p1))]
RANDOM walk for 35851 steps (7 resets) in 594 ms. (60 steps per ms) remains 0/14 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2 p3))), (F p2), (F p3), (F (NOT (AND (NOT p1) (NOT p3)))), (F p0), (F (NOT (OR (NOT p1) p3)))]
Knowledge based reduction with 27 factoid took 626 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p3) (NOT p1))]
[2025-05-31 06:46:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:46:06] [INFO ] [Real]Absence check using 157 positive place invariants in 995 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p2) (NOT p3))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p1), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2 p3))), (F p2), (F p3), (F (NOT (AND (NOT p1) (NOT p3)))), (F p0), (F (NOT (OR (NOT p1) p3))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 27 factoid took 629 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-08b-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-08b-LTLFireability-00 finished in 71356 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))) U X((p2 U p3)))))'
Support contains 6 out of 1944 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1929 transition count 3470
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1929 transition count 3470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1929 transition count 3469
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 1921 transition count 3450
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 1921 transition count 3450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1921 transition count 3449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1920 transition count 3448
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1920 transition count 3448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1919 transition count 3447
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1919 transition count 3447
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1918 transition count 3446
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1918 transition count 3446
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1917 transition count 3445
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1917 transition count 3445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1916 transition count 3444
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1916 transition count 3444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1915 transition count 3443
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1915 transition count 3443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1914 transition count 3442
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1914 transition count 3442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1913 transition count 3441
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1913 transition count 3441
Applied a total of 64 rules in 629 ms. Remains 1913 /1944 variables (removed 31) and now considering 3441/3508 (removed 67) transitions.
// Phase 1: matrix 3441 rows 1913 cols
[2025-05-31 06:46:07] [INFO ] Computed 157 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:46:08] [INFO ] Implicit Places using invariants in 944 ms returned []
[2025-05-31 06:46:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:46:10] [INFO ] Implicit Places using invariants and state equation in 2167 ms returned []
Implicit Place search using SMT with State Equation took 3115 ms to find 0 implicit places.
Running 3440 sub problems to find dead transitions.
[2025-05-31 06:46: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: ((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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1912/5354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3440 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1913 constraints, PredecessorRefiner: 3440/3440 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3440 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1912/5354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3440 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1913 constraints, PredecessorRefiner: 0/3440 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61288ms problems are : Problem set: 0 solved, 3440 unsolved
Search for dead transitions found 0 dead transitions in 61299ms
Starting structural reductions in LTL mode, iteration 1 : 1913/1944 places, 3441/3508 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65055 ms. Remains : 1913/1944 places, 3441/3508 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), true, (NOT p3), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-01 finished in 65422 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((X(p1)||(!p1 U (G(!p1)||(!p1&&G(p2))))||p0)))))'
Support contains 5 out of 1944 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1929 transition count 3481
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1929 transition count 3481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1929 transition count 3480
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 1921 transition count 3461
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 1921 transition count 3461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1921 transition count 3460
Applied a total of 48 rules in 189 ms. Remains 1921 /1944 variables (removed 23) and now considering 3460/3508 (removed 48) transitions.
// Phase 1: matrix 3460 rows 1921 cols
[2025-05-31 06:47:12] [INFO ] Computed 157 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:47:13] [INFO ] Implicit Places using invariants in 902 ms returned []
[2025-05-31 06:47:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:47:15] [INFO ] Implicit Places using invariants and state equation in 2166 ms returned []
Implicit Place search using SMT with State Equation took 3074 ms to find 0 implicit places.
Running 3459 sub problems to find dead transitions.
[2025-05-31 06:47:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1920/5381 variables, and 0 constraints, problems are : Problem set: 0 solved, 3459 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1921 constraints, PredecessorRefiner: 3459/3459 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3459 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1920/5381 variables, and 0 constraints, problems are : Problem set: 0 solved, 3459 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1921 constraints, PredecessorRefiner: 0/3459 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61268ms problems are : Problem set: 0 solved, 3459 unsolved
Search for dead transitions found 0 dead transitions in 61273ms
Starting structural reductions in LTL mode, iteration 1 : 1921/1944 places, 3460/3508 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64547 ms. Remains : 1921/1944 places, 3460/3508 transitions.
Stuttering acceptance computed with spot in 340 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 523 ms.
Product exploration explored 100000 steps with 0 reset in 670 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1921 stabilizing places and 319/3460 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 317 ms. (125 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
[2025-05-31 06:48:19] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 301/306 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1921 variables, 152/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1921 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3460/5381 variables, 1921/2078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5381 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/5381 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5381/5381 variables, and 2078 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1491 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1921/1921 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 301/306 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1921 variables, 152/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1921 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3460/5381 variables, 1921/2078 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5381 variables, 4/2082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5381 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/5381 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5381/5381 variables, and 2082 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3045 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1921/1921 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4568ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 71152 steps, including 97 resets, run visited all 4 properties in 614 ms. (steps per millisecond=115 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 621 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 452 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 335 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Support contains 5 out of 1921 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1921/1921 places, 3460/3460 transitions.
Applied a total of 0 rules in 59 ms. Remains 1921 /1921 variables (removed 0) and now considering 3460/3460 (removed 0) transitions.
[2025-05-31 06:48:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:48:26] [INFO ] Implicit Places using invariants in 977 ms returned []
[2025-05-31 06:48:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:48:28] [INFO ] Implicit Places using invariants and state equation in 2180 ms returned []
Implicit Place search using SMT with State Equation took 3161 ms to find 0 implicit places.
Running 3459 sub problems to find dead transitions.
[2025-05-31 06:48:28] [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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 timeout
1.0)
(s497 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1920/5381 variables, and 0 constraints, problems are : Problem set: 0 solved, 3459 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1921 constraints, PredecessorRefiner: 3459/3459 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3459 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1920/5381 variables, and 0 constraints, problems are : Problem set: 0 solved, 3459 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1921 constraints, PredecessorRefiner: 0/3459 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61384ms problems are : Problem set: 0 solved, 3459 unsolved
Search for dead transitions found 0 dead transitions in 61390ms
Finished structural reductions in LTL mode , in 1 iterations and 64626 ms. Remains : 1921/1921 places, 3460/3460 transitions.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1921 stabilizing places and 319/3460 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 144 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 392 ms. (101 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
[2025-05-31 06:49:31] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 301/306 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1921 variables, 152/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1921 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3460/5381 variables, 1921/2078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5381 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/5381 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5381/5381 variables, and 2078 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1921/1921 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 301/306 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1615/1921 variables, 152/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1921 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3460/5381 variables, 1921/2078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5381 variables, 2/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:49:33] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/5381 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5381 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/5381 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5381/5381 variables, and 2081 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2516 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1921/1921 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3681ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 503 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=71 )
Parikh walk visited 2 properties in 8 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 438 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 352 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 363 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 507 ms.
Product exploration explored 100000 steps with 0 reset in 568 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 319 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Support contains 5 out of 1921 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1921/1921 places, 3460/3460 transitions.
Graph (trivial) has 1702 edges and 1921 vertex of which 483 / 1921 are part of one of the 40 SCC in 5 ms
Free SCC test removed 443 places
Ensure Unique test removed 478 transitions
Reduce isomorphic transitions removed 478 transitions.
Performed 302 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 302 rules applied. Total rules applied 303 place count 1478 transition count 2982
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 26 rules applied. Total rules applied 329 place count 1478 transition count 2969
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 329 place count 1478 transition count 2973
Deduced a syphon composed of 324 places in 9 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 338 place count 1478 transition count 2973
Discarding 149 places :
Symmetric choice reduction at 2 with 149 rule applications. Total rules 487 place count 1329 transition count 2407
Deduced a syphon composed of 236 places in 8 ms
Iterating global reduction 2 with 149 rules applied. Total rules applied 636 place count 1329 transition count 2407
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 640 place count 1329 transition count 2403
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 734 places in 0 ms
Iterating global reduction 3 with 498 rules applied. Total rules applied 1138 place count 1329 transition count 2411
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1146 place count 1329 transition count 2403
Renaming transitions due to excessive name length > 1024 char.
Discarding 365 places :
Symmetric choice reduction at 4 with 365 rule applications. Total rules 1511 place count 964 transition count 1808
Deduced a syphon composed of 391 places in 0 ms
Iterating global reduction 4 with 365 rules applied. Total rules applied 1876 place count 964 transition count 1808
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 1898 place count 964 transition count 1786
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1907 place count 955 transition count 1777
Deduced a syphon composed of 382 places in 1 ms
Iterating global reduction 5 with 9 rules applied. Total rules applied 1916 place count 955 transition count 1777
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -195
Deduced a syphon composed of 411 places in 1 ms
Iterating global reduction 5 with 29 rules applied. Total rules applied 1945 place count 955 transition count 1972
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1962 place count 955 transition count 1955
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 2003 place count 914 transition count 1800
Deduced a syphon composed of 374 places in 0 ms
Iterating global reduction 6 with 41 rules applied. Total rules applied 2044 place count 914 transition count 1800
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2052 place count 914 transition count 1792
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2060 place count 906 transition count 1776
Deduced a syphon composed of 366 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2068 place count 906 transition count 1776
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 370 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2072 place count 906 transition count 1812
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2076 place count 902 transition count 1804
Deduced a syphon composed of 366 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2080 place count 902 transition count 1804
Deduced a syphon composed of 366 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 2118 place count 902 transition count 1766
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2134 place count 886 transition count 1734
Deduced a syphon composed of 366 places in 1 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 2150 place count 886 transition count 1734
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 2166 place count 870 transition count 1536
Deduced a syphon composed of 366 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 2182 place count 870 transition count 1536
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 2205 place count 870 transition count 1513
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 2220 place count 855 transition count 1491
Deduced a syphon composed of 351 places in 0 ms
Iterating global reduction 8 with 15 rules applied. Total rules applied 2235 place count 855 transition count 1491
Deduced a syphon composed of 351 places in 0 ms
Applied a total of 2235 rules in 1124 ms. Remains 855 /1921 variables (removed 1066) and now considering 1491/3460 (removed 1969) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:49:39] [INFO ] Redundant transitions in 100 ms returned []
Running 1490 sub problems to find dead transitions.
[2025-05-31 06:49:39] [INFO ] Flow matrix only has 1464 transitions (discarded 27 similar events)
// Phase 1: matrix 1464 rows 855 cols
[2025-05-31 06:49:39] [INFO ] Computed 157 invariants in 34 ms
[2025-05-31 06:49:39] [INFO ] State equation strengthened by 186 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 854/2319 variables, and 0 constraints, problems are : Problem set: 0 solved, 1490 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/855 constraints, ReadFeed: 0/186 constraints, PredecessorRefiner: 1490/1214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1490 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 854/2319 variables, and 0 constraints, problems are : Problem set: 0 solved, 1490 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/855 constraints, ReadFeed: 0/186 constraints, PredecessorRefiner: 276/1214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60881ms problems are : Problem set: 0 solved, 1490 unsolved
Search for dead transitions found 0 dead transitions in 60883ms
Starting structural reductions in SI_LTL mode, iteration 1 : 855/1921 places, 1491/3460 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62116 ms. Remains : 855/1921 places, 1491/3460 transitions.
Built C files in :
/tmp/ltsmin17243587875481130924
[2025-05-31 06:50:40] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17243587875481130924
Running compilation step : cd /tmp/ltsmin17243587875481130924;'/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/ltsmin17243587875481130924;'/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/ltsmin17243587875481130924;'/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 5 out of 1921 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1921/1921 places, 3460/3460 transitions.
Applied a total of 0 rules in 73 ms. Remains 1921 /1921 variables (removed 0) and now considering 3460/3460 (removed 0) transitions.
// Phase 1: matrix 3460 rows 1921 cols
[2025-05-31 06:50:43] [INFO ] Computed 157 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:50:44] [INFO ] Implicit Places using invariants in 905 ms returned []
[2025-05-31 06:50:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:50:46] [INFO ] Implicit Places using invariants and state equation in 2139 ms returned []
Implicit Place search using SMT with State Equation took 3046 ms to find 0 implicit places.
Running 3459 sub problems to find dead transitions.
[2025-05-31 06:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1920/5381 variables, and 0 constraints, problems are : Problem set: 0 solved, 3459 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1921 constraints, PredecessorRefiner: 3459/3459 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3459 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1920/5381 variables, and 0 constraints, problems are : Problem set: 0 solved, 3459 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1921 constraints, PredecessorRefiner: 0/3459 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61268ms problems are : Problem set: 0 solved, 3459 unsolved
Search for dead transitions found 0 dead transitions in 61274ms
Finished structural reductions in LTL mode , in 1 iterations and 64404 ms. Remains : 1921/1921 places, 3460/3460 transitions.
Built C files in :
/tmp/ltsmin2351804578582422042
[2025-05-31 06:51:47] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2351804578582422042
Running compilation step : cd /tmp/ltsmin2351804578582422042;'/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/ltsmin2351804578582422042;'/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/ltsmin2351804578582422042;'/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-31 06:51:50] [INFO ] Flatten gal took : 85 ms
[2025-05-31 06:51:50] [INFO ] Flatten gal took : 83 ms
[2025-05-31 06:51:50] [INFO ] Time to serialize gal into /tmp/LTL16782736673565355884.gal : 29 ms
[2025-05-31 06:51:50] [INFO ] Time to serialize properties into /tmp/LTL16131955385792783928.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/LTL16782736673565355884.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15668453213325206165.hoa' '-atoms' '/tmp/LTL16131955385792783928.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...320
Loading property file /tmp/LTL16131955385792783928.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15668453213325206165.hoa
Detected timeout of ITS tools.
[2025-05-31 06:52:06] [INFO ] Flatten gal took : 77 ms
[2025-05-31 06:52:06] [INFO ] Flatten gal took : 78 ms
[2025-05-31 06:52:06] [INFO ] Time to serialize gal into /tmp/LTL11911429798130706947.gal : 16 ms
[2025-05-31 06:52:06] [INFO ] Time to serialize properties into /tmp/LTL15157496935240117715.ltl : 2 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/LTL11911429798130706947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15157496935240117715.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((p1055==0)||(p2804==0))")||((X("((p503==1)&&(p2424==1))"))||((!("((p503==1)&&(p2424==1))"))U((G(!("((p503==1)&&(p2424==1))...219
Formula 0 simplified : XXF(!"((p1055==0)||(p2804==0))" & X!"((p503==1)&&(p2424==1))" & (F!"(p210!=1)" U "((p503==1)&&(p2424==1))"))
Detected timeout of ITS tools.
[2025-05-31 06:52:21] [INFO ] Flatten gal took : 68 ms
[2025-05-31 06:52:21] [INFO ] Applying decomposition
[2025-05-31 06:52:21] [INFO ] Flatten gal took : 71 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/graph5732781532868207499.txt' '-o' '/tmp/graph5732781532868207499.bin' '-w' '/tmp/graph5732781532868207499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5732781532868207499.bin' '-l' '-1' '-v' '-w' '/tmp/graph5732781532868207499.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:52:21] [INFO ] Decomposing Gal with order
[2025-05-31 06:52:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:52:22] [INFO ] Removed a total of 3247 redundant transitions.
[2025-05-31 06:52:22] [INFO ] Flatten gal took : 240 ms
[2025-05-31 06:52:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 80 ms.
[2025-05-31 06:52:22] [INFO ] Time to serialize gal into /tmp/LTL12222756714692573852.gal : 23 ms
[2025-05-31 06:52:22] [INFO ] Time to serialize properties into /tmp/LTL3686825945747831983.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/LTL12222756714692573852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3686825945747831983.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(G(("((i12.u267.p1055==0)||(i12.u664.p2804==0))")||((X("((i5.u101.p503==1)&&(i5.u589.p2424==1))"))||((!("((i5.u101.p503==1)&&(i5...314
Formula 0 simplified : XXF(!"((i12.u267.p1055==0)||(i12.u664.p2804==0))" & X!"((i5.u101.p503==1)&&(i5.u589.p2424==1))" & (F!"(i2.i2.i0.u45.p210!=1)" U "((i...194
Detected timeout of ITS tools.
Treatment of property DLCround-PT-08b-LTLFireability-02 finished in 325135 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(F((p0&&F(G(p1))))) U G(!p2)))'
Support contains 4 out of 1944 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Graph (trivial) has 1722 edges and 1944 vertex of which 471 / 1944 are part of one of the 41 SCC in 3 ms
Free SCC test removed 430 places
Ensure Unique test removed 463 transitions
Reduce isomorphic transitions removed 463 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 315 place count 1513 transition count 2730
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 353 rules applied. Total rules applied 668 place count 1199 transition count 2691
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 27 rules applied. Total rules applied 695 place count 1174 transition count 2689
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 697 place count 1172 transition count 2689
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 155 Pre rules applied. Total rules applied 697 place count 1172 transition count 2534
Deduced a syphon composed of 155 places in 7 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 4 with 310 rules applied. Total rules applied 1007 place count 1017 transition count 2534
Discarding 66 places :
Symmetric choice reduction at 4 with 66 rule applications. Total rules 1073 place count 951 transition count 2051
Iterating global reduction 4 with 66 rules applied. Total rules applied 1139 place count 951 transition count 2051
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1143 place count 951 transition count 2047
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 1143 place count 951 transition count 2043
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1151 place count 947 transition count 2043
Performed 360 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 360 places in 1 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 5 with 720 rules applied. Total rules applied 1871 place count 587 transition count 1675
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1880 place count 587 transition count 1666
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1904 place count 563 transition count 1390
Iterating global reduction 6 with 24 rules applied. Total rules applied 1928 place count 563 transition count 1390
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 1949 place count 563 transition count 1369
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 7 with 2 rules applied. Total rules applied 1951 place count 562 transition count 1368
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1979 place count 548 transition count 1487
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1984 place count 548 transition count 1482
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1988 place count 544 transition count 1406
Iterating global reduction 8 with 4 rules applied. Total rules applied 1992 place count 544 transition count 1406
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1996 place count 544 transition count 1402
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2004 place count 540 transition count 1432
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 9 with 35 rules applied. Total rules applied 2039 place count 540 transition count 1397
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 2055 place count 524 transition count 1365
Iterating global reduction 9 with 16 rules applied. Total rules applied 2071 place count 524 transition count 1365
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 2087 place count 508 transition count 1169
Iterating global reduction 9 with 16 rules applied. Total rules applied 2103 place count 508 transition count 1169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 2119 place count 508 transition count 1153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2120 place count 507 transition count 1152
Applied a total of 2120 rules in 301 ms. Remains 507 /1944 variables (removed 1437) and now considering 1152/3508 (removed 2356) transitions.
[2025-05-31 06:52:37] [INFO ] Flow matrix only has 1123 transitions (discarded 29 similar events)
// Phase 1: matrix 1123 rows 507 cols
[2025-05-31 06:52:37] [INFO ] Computed 157 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:52:38] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-31 06:52:38] [INFO ] Flow matrix only has 1123 transitions (discarded 29 similar events)
[2025-05-31 06:52:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:52:38] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 06:52:38] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:52:38] [INFO ] Redundant transitions in 22 ms returned []
Running 1085 sub problems to find dead transitions.
[2025-05-31 06:52:38] [INFO ] Flow matrix only has 1123 transitions (discarded 29 similar events)
[2025-05-31 06:52:38] [INFO ] Invariant cache hit.
[2025-05-31 06:52:38] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (OVERLAPS) 2/507 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/1630 variables, and 157 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/507 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (OVERLAPS) 2/507 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1085 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 507/1630 variables, and 157 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/507 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 0/1085 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 60624ms
Starting structural reductions in SI_LTL mode, iteration 1 : 507/1944 places, 1152/3508 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61672 ms. Remains : 507/1944 places, 1152/3508 transitions.
Stuttering acceptance computed with spot in 211 ms :[p2, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p1), (NOT p0)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-03
Product exploration explored 100000 steps with 33236 reset in 921 ms.
Product exploration explored 100000 steps with 33403 reset in 951 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X p0), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 117 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[p2, (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p0)]
RANDOM walk for 6543 steps (1 resets) in 246 ms. (26 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT p2)), (X p0), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 8 factoid took 305 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[p2, (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[p2, (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p0)]
Support contains 4 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 1152/1152 transitions.
Applied a total of 0 rules in 37 ms. Remains 507 /507 variables (removed 0) and now considering 1152/1152 (removed 0) transitions.
[2025-05-31 06:53:42] [INFO ] Flow matrix only has 1123 transitions (discarded 29 similar events)
[2025-05-31 06:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:53:42] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-05-31 06:53:42] [INFO ] Flow matrix only has 1123 transitions (discarded 29 similar events)
[2025-05-31 06:53:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:53:42] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 06:53:43] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:53:43] [INFO ] Redundant transitions in 16 ms returned []
Running 1085 sub problems to find dead transitions.
[2025-05-31 06:53:43] [INFO ] Flow matrix only has 1123 transitions (discarded 29 similar events)
[2025-05-31 06:53:43] [INFO ] Invariant cache hit.
[2025-05-31 06:53:43] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (OVERLAPS) 2/507 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/1630 variables, and 157 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/507 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 1085/1085 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (OVERLAPS) 2/507 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(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 1)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 1)
(s80 0)
(s81 0)
(s82 1)
(s83 1)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 timeout
1)
(s132 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/1630 variables, and 157 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/507 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 0/1085 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60672ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 60674ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61433 ms. Remains : 507/507 places, 1152/1152 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[p2, (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p0)]
RANDOM walk for 17229 steps (3 resets) in 148 ms. (115 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p0), (X p1), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT p1)), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 13 factoid took 364 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[p2, (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[p2, (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[p2, (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p0)]
Stuttering criterion allowed to conclude after 610 steps with 0 reset in 10 ms.
FORMULA DLCround-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-03 finished in 127567 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 G((F(p2)&&p1))))'
Support contains 3 out of 1944 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1927 transition count 3468
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1927 transition count 3468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1927 transition count 3467
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 1918 transition count 3447
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 1918 transition count 3447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 1918 transition count 3446
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1917 transition count 3445
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1917 transition count 3445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1916 transition count 3444
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1916 transition count 3444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1915 transition count 3443
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1915 transition count 3443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1914 transition count 3442
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1914 transition count 3442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1913 transition count 3441
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1913 transition count 3441
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1912 transition count 3440
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1912 transition count 3440
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1911 transition count 3439
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1911 transition count 3439
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 1910 transition count 3438
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 1910 transition count 3438
Applied a total of 70 rules in 744 ms. Remains 1910 /1944 variables (removed 34) and now considering 3438/3508 (removed 70) transitions.
// Phase 1: matrix 3438 rows 1910 cols
[2025-05-31 06:54:45] [INFO ] Computed 157 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:54:46] [INFO ] Implicit Places using invariants in 890 ms returned []
[2025-05-31 06:54:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:54:48] [INFO ] Implicit Places using invariants and state equation in 2131 ms returned []
Implicit Place search using SMT with State Equation took 3025 ms to find 0 implicit places.
Running 3437 sub problems to find dead transitions.
[2025-05-31 06:54:48] [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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 timeout
1.0)
(s1635 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1909/5348 variables, and 0 constraints, problems are : Problem set: 0 solved, 3437 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1910 constraints, PredecessorRefiner: 3437/3437 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3437 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1909/5348 variables, and 0 constraints, problems are : Problem set: 0 solved, 3437 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1910 constraints, PredecessorRefiner: 0/3437 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61254ms problems are : Problem set: 0 solved, 3437 unsolved
Search for dead transitions found 0 dead transitions in 61259ms
Starting structural reductions in LTL mode, iteration 1 : 1910/1944 places, 3438/3508 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65039 ms. Remains : 1910/1944 places, 3438/3508 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-07
Product exploration explored 100000 steps with 8 reset in 475 ms.
Product exploration explored 100000 steps with 8 reset in 560 ms.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 121 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 18686 steps (3 resets) in 150 ms. (123 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 256 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
[2025-05-31 06:55:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:55:55] [INFO ] [Real]Absence check using 157 positive place invariants in 1550 ms returned sat
[2025-05-31 06:56:07] [INFO ] [Real]Absence check using state equation in 12300 ms returned unknown
Could not prove EG (NOT p2)
[2025-05-31 06:56:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:56:09] [INFO ] [Real]Absence check using 157 positive place invariants in 331 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 9 factoid took 307 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-08b-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-08b-LTLFireability-07 finished in 84573 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&&X(X(X(p1)))&&(X(p2) U ((p3&&X(p2))||X(G(p2)))))))'
Support contains 3 out of 1944 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1930 transition count 3471
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1930 transition count 3471
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 1930 transition count 3470
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 1923 transition count 3452
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 1923 transition count 3452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 1923 transition count 3451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 1922 transition count 3450
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 1922 transition count 3450
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1921 transition count 3449
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 1921 transition count 3449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1920 transition count 3448
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1920 transition count 3448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1919 transition count 3447
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1919 transition count 3447
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1918 transition count 3446
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1918 transition count 3446
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1917 transition count 3445
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1917 transition count 3445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1916 transition count 3444
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1916 transition count 3444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1915 transition count 3443
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1915 transition count 3443
Applied a total of 60 rules in 711 ms. Remains 1915 /1944 variables (removed 29) and now considering 3443/3508 (removed 65) transitions.
// Phase 1: matrix 3443 rows 1915 cols
[2025-05-31 06:56:10] [INFO ] Computed 157 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:56:11] [INFO ] Implicit Places using invariants in 960 ms returned []
[2025-05-31 06:56:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:56:13] [INFO ] Implicit Places using invariants and state equation in 2117 ms returned []
Implicit Place search using SMT with State Equation took 3079 ms to find 0 implicit places.
Running 3442 sub problems to find dead transitions.
[2025-05-31 06:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1914/5358 variables, and 0 constraints, problems are : Problem set: 0 solved, 3442 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1915 constraints, PredecessorRefiner: 3442/3442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3442 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1914/5358 variables, and 0 constraints, problems are : Problem set: 0 solved, 3442 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1915 constraints, PredecessorRefiner: 0/3442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61230ms problems are : Problem set: 0 solved, 3442 unsolved
Search for dead transitions found 0 dead transitions in 61236ms
Starting structural reductions in LTL mode, iteration 1 : 1915/1944 places, 3443/3508 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65038 ms. Remains : 1915/1944 places, 3443/3508 transitions.
Stuttering acceptance computed with spot in 768 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-08
Product exploration explored 100000 steps with 33384 reset in 417 ms.
Product exploration explored 100000 steps with 33373 reset in 414 ms.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), (X p2), (X (NOT (AND (NOT p3) p2))), (X p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 267 ms. Reduced automaton from 14 states, 60 edges and 4 AP (stutter sensitive) to 14 states, 60 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 669 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 400 ms. (99 steps per ms) remains 9/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 9/9 properties
[2025-05-31 06:57:17] [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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 216/219 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1696/1915 variables, 154/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1915 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3443/5358 variables, 1915/2072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5358 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/5358 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5358/5358 variables, and 2072 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3860 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1915/1915 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 216/219 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1696/1915 variables, 154/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1915 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3443/5358 variables, 1915/2072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5358 variables, 9/2081 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5358 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/5358 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 5358/5358 variables, and 2081 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1915/1915 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8887ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1915 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1915/1915 places, 3443/3443 transitions.
Graph (trivial) has 1698 edges and 1915 vertex of which 469 / 1915 are part of one of the 41 SCC in 1 ms
Free SCC test removed 428 places
Drop transitions (Empty/Sink Transition effects.) removed 489 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 302 place count 1487 transition count 2641
Reduce places removed 301 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 340 rules applied. Total rules applied 642 place count 1186 transition count 2602
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 668 place count 1160 transition count 2602
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 668 place count 1160 transition count 2443
Deduced a syphon composed of 159 places in 7 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 986 place count 1001 transition count 2443
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1044 place count 943 transition count 1979
Iterating global reduction 3 with 58 rules applied. Total rules applied 1102 place count 943 transition count 1979
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1106 place count 943 transition count 1975
Performed 360 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 4 with 720 rules applied. Total rules applied 1826 place count 583 transition count 1606
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1835 place count 583 transition count 1597
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1856 place count 562 transition count 1357
Iterating global reduction 5 with 21 rules applied. Total rules applied 1877 place count 562 transition count 1357
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1897 place count 562 transition count 1337
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 6 with 2 rules applied. Total rules applied 1899 place count 561 transition count 1336
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -377
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 1979 place count 521 transition count 1713
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1991 place count 521 transition count 1701
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2012 place count 500 transition count 1212
Iterating global reduction 7 with 21 rules applied. Total rules applied 2033 place count 500 transition count 1212
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 2051 place count 500 transition count 1194
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2057 place count 497 transition count 1215
Drop transitions (Redundant composition of simpler transitions.) removed 135 transitions
Redundant transition composition rules discarded 135 transitions
Iterating global reduction 8 with 135 rules applied. Total rules applied 2192 place count 497 transition count 1080
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 2201 place count 488 transition count 972
Iterating global reduction 8 with 9 rules applied. Total rules applied 2210 place count 488 transition count 972
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 2218 place count 488 transition count 964
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 2220 place count 487 transition count 976
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2221 place count 487 transition count 975
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 2232 place count 487 transition count 964
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2234 place count 486 transition count 976
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2235 place count 486 transition count 975
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 2245 place count 486 transition count 965
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 2247 place count 485 transition count 977
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2249 place count 485 transition count 975
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2250 place count 485 transition count 974
Free-agglomeration rule applied 308 times with reduction of 163 identical transitions.
Iterating global reduction 12 with 308 rules applied. Total rules applied 2558 place count 485 transition count 503
Reduce places removed 308 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 331 transitions
Reduce isomorphic transitions removed 331 transitions.
Graph (complete) has 331 edges and 177 vertex of which 122 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 640 rules applied. Total rules applied 3198 place count 122 transition count 172
Discarding 70 places :
Symmetric choice reduction at 13 with 70 rule applications. Total rules 3268 place count 52 transition count 95
Iterating global reduction 13 with 70 rules applied. Total rules applied 3338 place count 52 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 3340 place count 51 transition count 100
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 3343 place count 51 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 3364 place count 51 transition count 76
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 126 edges and 50 vertex of which 44 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Iterating post reduction 14 with 2 rules applied. Total rules applied 3366 place count 44 transition count 71
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 3369 place count 44 transition count 68
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3373 place count 40 transition count 63
Iterating global reduction 16 with 4 rules applied. Total rules applied 3377 place count 40 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 16 with 4 rules applied. Total rules applied 3381 place count 40 transition count 59
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 3382 place count 40 transition count 59
Applied a total of 3382 rules in 350 ms. Remains 40 /1915 variables (removed 1875) and now considering 59/3443 (removed 3384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 40/1915 places, 59/3443 transitions.
RANDOM walk for 369 steps (0 resets) in 6 ms. (52 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p3 p2 p1), (X p2), (X (NOT (AND (NOT p3) p2))), (X p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p3)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT p0)), (F (NOT (OR p3 (NOT p0) p1))), (F (NOT (OR p2 p3 p0 p1))), (F (NOT (OR p2 p3 (NOT p0)))), (F (NOT (OR p2 p3 (NOT p0) p1))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p3))), (F (NOT p2)), (F (NOT (OR p3 (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p3)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p3 p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) p3 (NOT p0) p1)))]
Knowledge based reduction with 21 factoid took 1160 ms. Reduced automaton from 14 states, 60 edges and 4 AP (stutter sensitive) to 14 states, 60 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 724 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 718 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 1915 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1915/1915 places, 3443/3443 transitions.
Applied a total of 0 rules in 128 ms. Remains 1915 /1915 variables (removed 0) and now considering 3443/3443 (removed 0) transitions.
[2025-05-31 06:57:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:57:30] [INFO ] Implicit Places using invariants in 973 ms returned []
[2025-05-31 06:57:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:57:32] [INFO ] Implicit Places using invariants and state equation in 2131 ms returned []
Implicit Place search using SMT with State Equation took 3105 ms to find 0 implicit places.
Running 3442 sub problems to find dead transitions.
[2025-05-31 06:57:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1914/5358 variables, and 0 constraints, problems are : Problem set: 0 solved, 3442 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1915 constraints, PredecessorRefiner: 3442/3442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3442 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1914/5358 variables, and 0 constraints, problems are : Problem set: 0 solved, 3442 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1915 constraints, PredecessorRefiner: 0/3442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61224ms problems are : Problem set: 0 solved, 3442 unsolved
Search for dead transitions found 0 dead transitions in 61229ms
Finished structural reductions in LTL mode , in 1 iterations and 64475 ms. Remains : 1915/1915 places, 3443/3443 transitions.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 stable transitions
Knowledge obtained : [(AND p0 p3 p2 p1), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p2 (NOT p3)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 274 ms. Reduced automaton from 14 states, 60 edges and 4 AP (stutter sensitive) to 14 states, 60 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 740 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 713 ms. (56 steps per ms) remains 9/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 9/9 properties
[2025-05-31 06:58:35] [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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 216/219 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1696/1915 variables, 154/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1915 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3443/5358 variables, 1915/2072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5358 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/5358 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5358/5358 variables, and 2072 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3708 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1915/1915 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 216/219 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1696/1915 variables, 154/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1915 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 3443/5358 variables, 1915/2072 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5358 variables, 9/2081 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5358 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/5358 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5358/5358 variables, and 2081 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1915/1915 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8739ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 6 properties in 2370 ms.
Support contains 3 out of 1915 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1915/1915 places, 3443/3443 transitions.
Graph (trivial) has 1698 edges and 1915 vertex of which 469 / 1915 are part of one of the 41 SCC in 1 ms
Free SCC test removed 428 places
Drop transitions (Empty/Sink Transition effects.) removed 489 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 501 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 301 transitions
Trivial Post-agglo rules discarded 301 transitions
Performed 301 trivial Post agglomeration. Transition count delta: 301
Iterating post reduction 0 with 301 rules applied. Total rules applied 302 place count 1487 transition count 2641
Reduce places removed 301 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 340 rules applied. Total rules applied 642 place count 1186 transition count 2602
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 668 place count 1160 transition count 2602
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 668 place count 1160 transition count 2443
Deduced a syphon composed of 159 places in 8 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 986 place count 1001 transition count 2443
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1044 place count 943 transition count 1979
Iterating global reduction 3 with 58 rules applied. Total rules applied 1102 place count 943 transition count 1979
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1106 place count 943 transition count 1975
Performed 360 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 4 with 720 rules applied. Total rules applied 1826 place count 583 transition count 1606
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1835 place count 583 transition count 1597
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1856 place count 562 transition count 1357
Iterating global reduction 5 with 21 rules applied. Total rules applied 1877 place count 562 transition count 1357
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1897 place count 562 transition count 1337
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 6 with 2 rules applied. Total rules applied 1899 place count 561 transition count 1336
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -377
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 1979 place count 521 transition count 1713
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1991 place count 521 transition count 1701
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2012 place count 500 transition count 1212
Iterating global reduction 7 with 21 rules applied. Total rules applied 2033 place count 500 transition count 1212
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 2051 place count 500 transition count 1194
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2057 place count 497 transition count 1215
Drop transitions (Redundant composition of simpler transitions.) removed 135 transitions
Redundant transition composition rules discarded 135 transitions
Iterating global reduction 8 with 135 rules applied. Total rules applied 2192 place count 497 transition count 1080
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 2201 place count 488 transition count 972
Iterating global reduction 8 with 9 rules applied. Total rules applied 2210 place count 488 transition count 972
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 2218 place count 488 transition count 964
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 2220 place count 487 transition count 976
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2221 place count 487 transition count 975
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 2232 place count 487 transition count 964
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 2234 place count 486 transition count 976
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2235 place count 486 transition count 975
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 2245 place count 486 transition count 965
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 2247 place count 485 transition count 977
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2249 place count 485 transition count 975
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2250 place count 485 transition count 974
Free-agglomeration rule applied 308 times with reduction of 163 identical transitions.
Iterating global reduction 12 with 308 rules applied. Total rules applied 2558 place count 485 transition count 503
Reduce places removed 308 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 331 transitions
Reduce isomorphic transitions removed 331 transitions.
Graph (complete) has 331 edges and 177 vertex of which 122 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 640 rules applied. Total rules applied 3198 place count 122 transition count 172
Discarding 70 places :
Symmetric choice reduction at 13 with 70 rule applications. Total rules 3268 place count 52 transition count 95
Iterating global reduction 13 with 70 rules applied. Total rules applied 3338 place count 52 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 3340 place count 51 transition count 100
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 3343 place count 51 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 3364 place count 51 transition count 76
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 126 edges and 50 vertex of which 44 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Iterating post reduction 14 with 2 rules applied. Total rules applied 3366 place count 44 transition count 71
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 3369 place count 44 transition count 68
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3373 place count 40 transition count 63
Iterating global reduction 16 with 4 rules applied. Total rules applied 3377 place count 40 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 16 with 4 rules applied. Total rules applied 3381 place count 40 transition count 59
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 3382 place count 40 transition count 59
Applied a total of 3382 rules in 341 ms. Remains 40 /1915 variables (removed 1875) and now considering 59/3443 (removed 3384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 40/1915 places, 59/3443 transitions.
RANDOM walk for 584 steps (0 resets) in 6 ms. (83 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p3 p2 p1), (X p2), (X p3), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p2 (NOT p3)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p2 p3 p1))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p0) p2 p3 p1))), (F (NOT (OR (NOT p0) p3))), (F (NOT p2)), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p2) p3 p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p2) p3)))]
Knowledge based reduction with 21 factoid took 1192 ms. Reduced automaton from 14 states, 60 edges and 4 AP (stutter sensitive) to 14 states, 60 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 673 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 708 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 690 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33393 reset in 414 ms.
Product exploration explored 100000 steps with 33347 reset in 423 ms.
Built C files in :
/tmp/ltsmin6372379517018006112
[2025-05-31 06:58:51] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6372379517018006112
Running compilation step : cd /tmp/ltsmin6372379517018006112;'/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/ltsmin6372379517018006112;'/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/ltsmin6372379517018006112;'/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 1915 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1915/1915 places, 3443/3443 transitions.
Applied a total of 0 rules in 61 ms. Remains 1915 /1915 variables (removed 0) and now considering 3443/3443 (removed 0) transitions.
[2025-05-31 06:58:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:58:55] [INFO ] Implicit Places using invariants in 952 ms returned []
[2025-05-31 06:58:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:58:57] [INFO ] Implicit Places using invariants and state equation in 2119 ms returned []
Implicit Place search using SMT with State Equation took 3077 ms to find 0 implicit places.
Running 3442 sub problems to find dead transitions.
[2025-05-31 06:58:57] [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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1914/5358 variables, and 0 constraints, problems are : Problem set: 0 solved, 3442 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1915 constraints, PredecessorRefiner: 3442/3442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3442 unsolved
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")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1914/5358 variables, and 0 constraints, problems are : Problem set: 0 solved, 3442 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1915 constraints, PredecessorRefiner: 0/3442 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61224ms problems are : Problem set: 0 solved, 3442 unsolved
Search for dead transitions found 0 dead transitions in 61229ms
Finished structural reductions in LTL mode , in 1 iterations and 64379 ms. Remains : 1915/1915 places, 3443/3443 transitions.
Built C files in :
/tmp/ltsmin12830899080541339560
[2025-05-31 06:59:58] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12830899080541339560
Running compilation step : cd /tmp/ltsmin12830899080541339560;'/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/ltsmin12830899080541339560;'/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/ltsmin12830899080541339560;'/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-31 07:00:01] [INFO ] Flatten gal took : 63 ms
[2025-05-31 07:00:01] [INFO ] Flatten gal took : 64 ms
[2025-05-31 07:00:01] [INFO ] Time to serialize gal into /tmp/LTL10051613858176242037.gal : 13 ms
[2025-05-31 07:00:01] [INFO ] Time to serialize properties into /tmp/LTL14832127022112270886.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10051613858176242037.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11463250854746773663.hoa' '-atoms' '/tmp/LTL14832127022112270886.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...320
Loading property file /tmp/LTL14832127022112270886.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11463250854746773663.hoa
Detected timeout of ITS tools.
[2025-05-31 07:00:17] [INFO ] Flatten gal took : 55 ms
[2025-05-31 07:00:17] [INFO ] Flatten gal took : 58 ms
[2025-05-31 07:00:17] [INFO ] Time to serialize gal into /tmp/LTL9187426429537663875.gal : 13 ms
[2025-05-31 07:00:17] [INFO ] Time to serialize properties into /tmp/LTL4789100003711807531.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/LTL9187426429537663875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4789100003711807531.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...275
Read 1 LTL properties
Checking formula 0 : !((F((("(p436==0)")&&(X(X(X("(p1300==0)")))))&&((X("(p342!=1)"))U((X(G("(p342!=1)")))||(("(p1300!=1)")&&(X("(p342!=1)"))))))))
Formula 0 simplified : G(!"(p436==0)" | XXX!"(p1300==0)" | (X!"(p342!=1)" R (XF!"(p342!=1)" & (!"(p1300!=1)" | X!"(p342!=1)"))))
Detected timeout of ITS tools.
[2025-05-31 07:00:32] [INFO ] Flatten gal took : 55 ms
[2025-05-31 07:00:32] [INFO ] Applying decomposition
[2025-05-31 07:00:32] [INFO ] Flatten gal took : 56 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/graph3304451208058863099.txt' '-o' '/tmp/graph3304451208058863099.bin' '-w' '/tmp/graph3304451208058863099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3304451208058863099.bin' '-l' '-1' '-v' '-w' '/tmp/graph3304451208058863099.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:00:32] [INFO ] Decomposing Gal with order
[2025-05-31 07:00:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:00:32] [INFO ] Removed a total of 3252 redundant transitions.
[2025-05-31 07:00:32] [INFO ] Flatten gal took : 121 ms
[2025-05-31 07:00:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 22 ms.
[2025-05-31 07:00:32] [INFO ] Time to serialize gal into /tmp/LTL14127971176880088725.gal : 20 ms
[2025-05-31 07:00:32] [INFO ] Time to serialize properties into /tmp/LTL4725171171212420390.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/LTL14127971176880088725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4725171171212420390.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 : !((F((("(i6.u88.p436==0)")&&(X(X(X("(i16.u325.p1300==0)")))))&&((X("(i4.u68.p342!=1)"))U((X(G("(i4.u68.p342!=1)")))||(("(i16.u325.p130...193
Formula 0 simplified : G(!"(i6.u88.p436==0)" | XXX!"(i16.u325.p1300==0)" | (X!"(i4.u68.p342!=1)" R (XF!"(i4.u68.p342!=1)" & (!"(i16.u325.p1300!=1)" | X!"(i...174
Detected timeout of ITS tools.
Treatment of property DLCround-PT-08b-LTLFireability-08 finished in 278369 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(((G(F(p1)) U G(p2)) U (p0&&(G(F(p1)) U G(p2)))))))))'
Support contains 5 out of 1944 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1928 transition count 3480
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1928 transition count 3480
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1928 transition count 3479
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 1919 transition count 3459
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 1919 transition count 3459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 1919 transition count 3458
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1918 transition count 3457
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1918 transition count 3457
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1917 transition count 3456
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1917 transition count 3456
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1916 transition count 3455
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1916 transition count 3455
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1915 transition count 3454
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1915 transition count 3454
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1914 transition count 3453
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1914 transition count 3453
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1913 transition count 3452
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1913 transition count 3452
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1912 transition count 3451
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1912 transition count 3451
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 1911 transition count 3450
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 1911 transition count 3450
Applied a total of 68 rules in 787 ms. Remains 1911 /1944 variables (removed 33) and now considering 3450/3508 (removed 58) transitions.
// Phase 1: matrix 3450 rows 1911 cols
[2025-05-31 07:00:48] [INFO ] Computed 157 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:00:49] [INFO ] Implicit Places using invariants in 934 ms returned []
[2025-05-31 07:00:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:00:51] [INFO ] Implicit Places using invariants and state equation in 2052 ms returned []
Implicit Place search using SMT with State Equation took 2987 ms to find 0 implicit places.
Running 3449 sub problems to find dead transitions.
[2025-05-31 07:00:51] [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 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 timeout
1.0)
(s1036 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1910/5361 variables, and 0 constraints, problems are : Problem set: 0 solved, 3449 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1911 constraints, PredecessorRefiner: 3449/3449 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3449 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1910/5361 variables, and 0 constraints, problems are : Problem set: 0 solved, 3449 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1911 constraints, PredecessorRefiner: 0/3449 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61215ms problems are : Problem set: 0 solved, 3449 unsolved
Search for dead transitions found 0 dead transitions in 61221ms
Starting structural reductions in LTL mode, iteration 1 : 1911/1944 places, 3450/3508 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65007 ms. Remains : 1911/1944 places, 3450/3508 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (OR (NOT p2) (NOT p0)), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-09
Product exploration explored 100000 steps with 4 reset in 465 ms.
Product exploration explored 100000 steps with 6 reset in 551 ms.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 stable transitions
Detected a total of 309/1911 stabilizing places and 309/3450 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 138 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2025-05-31 07:01:54] [INFO ] Invariant cache hit.
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: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1823/1911 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1911 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3450/5361 variables, 1911/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5361 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/5361 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5361/5361 variables, and 2068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1911/1911 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 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: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1823/1911 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1911 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3450/5361 variables, 1911/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5361 variables, 1/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5361 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/5361 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5361/5361 variables, and 2069 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 1911/1911 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2788ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 327 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=163 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 7 factoid took 359 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
[2025-05-31 07:01:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:02:00] [INFO ] [Real]Absence check using 157 positive place invariants in 994 ms returned sat
[2025-05-31 07:02:13] [INFO ] [Real]Absence check using state equation in 12818 ms returned unknown
Could not prove EG (NOT p0)
Support contains 5 out of 1911 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1911/1911 places, 3450/3450 transitions.
Graph (trivial) has 1693 edges and 1911 vertex of which 483 / 1911 are part of one of the 40 SCC in 1 ms
Free SCC test removed 443 places
Ensure Unique test removed 478 transitions
Reduce isomorphic transitions removed 478 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 296 place count 1467 transition count 2676
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 334 rules applied. Total rules applied 630 place count 1172 transition count 2637
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 656 place count 1146 transition count 2637
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 656 place count 1146 transition count 2481
Deduced a syphon composed of 156 places in 13 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 968 place count 990 transition count 2481
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1029 place count 929 transition count 2003
Iterating global reduction 3 with 61 rules applied. Total rules applied 1090 place count 929 transition count 2003
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1094 place count 929 transition count 1999
Performed 351 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 351 places in 0 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 4 with 702 rules applied. Total rules applied 1796 place count 578 transition count 1640
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1805 place count 578 transition count 1631
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 1827 place count 556 transition count 1379
Iterating global reduction 5 with 22 rules applied. Total rules applied 1849 place count 556 transition count 1379
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1871 place count 556 transition count 1357
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -135
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1905 place count 539 transition count 1492
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1909 place count 539 transition count 1488
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1913 place count 535 transition count 1412
Iterating global reduction 7 with 4 rules applied. Total rules applied 1917 place count 535 transition count 1412
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1921 place count 535 transition count 1408
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1929 place count 531 transition count 1438
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 8 with 45 rules applied. Total rules applied 1974 place count 531 transition count 1393
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1990 place count 515 transition count 1361
Iterating global reduction 8 with 16 rules applied. Total rules applied 2006 place count 515 transition count 1361
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2022 place count 499 transition count 1155
Iterating global reduction 8 with 16 rules applied. Total rules applied 2038 place count 499 transition count 1155
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 2054 place count 499 transition count 1139
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2055 place count 499 transition count 1139
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2056 place count 499 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2057 place count 498 transition count 1136
Iterating global reduction 9 with 1 rules applied. Total rules applied 2058 place count 498 transition count 1136
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2059 place count 497 transition count 1124
Iterating global reduction 9 with 1 rules applied. Total rules applied 2060 place count 497 transition count 1124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2061 place count 497 transition count 1123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2062 place count 496 transition count 1122
Applied a total of 2062 rules in 305 ms. Remains 496 /1911 variables (removed 1415) and now considering 1122/3450 (removed 2328) transitions.
[2025-05-31 07:02:13] [INFO ] Flow matrix only has 1088 transitions (discarded 34 similar events)
// Phase 1: matrix 1088 rows 496 cols
[2025-05-31 07:02:13] [INFO ] Computed 157 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:02:13] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-05-31 07:02:13] [INFO ] Flow matrix only has 1088 transitions (discarded 34 similar events)
[2025-05-31 07:02:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:02:14] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 07:02:14] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:02:14] [INFO ] Redundant transitions in 21 ms returned []
Running 1052 sub problems to find dead transitions.
[2025-05-31 07:02:14] [INFO ] Flow matrix only has 1088 transitions (discarded 34 similar events)
[2025-05-31 07:02:14] [INFO ] Invariant cache hit.
[2025-05-31 07:02:14] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1052 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1052 unsolved
At refinement iteration 2 (OVERLAPS) 1/496 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 1052 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:02:44] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:02:44] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/1584 variables, and 159 constraints, problems are : Problem set: 0 solved, 1052 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/496 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 1052/1052 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1052 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1052 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1052 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1052 unsolved
At refinement iteration 3 (OVERLAPS) 1/496 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 1052 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/1584 variables, and 159 constraints, problems are : Problem set: 0 solved, 1052 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/496 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/1052 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60480ms problems are : Problem set: 0 solved, 1052 unsolved
Search for dead transitions found 0 dead transitions in 60482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1911 places, 1122/3450 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61534 ms. Remains : 496/1911 places, 1122/3450 transitions.
Computed a total of 3 stabilizing places and 34 stable transitions
Computed a total of 3 stabilizing places and 34 stable transitions
Detected a total of 3/496 stabilizing places and 34/1122 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 9 factoid took 223 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
RANDOM walk for 6400 steps (0 resets) in 86 ms. (73 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
Knowledge based reduction with 9 factoid took 456 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
[2025-05-31 07:03:16] [INFO ] Flow matrix only has 1088 transitions (discarded 34 similar events)
[2025-05-31 07:03:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:03:16] [INFO ] [Real]Absence check using 157 positive place invariants in 85 ms returned sat
[2025-05-31 07:03:17] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2025-05-31 07:03:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:03:18] [INFO ] [Nat]Absence check using 157 positive place invariants in 53 ms returned sat
[2025-05-31 07:03:18] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2025-05-31 07:03:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-31 07:03:18] [INFO ] [Nat]Added 57 Read/Feed constraints in 9 ms returned sat
[2025-05-31 07:03:18] [INFO ] Computed and/alt/rep : 615/1099/615 causal constraints (skipped 415 transitions) in 54 ms.
[2025-05-31 07:03:18] [INFO ] Added : 0 causal constraints over 0 iterations in 132 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-09 finished in 150876 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(G(p0)))'
Support contains 3 out of 1944 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Graph (trivial) has 1730 edges and 1944 vertex of which 485 / 1944 are part of one of the 40 SCC in 1 ms
Free SCC test removed 445 places
Ensure Unique test removed 481 transitions
Reduce isomorphic transitions removed 481 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 315 place count 1498 transition count 2712
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 356 rules applied. Total rules applied 671 place count 1184 transition count 2670
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 698 place count 1157 transition count 2670
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 698 place count 1157 transition count 2517
Deduced a syphon composed of 153 places in 8 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 1004 place count 1004 transition count 2517
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 1073 place count 935 transition count 2031
Iterating global reduction 3 with 69 rules applied. Total rules applied 1142 place count 935 transition count 2031
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1146 place count 935 transition count 2027
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1146 place count 935 transition count 2022
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1156 place count 930 transition count 2022
Performed 351 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 351 places in 1 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 4 with 702 rules applied. Total rules applied 1858 place count 579 transition count 1663
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1867 place count 579 transition count 1654
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1892 place count 554 transition count 1366
Iterating global reduction 5 with 25 rules applied. Total rules applied 1917 place count 554 transition count 1366
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1940 place count 554 transition count 1343
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -135
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1974 place count 537 transition count 1478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1978 place count 537 transition count 1474
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1982 place count 533 transition count 1398
Iterating global reduction 7 with 4 rules applied. Total rules applied 1986 place count 533 transition count 1398
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1990 place count 533 transition count 1394
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1998 place count 529 transition count 1424
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 8 with 46 rules applied. Total rules applied 2044 place count 529 transition count 1378
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2061 place count 512 transition count 1344
Iterating global reduction 8 with 17 rules applied. Total rules applied 2078 place count 512 transition count 1344
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2095 place count 495 transition count 1126
Iterating global reduction 8 with 17 rules applied. Total rules applied 2112 place count 495 transition count 1126
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 2129 place count 495 transition count 1109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2130 place count 494 transition count 1108
Applied a total of 2130 rules in 249 ms. Remains 494 /1944 variables (removed 1450) and now considering 1108/3508 (removed 2400) transitions.
[2025-05-31 07:03:19] [INFO ] Flow matrix only has 1073 transitions (discarded 35 similar events)
// Phase 1: matrix 1073 rows 494 cols
[2025-05-31 07:03:19] [INFO ] Computed 157 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:19] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-05-31 07:03:19] [INFO ] Flow matrix only has 1073 transitions (discarded 35 similar events)
[2025-05-31 07:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:19] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 07:03:19] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:03:19] [INFO ] Redundant transitions in 15 ms returned []
Running 1039 sub problems to find dead transitions.
[2025-05-31 07:03:19] [INFO ] Flow matrix only has 1073 transitions (discarded 35 similar events)
[2025-05-31 07:03:19] [INFO ] Invariant cache hit.
[2025-05-31 07:03:19] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/493 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (OVERLAPS) 1/494 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:03:48] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:03:48] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/1567 variables, and 159 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/494 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1039 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/493 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 3 (OVERLAPS) 1/494 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 5 (OVERLAPS) 1072/1566 variables, 494/653 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1566 variables, 56/709 constraints. Problems are: Problem set: 0 solved, 1039 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1566/1567 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1039 unsolved in 30234 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 494/494 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1039/1039 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60670ms problems are : Problem set: 0 solved, 1039 unsolved
Search for dead transitions found 0 dead transitions in 60672ms
Starting structural reductions in SI_LTL mode, iteration 1 : 494/1944 places, 1108/3508 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61654 ms. Remains : 494/1944 places, 1108/3508 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-10 finished in 61709 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)&&F(p1)&&(F(G(!p0)) U G(p2))))'
Support contains 5 out of 1944 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Graph (trivial) has 1726 edges and 1944 vertex of which 485 / 1944 are part of one of the 40 SCC in 1 ms
Free SCC test removed 445 places
Ensure Unique test removed 481 transitions
Reduce isomorphic transitions removed 481 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 313 place count 1498 transition count 2714
Reduce places removed 312 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 354 rules applied. Total rules applied 667 place count 1186 transition count 2672
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 694 place count 1159 transition count 2672
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 694 place count 1159 transition count 2518
Deduced a syphon composed of 154 places in 8 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 1002 place count 1005 transition count 2518
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 1069 place count 938 transition count 2045
Iterating global reduction 3 with 67 rules applied. Total rules applied 1136 place count 938 transition count 2045
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1140 place count 938 transition count 2041
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1140 place count 938 transition count 2037
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1148 place count 934 transition count 2037
Performed 354 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 4 with 708 rules applied. Total rules applied 1856 place count 580 transition count 1675
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1865 place count 580 transition count 1666
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1890 place count 555 transition count 1378
Iterating global reduction 5 with 25 rules applied. Total rules applied 1915 place count 555 transition count 1378
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1938 place count 555 transition count 1355
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1964 place count 542 transition count 1461
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1968 place count 542 transition count 1457
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1972 place count 538 transition count 1377
Iterating global reduction 7 with 4 rules applied. Total rules applied 1976 place count 538 transition count 1377
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1980 place count 538 transition count 1373
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1988 place count 534 transition count 1402
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 2024 place count 534 transition count 1366
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2040 place count 518 transition count 1334
Iterating global reduction 8 with 16 rules applied. Total rules applied 2056 place count 518 transition count 1334
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2072 place count 502 transition count 1141
Iterating global reduction 8 with 16 rules applied. Total rules applied 2088 place count 502 transition count 1141
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 2104 place count 502 transition count 1125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2105 place count 501 transition count 1124
Applied a total of 2105 rules in 241 ms. Remains 501 /1944 variables (removed 1443) and now considering 1124/3508 (removed 2384) transitions.
[2025-05-31 07:04:20] [INFO ] Flow matrix only has 1095 transitions (discarded 29 similar events)
// Phase 1: matrix 1095 rows 501 cols
[2025-05-31 07:04:20] [INFO ] Computed 157 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:04:21] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-05-31 07:04:21] [INFO ] Flow matrix only has 1095 transitions (discarded 29 similar events)
[2025-05-31 07:04:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:04:21] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-31 07:04:21] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:04:21] [INFO ] Redundant transitions in 19 ms returned []
Running 1054 sub problems to find dead transitions.
[2025-05-31 07:04:21] [INFO ] Flow matrix only has 1095 transitions (discarded 29 similar events)
[2025-05-31 07:04:21] [INFO ] Invariant cache hit.
[2025-05-31 07:04:21] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/1596 variables, and 157 constraints, problems are : Problem set: 0 solved, 1054 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/501 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 1054/1054 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1054 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1054 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 1054 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 501/1596 variables, and 157 constraints, problems are : Problem set: 0 solved, 1054 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/501 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 0/1054 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60642ms problems are : Problem set: 0 solved, 1054 unsolved
Search for dead transitions found 0 dead transitions in 60643ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1944 places, 1124/3508 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61606 ms. Remains : 501/1944 places, 1124/3508 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), p0, (NOT p2)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-11 finished in 61843 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||G(p1))))'
Support contains 2 out of 1944 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1929 transition count 3470
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1929 transition count 3470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1929 transition count 3469
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 1921 transition count 3450
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 1921 transition count 3450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1921 transition count 3449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 1920 transition count 3448
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 1920 transition count 3448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 1919 transition count 3447
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 1919 transition count 3447
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1918 transition count 3446
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1918 transition count 3446
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1917 transition count 3445
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1917 transition count 3445
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1916 transition count 3444
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1916 transition count 3444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1915 transition count 3443
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1915 transition count 3443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1914 transition count 3442
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1914 transition count 3442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1913 transition count 3441
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1913 transition count 3441
Applied a total of 64 rules in 812 ms. Remains 1913 /1944 variables (removed 31) and now considering 3441/3508 (removed 67) transitions.
// Phase 1: matrix 3441 rows 1913 cols
[2025-05-31 07:05:23] [INFO ] Computed 157 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:05:24] [INFO ] Implicit Places using invariants in 979 ms returned []
[2025-05-31 07:05:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:05:26] [INFO ] Implicit Places using invariants and state equation in 2151 ms returned []
Implicit Place search using SMT with State Equation took 3134 ms to find 0 implicit places.
Running 3440 sub problems to find dead transitions.
[2025-05-31 07:05:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1912/5354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3440 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1913 constraints, PredecessorRefiner: 3440/3440 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3440 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1912/5354 variables, and 0 constraints, problems are : Problem set: 0 solved, 3440 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/157 constraints, State Equation: 0/1913 constraints, PredecessorRefiner: 0/3440 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61219ms problems are : Problem set: 0 solved, 3440 unsolved
Search for dead transitions found 0 dead transitions in 61225ms
Starting structural reductions in LTL mode, iteration 1 : 1913/1944 places, 3441/3508 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65181 ms. Remains : 1913/1944 places, 3441/3508 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 482 ms.
Product exploration explored 100000 steps with 50000 reset in 482 ms.
Computed a total of 309 stabilizing places and 309 stable transitions
Computed a total of 309 stabilizing places and 309 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))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-08b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-08b-LTLFireability-12 finished in 66364 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 1 out of 1944 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Graph (trivial) has 1731 edges and 1944 vertex of which 485 / 1944 are part of one of the 40 SCC in 1 ms
Free SCC test removed 445 places
Ensure Unique test removed 481 transitions
Reduce isomorphic transitions removed 481 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 315 place count 1498 transition count 2712
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 356 rules applied. Total rules applied 671 place count 1184 transition count 2670
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 698 place count 1157 transition count 2670
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 698 place count 1157 transition count 2517
Deduced a syphon composed of 153 places in 8 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 1004 place count 1004 transition count 2517
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 1073 place count 935 transition count 2020
Iterating global reduction 3 with 69 rules applied. Total rules applied 1142 place count 935 transition count 2020
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1146 place count 935 transition count 2016
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1146 place count 935 transition count 2012
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1154 place count 931 transition count 2012
Performed 354 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 4 with 708 rules applied. Total rules applied 1862 place count 577 transition count 1650
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1871 place count 577 transition count 1641
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1896 place count 552 transition count 1353
Iterating global reduction 5 with 25 rules applied. Total rules applied 1921 place count 552 transition count 1353
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1944 place count 552 transition count 1330
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1968 place count 540 transition count 1429
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1972 place count 540 transition count 1425
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1976 place count 536 transition count 1349
Iterating global reduction 7 with 4 rules applied. Total rules applied 1980 place count 536 transition count 1349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1984 place count 536 transition count 1345
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1992 place count 532 transition count 1375
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 2029 place count 532 transition count 1338
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2047 place count 514 transition count 1302
Iterating global reduction 8 with 18 rules applied. Total rules applied 2065 place count 514 transition count 1302
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2083 place count 496 transition count 1082
Iterating global reduction 8 with 18 rules applied. Total rules applied 2101 place count 496 transition count 1082
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2119 place count 496 transition count 1064
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2120 place count 495 transition count 1063
Applied a total of 2120 rules in 239 ms. Remains 495 /1944 variables (removed 1449) and now considering 1063/3508 (removed 2445) transitions.
[2025-05-31 07:06:29] [INFO ] Flow matrix only has 1037 transitions (discarded 26 similar events)
// Phase 1: matrix 1037 rows 495 cols
[2025-05-31 07:06:29] [INFO ] Computed 157 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:06:29] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-05-31 07:06:29] [INFO ] Flow matrix only has 1037 transitions (discarded 26 similar events)
[2025-05-31 07:06:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:06:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 07:06:29] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:06:29] [INFO ] Redundant transitions in 13 ms returned []
Running 995 sub problems to find dead transitions.
[2025-05-31 07:06:29] [INFO ] Flow matrix only has 1037 transitions (discarded 26 similar events)
[2025-05-31 07:06:29] [INFO ] Invariant cache hit.
[2025-05-31 07:06:29] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 2 (OVERLAPS) 1/495 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/1532 variables, and 157 constraints, problems are : Problem set: 0 solved, 995 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/495 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 995/995 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 995 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 2 (OVERLAPS) 1/495 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 4 (OVERLAPS) 1036/1531 variables, 495/652 constraints. Problems are: Problem set: 0 solved, 995 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1531 variables, 49/701 constraints. Problems are: Problem set: 0 solved, 995 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1531/1532 variables, and 1696 constraints, problems are : Problem set: 0 solved, 995 unsolved in 30140 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 495/495 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 995/995 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60719ms problems are : Problem set: 0 solved, 995 unsolved
Search for dead transitions found 0 dead transitions in 60721ms
Starting structural reductions in SI_LTL mode, iteration 1 : 495/1944 places, 1063/3508 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61643 ms. Remains : 495/1944 places, 1063/3508 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-13 finished in 61738 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))'
Support contains 1 out of 1944 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Graph (trivial) has 1731 edges and 1944 vertex of which 485 / 1944 are part of one of the 40 SCC in 1 ms
Free SCC test removed 445 places
Ensure Unique test removed 481 transitions
Reduce isomorphic transitions removed 481 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 314 rules applied. Total rules applied 315 place count 1498 transition count 2712
Reduce places removed 314 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 356 rules applied. Total rules applied 671 place count 1184 transition count 2670
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 698 place count 1157 transition count 2670
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 698 place count 1157 transition count 2517
Deduced a syphon composed of 153 places in 8 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 1004 place count 1004 transition count 2517
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 1073 place count 935 transition count 2020
Iterating global reduction 3 with 69 rules applied. Total rules applied 1142 place count 935 transition count 2020
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1146 place count 935 transition count 2016
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1146 place count 935 transition count 2011
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1156 place count 930 transition count 2011
Performed 353 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 353 places in 0 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 4 with 706 rules applied. Total rules applied 1862 place count 577 transition count 1650
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1871 place count 577 transition count 1641
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1895 place count 553 transition count 1365
Iterating global reduction 5 with 24 rules applied. Total rules applied 1919 place count 553 transition count 1365
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1941 place count 553 transition count 1343
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1965 place count 541 transition count 1442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1969 place count 541 transition count 1438
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1973 place count 537 transition count 1362
Iterating global reduction 7 with 4 rules applied. Total rules applied 1977 place count 537 transition count 1362
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1981 place count 537 transition count 1358
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1989 place count 533 transition count 1388
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 2026 place count 533 transition count 1351
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2044 place count 515 transition count 1315
Iterating global reduction 8 with 18 rules applied. Total rules applied 2062 place count 515 transition count 1315
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2080 place count 497 transition count 1095
Iterating global reduction 8 with 18 rules applied. Total rules applied 2098 place count 497 transition count 1095
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2116 place count 497 transition count 1077
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2117 place count 496 transition count 1076
Applied a total of 2117 rules in 248 ms. Remains 496 /1944 variables (removed 1448) and now considering 1076/3508 (removed 2432) transitions.
[2025-05-31 07:07:30] [INFO ] Flow matrix only has 1050 transitions (discarded 26 similar events)
// Phase 1: matrix 1050 rows 496 cols
[2025-05-31 07:07:30] [INFO ] Computed 157 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:07:31] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-05-31 07:07:31] [INFO ] Flow matrix only has 1050 transitions (discarded 26 similar events)
[2025-05-31 07:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:07:31] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 07:07:31] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:07:31] [INFO ] Redundant transitions in 15 ms returned []
Running 1007 sub problems to find dead transitions.
[2025-05-31 07:07:31] [INFO ] Flow matrix only has 1050 transitions (discarded 26 similar events)
[2025-05-31 07:07:31] [INFO ] Invariant cache hit.
[2025-05-31 07:07:31] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 2 (OVERLAPS) 1/496 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/1546 variables, and 157 constraints, problems are : Problem set: 0 solved, 1007 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/496 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 1007/1007 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1007 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 2 (OVERLAPS) 1/496 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 4 (OVERLAPS) 1049/1545 variables, 496/653 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1545 variables, 49/702 constraints. Problems are: Problem set: 0 solved, 1007 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1545/1546 variables, and 1709 constraints, problems are : Problem set: 0 solved, 1007 unsolved in 30147 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 496/496 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1007/1007 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 1007 unsolved
Search for dead transitions found 0 dead transitions in 60796ms
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1944 places, 1076/3508 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61766 ms. Remains : 496/1944 places, 1076/3508 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-14 finished in 61834 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(G(p0))&&F(p1))))'
Support contains 3 out of 1944 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Graph (trivial) has 1727 edges and 1944 vertex of which 485 / 1944 are part of one of the 40 SCC in 1 ms
Free SCC test removed 445 places
Ensure Unique test removed 481 transitions
Reduce isomorphic transitions removed 481 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 313 place count 1498 transition count 2714
Reduce places removed 312 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 353 rules applied. Total rules applied 666 place count 1186 transition count 2673
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 27 rules applied. Total rules applied 693 place count 1160 transition count 2672
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 694 place count 1159 transition count 2672
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 153 Pre rules applied. Total rules applied 694 place count 1159 transition count 2519
Deduced a syphon composed of 153 places in 8 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 4 with 306 rules applied. Total rules applied 1000 place count 1006 transition count 2519
Discarding 70 places :
Symmetric choice reduction at 4 with 70 rule applications. Total rules 1070 place count 936 transition count 2021
Iterating global reduction 4 with 70 rules applied. Total rules applied 1140 place count 936 transition count 2021
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1144 place count 936 transition count 2017
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1144 place count 936 transition count 2012
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1154 place count 931 transition count 2012
Performed 352 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 352 places in 0 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 5 with 704 rules applied. Total rules applied 1858 place count 579 transition count 1652
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1866 place count 579 transition count 1644
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1890 place count 555 transition count 1368
Iterating global reduction 6 with 24 rules applied. Total rules applied 1914 place count 555 transition count 1368
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 1936 place count 555 transition count 1346
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1960 place count 543 transition count 1445
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1964 place count 543 transition count 1441
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1968 place count 539 transition count 1365
Iterating global reduction 8 with 4 rules applied. Total rules applied 1972 place count 539 transition count 1365
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1976 place count 539 transition count 1361
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1984 place count 535 transition count 1391
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 9 with 35 rules applied. Total rules applied 2019 place count 535 transition count 1356
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 2035 place count 519 transition count 1324
Iterating global reduction 9 with 16 rules applied. Total rules applied 2051 place count 519 transition count 1324
Discarding 16 places :
Symmetric choice reduction at 9 with 16 rule applications. Total rules 2067 place count 503 transition count 1128
Iterating global reduction 9 with 16 rules applied. Total rules applied 2083 place count 503 transition count 1128
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 2099 place count 503 transition count 1112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2100 place count 502 transition count 1111
Applied a total of 2100 rules in 257 ms. Remains 502 /1944 variables (removed 1442) and now considering 1111/3508 (removed 2397) transitions.
[2025-05-31 07:08:32] [INFO ] Flow matrix only has 1083 transitions (discarded 28 similar events)
// Phase 1: matrix 1083 rows 502 cols
[2025-05-31 07:08:32] [INFO ] Computed 157 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:08:32] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-05-31 07:08:32] [INFO ] Flow matrix only has 1083 transitions (discarded 28 similar events)
[2025-05-31 07:08:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:08:33] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-31 07:08:33] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:08:33] [INFO ] Redundant transitions in 17 ms returned []
Running 1041 sub problems to find dead transitions.
[2025-05-31 07:08:33] [INFO ] Flow matrix only has 1083 transitions (discarded 28 similar events)
[2025-05-31 07:08:33] [INFO ] Invariant cache hit.
[2025-05-31 07:08:33] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/1585 variables, and 157 constraints, problems are : Problem set: 0 solved, 1041 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/502 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 1041/1041 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1041 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 144/157 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1041 unsolved
SMT process timed out in 60640ms, After SMT, problems are : Problem set: 0 solved, 1041 unsolved
Search for dead transitions found 0 dead transitions in 60642ms
Starting structural reductions in SI_LTL mode, iteration 1 : 502/1944 places, 1111/3508 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61606 ms. Remains : 502/1944 places, 1111/3508 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-08b-LTLFireability-15
Stuttering criterion allowed to conclude after 396 steps with 0 reset in 8 ms.
FORMULA DLCround-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-08b-LTLFireability-15 finished in 61746 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((X(p1)||(!p1 U (G(!p1)||(!p1&&G(p2))))||p0)))))'
Found a Lengthening insensitive property : DLCround-PT-08b-LTLFireability-02
Stuttering acceptance computed with spot in 350 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Support contains 5 out of 1944 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1944/1944 places, 3508/3508 transitions.
Graph (trivial) has 1726 edges and 1944 vertex of which 485 / 1944 are part of one of the 40 SCC in 2 ms
Free SCC test removed 445 places
Ensure Unique test removed 481 transitions
Reduce isomorphic transitions removed 481 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 312 transitions
Trivial Post-agglo rules discarded 312 transitions
Performed 312 trivial Post agglomeration. Transition count delta: 312
Iterating post reduction 0 with 312 rules applied. Total rules applied 313 place count 1498 transition count 2714
Reduce places removed 312 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 354 rules applied. Total rules applied 667 place count 1186 transition count 2672
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 694 place count 1159 transition count 2672
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 694 place count 1159 transition count 2518
Deduced a syphon composed of 154 places in 8 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 1002 place count 1005 transition count 2518
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 1069 place count 938 transition count 2045
Iterating global reduction 3 with 67 rules applied. Total rules applied 1136 place count 938 transition count 2045
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1140 place count 938 transition count 2041
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 1140 place count 938 transition count 2036
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 1150 place count 933 transition count 2036
Performed 352 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 352 places in 1 ms
Reduce places removed 352 places and 0 transitions.
Iterating global reduction 4 with 704 rules applied. Total rules applied 1854 place count 581 transition count 1677
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1863 place count 581 transition count 1668
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1888 place count 556 transition count 1380
Iterating global reduction 5 with 25 rules applied. Total rules applied 1913 place count 556 transition count 1380
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 1936 place count 556 transition count 1357
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1960 place count 544 transition count 1457
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1964 place count 544 transition count 1453
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1968 place count 540 transition count 1375
Iterating global reduction 7 with 4 rules applied. Total rules applied 1972 place count 540 transition count 1375
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1976 place count 540 transition count 1371
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1984 place count 536 transition count 1400
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1988 place count 536 transition count 1396
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1989 place count 536 transition count 1396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1990 place count 535 transition count 1395
Applied a total of 1990 rules in 228 ms. Remains 535 /1944 variables (removed 1409) and now considering 1395/3508 (removed 2113) transitions.
[2025-05-31 07:09:34] [INFO ] Flow matrix only has 1351 transitions (discarded 44 similar events)
// Phase 1: matrix 1351 rows 535 cols
[2025-05-31 07:09:34] [INFO ] Computed 157 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:09:35] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-31 07:09:35] [INFO ] Flow matrix only has 1351 transitions (discarded 44 similar events)
[2025-05-31 07:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:09:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 07:09:35] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Running 1311 sub problems to find dead transitions.
[2025-05-31 07:09:35] [INFO ] Flow matrix only has 1351 transitions (discarded 44 similar events)
[2025-05-31 07:09:35] [INFO ] Invariant cache hit.
[2025-05-31 07:09:35] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (OVERLAPS) 2/535 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/1886 variables, and 157 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/535 constraints, ReadFeed: 0/60 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (OVERLAPS) 2/535 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/1886 variables, and 157 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/535 constraints, ReadFeed: 0/60 constraints, PredecessorRefiner: 0/1311 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60705ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 60708ms
Starting structural reductions in LI_LTL mode, iteration 1 : 535/1944 places, 1395/3508 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61730 ms. Remains : 535/1944 places, 1395/3508 transitions.
Running random walk in product with property : DLCround-PT-08b-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 880 ms.
Product exploration explored 100000 steps with 0 reset in 890 ms.
Computed a total of 3 stabilizing places and 18 stable transitions
Computed a total of 3 stabilizing places and 18 stable transitions
Detected a total of 3/535 stabilizing places and 18/1395 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 370 ms. (107 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 436 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 343 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 1395/1395 transitions.
Applied a total of 0 rules in 10 ms. Remains 535 /535 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2025-05-31 07:10:39] [INFO ] Flow matrix only has 1351 transitions (discarded 44 similar events)
[2025-05-31 07:10:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:10:40] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-05-31 07:10:40] [INFO ] Flow matrix only has 1351 transitions (discarded 44 similar events)
[2025-05-31 07:10:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:10:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 07:10:40] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Running 1311 sub problems to find dead transitions.
[2025-05-31 07:10:40] [INFO ] Flow matrix only has 1351 transitions (discarded 44 similar events)
[2025-05-31 07:10:40] [INFO ] Invariant cache hit.
[2025-05-31 07:10:40] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (OVERLAPS) 2/535 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/1886 variables, and 157 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/535 constraints, ReadFeed: 0/60 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (OVERLAPS) 2/535 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/1886 variables, and 157 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/535 constraints, ReadFeed: 0/60 constraints, PredecessorRefiner: 0/1311 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60733ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 60736ms
Finished structural reductions in LTL mode , in 1 iterations and 61523 ms. Remains : 535/535 places, 1395/1395 transitions.
Computed a total of 3 stabilizing places and 18 stable transitions
Computed a total of 3 stabilizing places and 18 stable transitions
Detected a total of 3/535 stabilizing places and 18/1395 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 147 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 354 ms. (112 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 472 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 342 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 298 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 765 ms.
Product exploration explored 100000 steps with 0 reset in 902 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 333 ms :[false, false, false, (NOT p1), false, true, p1, (AND p1 (NOT p2)), (NOT p2)]
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 1395/1395 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 535 transition count 1364
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 48 place count 518 transition count 1330
Iterating global reduction 0 with 17 rules applied. Total rules applied 65 place count 518 transition count 1330
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 82 place count 501 transition count 1124
Iterating global reduction 0 with 17 rules applied. Total rules applied 99 place count 501 transition count 1124
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 116 place count 501 transition count 1107
Applied a total of 116 rules in 75 ms. Remains 501 /535 variables (removed 34) and now considering 1107/1395 (removed 288) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:11:45] [INFO ] Redundant transitions in 13 ms returned []
Running 1040 sub problems to find dead transitions.
[2025-05-31 07:11:45] [INFO ] Flow matrix only has 1080 transitions (discarded 27 similar events)
// Phase 1: matrix 1080 rows 501 cols
[2025-05-31 07:11:45] [INFO ] Computed 157 invariants in 2 ms
[2025-05-31 07:11:45] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 2 (OVERLAPS) 2/501 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/1581 variables, and 157 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/501 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1040/1040 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1040 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 2 (OVERLAPS) 2/501 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 4 (OVERLAPS) 1079/1580 variables, 501/658 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1580 variables, 58/716 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1580/1581 variables, and 1756 constraints, problems are : Problem set: 0 solved, 1040 unsolved in 30320 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 501/501 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1040/1040 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60917ms problems are : Problem set: 0 solved, 1040 unsolved
Search for dead transitions found 0 dead transitions in 60918ms
Starting structural reductions in SI_LTL mode, iteration 1 : 501/535 places, 1107/1395 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61014 ms. Remains : 501/535 places, 1107/1395 transitions.
Built C files in :
/tmp/ltsmin16366023769975909232
[2025-05-31 07:12:46] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16366023769975909232
Running compilation step : cd /tmp/ltsmin16366023769975909232;'/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 2321 ms.
Running link step : cd /tmp/ltsmin16366023769975909232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16366023769975909232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12300114072357938110.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 1395/1395 transitions.
Applied a total of 0 rules in 12 ms. Remains 535 /535 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2025-05-31 07:13:01] [INFO ] Flow matrix only has 1351 transitions (discarded 44 similar events)
// Phase 1: matrix 1351 rows 535 cols
[2025-05-31 07:13:01] [INFO ] Computed 157 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:13:01] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-31 07:13:01] [INFO ] Flow matrix only has 1351 transitions (discarded 44 similar events)
[2025-05-31 07:13:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:13:02] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-31 07:13:02] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Running 1311 sub problems to find dead transitions.
[2025-05-31 07:13:02] [INFO ] Flow matrix only has 1351 transitions (discarded 44 similar events)
[2025-05-31 07:13:02] [INFO ] Invariant cache hit.
[2025-05-31 07:13:02] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (OVERLAPS) 2/535 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/1886 variables, and 157 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/535 constraints, ReadFeed: 0/60 constraints, PredecessorRefiner: 1311/1311 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1311 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1311 unsolved
At refinement iteration 2 (OVERLAPS) 2/535 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 1311 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 535/1886 variables, and 157 constraints, problems are : Problem set: 0 solved, 1311 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, State Equation: 0/535 constraints, ReadFeed: 0/60 constraints, PredecessorRefiner: 0/1311 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60728ms problems are : Problem set: 0 solved, 1311 unsolved
Search for dead transitions found 0 dead transitions in 60731ms
Finished structural reductions in LTL mode , in 1 iterations and 61508 ms. Remains : 535/535 places, 1395/1395 transitions.
Built C files in :
/tmp/ltsmin6078965994767047284
[2025-05-31 07:14:03] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6078965994767047284
Running compilation step : cd /tmp/ltsmin6078965994767047284;'/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 2324 ms.
Running link step : cd /tmp/ltsmin6078965994767047284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6078965994767047284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3691870965297309883.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 07:14:18] [INFO ] Flatten gal took : 76 ms
[2025-05-31 07:14:18] [INFO ] Flatten gal took : 65 ms
[2025-05-31 07:14:18] [INFO ] Time to serialize gal into /tmp/LTL17307672118701690242.gal : 6 ms
[2025-05-31 07:14:18] [INFO ] Time to serialize properties into /tmp/LTL11291798624066205166.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/LTL17307672118701690242.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17714907426204030741.hoa' '-atoms' '/tmp/LTL11291798624066205166.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...320
Loading property file /tmp/LTL11291798624066205166.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17714907426204030741.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t5, t7, t8, t10, t14, t16, t18, t20, t21, t23, t27, t29, t31, t33, t34, t36, t40, t42...863
Computing Next relation with stutter on 6.55362e+06 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
1479 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,14.9335,219812,1,0,2193,1.06035e+06,2781,1076,36419,727599,2793
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Detected timeout of ITS tools.
Treatment of property DLCround-PT-08b-LTLFireability-02 finished in 299432 ms.
FORMULA DLCround-PT-08b-LTLFireability-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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&&X(X(X(p1)))&&(X(p2) U ((p3&&X(p2))||X(G(p2)))))))'
[2025-05-31 07:14:33] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11789572383703248415
[2025-05-31 07:14:33] [INFO ] Too many transitions (3508) to apply POR reductions. Disabling POR matrices.
[2025-05-31 07:14:33] [INFO ] Applying decomposition
[2025-05-31 07:14:33] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11789572383703248415
Running compilation step : cd /tmp/ltsmin11789572383703248415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-05-31 07:14:33] [INFO ] Flatten gal took : 58 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/graph10346706318814662754.txt' '-o' '/tmp/graph10346706318814662754.bin' '-w' '/tmp/graph10346706318814662754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10346706318814662754.bin' '-l' '-1' '-v' '-w' '/tmp/graph10346706318814662754.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:14:34] [INFO ] Decomposing Gal with order
[2025-05-31 07:14:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:14:34] [INFO ] Removed a total of 3304 redundant transitions.
[2025-05-31 07:14:34] [INFO ] Flatten gal took : 118 ms
[2025-05-31 07:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 23 ms.
[2025-05-31 07:14:34] [INFO ] Time to serialize gal into /tmp/LTLFireability3674206061302926559.gal : 21 ms
[2025-05-31 07:14:34] [INFO ] Time to serialize properties into /tmp/LTLFireability14476949146085159920.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/LTLFireability3674206061302926559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14476949146085159920.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...277
Read 1 LTL properties
Checking formula 0 : !((F((("(i5.u94.p436==0)")&&(X(X(X("(i14.i1.i5.u331.p1300==0)")))))&&((X("(i3.u74.p342!=1)"))U((("(i14.i1.i5.u331.p1300!=1)")&&(X("(i3...205
Formula 0 simplified : G(!"(i5.u94.p436==0)" | XXX!"(i14.i1.i5.u331.p1300==0)" | (X!"(i3.u74.p342!=1)" R (XF!"(i3.u74.p342!=1)" & (!"(i14.i1.i5.u331.p1300!...186
Compilation finished in 8471 ms.
Running link step : cd /tmp/ltsmin11789572383703248415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin11789572383703248415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp3==true)&&X(X(X((LTLAPp4==true))))&&(X((LTLAPp5==true)) U (((LTLAPp6==true)&&X((LTLAPp5==true)))||X([]((LTLAPp5==true)))))))' '--buchi-type=spotba'
LTSmin run took 1479 ms.
FORMULA DLCround-PT-08b-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1866354 ms.

BK_STOP 1748675683983

--------------------
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