fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r400-tall-171690531800219
Last Updated
July 7, 2024

About the Execution of ITS-Tools for StigmergyCommit-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15559.911 3206219.00 8516391.00 4959.20 TTFTTTTTFTFFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531800219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is StigmergyCommit-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531800219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 155M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716999096000

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 16:11:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 16:11:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 16:11:42] [INFO ] Load time of PNML (sax parser for PT used): 5182 ms
[2024-05-29 16:11:42] [INFO ] Transformed 400 places.
[2024-05-29 16:11:43] [INFO ] Transformed 136960 transitions.
[2024-05-29 16:11:43] [INFO ] Found NUPN structural information;
[2024-05-29 16:11:43] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 6036 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 423 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 82 place count 318 transition count 4523
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 318 transition count 4523
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 174 place count 318 transition count 4513
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 214 place count 278 transition count 4465
Iterating global reduction 1 with 40 rules applied. Total rules applied 254 place count 278 transition count 4465
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 264 place count 278 transition count 4455
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 273 place count 269 transition count 4446
Iterating global reduction 2 with 9 rules applied. Total rules applied 282 place count 269 transition count 4446
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 290 place count 261 transition count 4438
Iterating global reduction 2 with 8 rules applied. Total rules applied 298 place count 261 transition count 4438
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 303 place count 256 transition count 4433
Iterating global reduction 2 with 5 rules applied. Total rules applied 308 place count 256 transition count 4433
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 313 place count 251 transition count 4428
Iterating global reduction 2 with 5 rules applied. Total rules applied 318 place count 251 transition count 4428
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 323 place count 251 transition count 4423
Applied a total of 323 rules in 221 ms. Remains 251 /400 variables (removed 149) and now considering 4423/4615 (removed 192) transitions.
[2024-05-29 16:11:44] [INFO ] Flow matrix only has 4410 transitions (discarded 13 similar events)
// Phase 1: matrix 4410 rows 251 cols
[2024-05-29 16:11:44] [INFO ] Computed 2 invariants in 68 ms
[2024-05-29 16:11:46] [INFO ] Implicit Places using invariants in 1416 ms returned []
[2024-05-29 16:11:46] [INFO ] Flow matrix only has 4410 transitions (discarded 13 similar events)
[2024-05-29 16:11:46] [INFO ] Invariant cache hit.
[2024-05-29 16:11:47] [INFO ] State equation strengthened by 4203 read => feed constraints.
[2024-05-29 16:11:50] [INFO ] Implicit Places using invariants and state equation in 4564 ms returned [250]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6032 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 250/400 places, 4423/4615 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 224 transition count 4397
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 224 transition count 4397
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 224 transition count 4388
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 213 transition count 4377
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 213 transition count 4377
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 203 transition count 4367
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 203 transition count 4367
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 112 place count 194 transition count 4358
Iterating global reduction 1 with 9 rules applied. Total rules applied 121 place count 194 transition count 4358
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 130 place count 185 transition count 4349
Iterating global reduction 1 with 9 rules applied. Total rules applied 139 place count 185 transition count 4349
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 178 transition count 4342
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 178 transition count 4342
Applied a total of 153 rules in 128 ms. Remains 178 /250 variables (removed 72) and now considering 4342/4423 (removed 81) transitions.
[2024-05-29 16:11:50] [INFO ] Flow matrix only has 4329 transitions (discarded 13 similar events)
// Phase 1: matrix 4329 rows 178 cols
[2024-05-29 16:11:50] [INFO ] Computed 1 invariants in 28 ms
[2024-05-29 16:11:51] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2024-05-29 16:11:51] [INFO ] Flow matrix only has 4329 transitions (discarded 13 similar events)
[2024-05-29 16:11:51] [INFO ] Invariant cache hit.
[2024-05-29 16:11:53] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:11:54] [INFO ] Implicit Places using invariants and state equation in 2680 ms returned []
Implicit Place search using SMT with State Equation took 3703 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 178/400 places, 4342/4615 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10104 ms. Remains : 178/400 places, 4342/4615 transitions.
Support contains 22 out of 178 places after structural reductions.
[2024-05-29 16:11:55] [INFO ] Flatten gal took : 554 ms
[2024-05-29 16:11:55] [INFO ] Flatten gal took : 306 ms
[2024-05-29 16:11:56] [INFO ] Input system was already deterministic with 4342 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (8 resets) in 11939 ms. (3 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
[2024-05-29 16:11:59] [INFO ] Flow matrix only has 4329 transitions (discarded 13 similar events)
[2024-05-29 16:11:59] [INFO ] Invariant cache hit.
[2024-05-29 16:12:00] [INFO ] State equation strengthened by 4104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 169/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4328/4506 variables, 178/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4506 variables, 4103/4282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4506 variables, 0/4282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/4507 variables, 1/4283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4507 variables, 0/4283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/4507 variables, 0/4283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4507/4507 variables, and 4283 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2584 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 4104/4104 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 169/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 16:12:04] [INFO ] Deduced a trap composed of 16 places in 1457 ms of which 19 ms to minimize.
[2024-05-29 16:12:06] [INFO ] Deduced a trap composed of 13 places in 1331 ms of which 2 ms to minimize.
[2024-05-29 16:12:07] [INFO ] Deduced a trap composed of 13 places in 1152 ms of which 2 ms to minimize.
[2024-05-29 16:12:08] [INFO ] Deduced a trap composed of 13 places in 1158 ms of which 2 ms to minimize.
SMT process timed out in 8652ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Graph (complete) has 596 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 177 transition count 4254
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 79 rules applied. Total rules applied 167 place count 114 transition count 4238
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 174 place count 107 transition count 4238
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 174 place count 107 transition count 4232
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 186 place count 101 transition count 4232
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 201 place count 86 transition count 4215
Iterating global reduction 3 with 15 rules applied. Total rules applied 216 place count 86 transition count 4215
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 223 place count 86 transition count 4208
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 229 place count 80 transition count 4202
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 80 transition count 4202
Performed 49 Post agglomeration using F-continuation condition with reduction of 3809 identical transitions.
Deduced a syphon composed of 49 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 335 place count 29 transition count 344
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 262 transitions
Reduce isomorphic transitions removed 283 transitions.
Iterating post reduction 4 with 283 rules applied. Total rules applied 618 place count 29 transition count 61
Performed 2 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 623 place count 26 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 639 place count 26 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 647 place count 26 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 651 place count 24 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 652 place count 23 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 653 place count 22 transition count 24
Applied a total of 653 rules in 416 ms. Remains 22 /178 variables (removed 156) and now considering 24/4342 (removed 4318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 22/178 places, 24/4342 transitions.
RANDOM walk for 40000 steps (8 resets) in 363 ms. (109 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
// Phase 1: matrix 24 rows 22 cols
[2024-05-29 16:12:09] [INFO ] Computed 7 invariants in 0 ms
[2024-05-29 16:12:09] [INFO ] State equation strengthened by 8 read => feed constraints.
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) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/26 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/29 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/32 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/43 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/46 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/46 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/46 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 37 constraints, problems are : Problem set: 0 solved, 2 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 16:12:09] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/26 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/29 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 16:12:09] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/32 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/32 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/43 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/43 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 16:12:09] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:09] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/43 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/43 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/46 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/46 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/46 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/46 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 43 constraints, problems are : Problem set: 0 solved, 2 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 24/24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 21
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 19 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 18 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 18 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 18 transition count 19
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 18 place count 12 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 12 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 12 transition count 12
Applied a total of 22 rules in 2 ms. Remains 12 /22 variables (removed 10) and now considering 12/24 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 12/22 places, 12/24 transitions.
RANDOM walk for 40000 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Probably explored full state space saw : 10 states, properties seen :0
Probabilistic random walk after 24 steps, saw 10 distinct states, run finished after 5 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 10 states, properties seen :0
Exhaustive walk after 24 steps, saw 10 distinct states, run finished after 2 ms. (steps per millisecond=12 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Computed a total of 11 stabilizing places and 11 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 178 transition count 4280
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 128 place count 116 transition count 4276
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 115 transition count 4275
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 130 place count 115 transition count 4262
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 156 place count 102 transition count 4262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 99 transition count 4257
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 99 transition count 4257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 165 place count 99 transition count 4254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 165 place count 99 transition count 4253
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 98 transition count 4253
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 97 transition count 4251
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 97 transition count 4251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 173 place count 97 transition count 4247
Performed 55 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 283 place count 42 transition count 4166
Ensure Unique test removed 1027 transitions
Reduce isomorphic transitions removed 1027 transitions.
Iterating post reduction 5 with 1027 rules applied. Total rules applied 1310 place count 42 transition count 3139
Drop transitions (Redundant composition of simpler transitions.) removed 3051 transitions
Redundant transition composition rules discarded 3051 transitions
Iterating global reduction 6 with 3051 rules applied. Total rules applied 4361 place count 42 transition count 88
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 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 4383 place count 31 transition count 77
Applied a total of 4383 rules in 1533 ms. Remains 31 /178 variables (removed 147) and now considering 77/4342 (removed 4265) transitions.
[2024-05-29 16:12:11] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
// Phase 1: matrix 66 rows 31 cols
[2024-05-29 16:12:11] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 16:12:11] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 16:12:11] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-05-29 16:12:11] [INFO ] Invariant cache hit.
[2024-05-29 16:12:11] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-29 16:12:11] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-29 16:12:11] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-29 16:12:11] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-05-29 16:12:11] [INFO ] Invariant cache hit.
[2024-05-29 16:12:11] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:12:11] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 4 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:12:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 65/96 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 44/116 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/97 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 117 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2986 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 4 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 8 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:14] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:12:15] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:16] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 65/96 variables, 31/112 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 76/232 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/97 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/97 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 233 constraints, problems are : Problem set: 0 solved, 76 unsolved in 6556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 80/80 constraints]
After SMT, in 9676ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 9678ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/178 places, 77/4342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11344 ms. Remains : 31/178 places, 77/4342 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT p1)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1420 steps (45 resets) in 10 ms. (129 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT p1)), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 77/77 transitions.
Applied a total of 0 rules in 10 ms. Remains 31 /31 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-29 16:12:22] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-05-29 16:12:22] [INFO ] Invariant cache hit.
[2024-05-29 16:12:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 16:12:22] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-05-29 16:12:22] [INFO ] Invariant cache hit.
[2024-05-29 16:12:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-29 16:12:22] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-29 16:12:22] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-29 16:12:22] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-05-29 16:12:22] [INFO ] Invariant cache hit.
[2024-05-29 16:12:22] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:12:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:12:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 65/96 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 44/116 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/97 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 117 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2915 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:12:25] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:26] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 65/96 variables, 31/112 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 76/232 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/97 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/97 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 233 constraints, problems are : Problem set: 0 solved, 76 unsolved in 6609 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 80/80 constraints]
After SMT, in 9625ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 9627ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9805 ms. Remains : 31/31 places, 77/77 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT p1)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1357 steps (43 resets) in 12 ms. (104 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT p1)), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 73 ms.
Built C files in :
/tmp/ltsmin8764577876132019259
[2024-05-29 16:12:32] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2024-05-29 16:12:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:12:32] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2024-05-29 16:12:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:12:32] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2024-05-29 16:12:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:12:32] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8764577876132019259
Running compilation step : cd /tmp/ltsmin8764577876132019259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 422 ms.
Running link step : cd /tmp/ltsmin8764577876132019259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8764577876132019259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10560662079682785385.hoa' '--buchi-type=spotba'
LTSmin run took 338 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-00 finished in 24065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 178 transition count 4278
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 132 place count 114 transition count 4274
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 113 transition count 4272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 112 transition count 4272
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 136 place count 112 transition count 4259
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 162 place count 99 transition count 4259
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 166 place count 95 transition count 4252
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 95 transition count 4252
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 177 place count 95 transition count 4245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 177 place count 95 transition count 4244
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 94 transition count 4244
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 93 transition count 4242
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 93 transition count 4242
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 189 place count 93 transition count 4234
Performed 55 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 299 place count 38 transition count 4152
Ensure Unique test removed 2043 transitions
Reduce isomorphic transitions removed 2043 transitions.
Iterating post reduction 6 with 2043 rules applied. Total rules applied 2342 place count 38 transition count 2109
Drop transitions (Redundant composition of simpler transitions.) removed 2058 transitions
Redundant transition composition rules discarded 2058 transitions
Iterating global reduction 7 with 2058 rules applied. Total rules applied 4400 place count 38 transition count 51
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 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 4422 place count 27 transition count 40
Applied a total of 4422 rules in 812 ms. Remains 27 /178 variables (removed 151) and now considering 40/4342 (removed 4302) transitions.
[2024-05-29 16:12:34] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
// Phase 1: matrix 29 rows 27 cols
[2024-05-29 16:12:34] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 16:12:34] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 16:12:34] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-05-29 16:12:34] [INFO ] Invariant cache hit.
[2024-05-29 16:12:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 16:12:34] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-29 16:12:34] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-29 16:12:34] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-05-29 16:12:34] [INFO ] Invariant cache hit.
[2024-05-29 16:12:34] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:34] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:12:35] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1/56 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 113 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 72/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 2 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:38] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 27/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 39/180 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 181 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2700 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 101/101 constraints]
After SMT, in 5349ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 5349ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/178 places, 40/4342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6234 ms. Remains : 27/178 places, 40/4342 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 42 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-29 16:12:40] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-05-29 16:12:40] [INFO ] Invariant cache hit.
[2024-05-29 16:12:40] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 16:12:40] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-05-29 16:12:40] [INFO ] Invariant cache hit.
[2024-05-29 16:12:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 16:12:40] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 16:12:40] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-29 16:12:40] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-05-29 16:12:40] [INFO ] Invariant cache hit.
[2024-05-29 16:12:40] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:40] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:40] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:40] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:40] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 16:12:40] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 16:12:40] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 16:12:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:12:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1/56 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 113 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2574 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 72/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:12:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:12:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 16:12:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:12:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:12:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 27/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 39/180 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 181 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 101/101 constraints]
After SMT, in 5117ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 5118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5200 ms. Remains : 27/27 places, 40/40 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 48 ms.
Built C files in :
/tmp/ltsmin12859339036515671140
[2024-05-29 16:12:46] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2024-05-29 16:12:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:12:46] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2024-05-29 16:12:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:12:46] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2024-05-29 16:12:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 16:12:46] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12859339036515671140
Running compilation step : cd /tmp/ltsmin12859339036515671140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin12859339036515671140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12859339036515671140;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6544830686399517940.hoa' '--buchi-type=spotba'
LTSmin run took 114 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-03 finished in 13042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X(p0)))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 163 transition count 4324
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 163 transition count 4324
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 163 transition count 4323
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 43 place count 151 transition count 4310
Iterating global reduction 1 with 12 rules applied. Total rules applied 55 place count 151 transition count 4310
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 151 transition count 4305
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 146 transition count 4300
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 146 transition count 4300
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 143 transition count 4297
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 143 transition count 4297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 143 transition count 4296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 142 transition count 4295
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 142 transition count 4295
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 141 transition count 4294
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 141 transition count 4294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 141 transition count 4293
Applied a total of 82 rules in 100 ms. Remains 141 /178 variables (removed 37) and now considering 4293/4342 (removed 49) transitions.
[2024-05-29 16:12:46] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
// Phase 1: matrix 4281 rows 141 cols
[2024-05-29 16:12:46] [INFO ] Computed 1 invariants in 25 ms
[2024-05-29 16:12:48] [INFO ] Implicit Places using invariants in 1274 ms returned []
[2024-05-29 16:12:48] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-05-29 16:12:48] [INFO ] Invariant cache hit.
[2024-05-29 16:12:49] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:12:50] [INFO ] Implicit Places using invariants and state equation in 2874 ms returned []
Implicit Place search using SMT with State Equation took 4152 ms to find 0 implicit places.
Running 4292 sub problems to find dead transitions.
[2024-05-29 16:12:51] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-05-29 16:12:51] [INFO ] Invariant cache hit.
[2024-05-29 16:12:51] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4292 unsolved
SMT process timed out in 98288ms, After SMT, problems are : Problem set: 0 solved, 4292 unsolved
Search for dead transitions found 0 dead transitions in 98336ms
Starting structural reductions in LTL mode, iteration 1 : 141/178 places, 4293/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102614 ms. Remains : 141/178 places, 4293/4342 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 1213 ms.
Product exploration explored 100000 steps with 0 reset in 1506 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (8 resets) in 10832 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4695 steps, run visited all 1 properties in 55 ms. (steps per millisecond=85 )
Probabilistic random walk after 4695 steps, saw 4559 distinct states, run finished after 59 ms. (steps per millisecond=79 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 4293/4293 transitions.
Applied a total of 0 rules in 18 ms. Remains 141 /141 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
[2024-05-29 16:14:35] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-05-29 16:14:35] [INFO ] Invariant cache hit.
[2024-05-29 16:14:36] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2024-05-29 16:14:36] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-05-29 16:14:36] [INFO ] Invariant cache hit.
[2024-05-29 16:14:37] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:14:39] [INFO ] Implicit Places using invariants and state equation in 2643 ms returned []
Implicit Place search using SMT with State Equation took 3907 ms to find 0 implicit places.
Running 4292 sub problems to find dead transitions.
[2024-05-29 16:14:39] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-05-29 16:14:39] [INFO ] Invariant cache hit.
[2024-05-29 16:14:39] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4292 unsolved
SMT process timed out in 108640ms, After SMT, problems are : Problem set: 0 solved, 4292 unsolved
Search for dead transitions found 0 dead transitions in 108697ms
Finished structural reductions in LTL mode , in 1 iterations and 112652 ms. Remains : 141/141 places, 4293/4293 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (8 resets) in 13826 ms. (2 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4695 steps, run visited all 1 properties in 36 ms. (steps per millisecond=130 )
Probabilistic random walk after 4695 steps, saw 4559 distinct states, run finished after 36 ms. (steps per millisecond=130 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 0 reset in 1017 ms.
Product exploration timeout after 47450 steps with 0 reset in 10003 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 4293/4293 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 141 transition count 4293
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 33 place count 141 transition count 4304
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 44 place count 141 transition count 4304
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 63 place count 122 transition count 4285
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 82 place count 122 transition count 4285
Performed 58 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 140 place count 122 transition count 4298
Ensure Unique test removed 2080 transitions
Reduce isomorphic transitions removed 2080 transitions.
Iterating post reduction 1 with 2080 rules applied. Total rules applied 2220 place count 122 transition count 2218
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 2258 place count 84 transition count 2180
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 2296 place count 84 transition count 2180
Deduced a syphon composed of 45 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2069 transitions
Redundant transition composition rules discarded 2069 transitions
Iterating global reduction 2 with 2069 rules applied. Total rules applied 4365 place count 84 transition count 111
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 4376 place count 84 transition count 111
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 4398 place count 62 transition count 89
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 4420 place count 62 transition count 89
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 4420 rules in 837 ms. Remains 62 /141 variables (removed 79) and now considering 89/4293 (removed 4204) transitions.
[2024-05-29 16:16:45] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-29 16:16:45] [INFO ] Flow matrix only has 78 transitions (discarded 11 similar events)
// Phase 1: matrix 78 rows 62 cols
[2024-05-29 16:16:45] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 16:16:45] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:16:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:16:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 16:16:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 16:16:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 16:16:49] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
At refinement iteration 9 (OVERLAPS) 77/139 variables, 62/139 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 13/152 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/152 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 1/140 variables, 1/153 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 47 solved, 41 unsolved
[2024-05-29 16:16:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/140 variables, 1/154 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/140 variables, 0/154 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 16 (OVERLAPS) 0/140 variables, 0/154 constraints. Problems are: Problem set: 47 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 154 constraints, problems are : Problem set: 47 solved, 41 unsolved in 6344 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 47 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 35/62 variables, 1/1 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 77/78 constraints. Problems are: Problem set: 47 solved, 41 unsolved
[2024-05-29 16:16:51] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/98 constraints. Problems are: Problem set: 47 solved, 41 unsolved
[2024-05-29 16:16:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:16:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:16:53] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:16:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:16:53] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 5/103 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/103 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 77/139 variables, 62/165 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 13/178 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 41/219 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/219 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 1/140 variables, 1/220 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/220 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/220 constraints. Problems are: Problem set: 47 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 220 constraints, problems are : Problem set: 47 solved, 41 unsolved in 4709 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 41/88 constraints, Known Traps: 102/102 constraints]
After SMT, in 11075ms problems are : Problem set: 47 solved, 41 unsolved
Search for dead transitions found 47 dead transitions in 11078ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/141 places, 42/4293 transitions.
Graph (complete) has 313 edges and 62 vertex of which 28 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 28 /62 variables (removed 34) and now considering 42/42 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/141 places, 42/4293 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11934 ms. Remains : 28/141 places, 42/4293 transitions.
Built C files in :
/tmp/ltsmin6209752281133978017
[2024-05-29 16:16:56] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6209752281133978017
Running compilation step : cd /tmp/ltsmin6209752281133978017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6209752281133978017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin6209752281133978017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 4293/4293 transitions.
Applied a total of 0 rules in 12 ms. Remains 141 /141 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
[2024-05-29 16:16:59] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
// Phase 1: matrix 4281 rows 141 cols
[2024-05-29 16:16:59] [INFO ] Computed 1 invariants in 17 ms
[2024-05-29 16:17:00] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2024-05-29 16:17:00] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-05-29 16:17:00] [INFO ] Invariant cache hit.
[2024-05-29 16:17:01] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:17:03] [INFO ] Implicit Places using invariants and state equation in 2711 ms returned []
Implicit Place search using SMT with State Equation took 3958 ms to find 0 implicit places.
Running 4292 sub problems to find dead transitions.
[2024-05-29 16:17:03] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-05-29 16:17:03] [INFO ] Invariant cache hit.
[2024-05-29 16:17:03] [INFO ] State equation strengthened by 4104 read => feed constraints.
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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4292 unsolved
SMT process timed out in 106212ms, After SMT, problems are : Problem set: 0 solved, 4292 unsolved
Search for dead transitions found 0 dead transitions in 106265ms
Finished structural reductions in LTL mode , in 1 iterations and 110259 ms. Remains : 141/141 places, 4293/4293 transitions.
Built C files in :
/tmp/ltsmin3401699363552302848
[2024-05-29 16:18:50] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3401699363552302848
Running compilation step : cd /tmp/ltsmin3401699363552302848;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3401699363552302848;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3401699363552302848;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-29 16:18:53] [INFO ] Flatten gal took : 336 ms
[2024-05-29 16:18:54] [INFO ] Flatten gal took : 281 ms
[2024-05-29 16:18:54] [INFO ] Time to serialize gal into /tmp/LTL15623721928483126202.gal : 100 ms
[2024-05-29 16:18:54] [INFO ] Time to serialize properties into /tmp/LTL15632713839055533048.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15623721928483126202.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7027243672403023005.hoa' '-atoms' '/tmp/LTL15632713839055533048.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15632713839055533048.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7027243672403023005.hoa
Detected timeout of ITS tools.
[2024-05-29 16:19:09] [INFO ] Flatten gal took : 283 ms
[2024-05-29 16:19:10] [INFO ] Flatten gal took : 278 ms
[2024-05-29 16:19:10] [INFO ] Time to serialize gal into /tmp/LTL2991452150166321141.gal : 51 ms
[2024-05-29 16:19:10] [INFO ] Time to serialize properties into /tmp/LTL16956903686933104545.ltl : 3 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2991452150166321141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16956903686933104545.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((p19==0)||(p270==1))")U(X(X("((p19==0)||(p270==1))"))))))
Formula 0 simplified : F(!"((p19==0)||(p270==1))" R XX!"((p19==0)||(p270==1))")
Detected timeout of ITS tools.
[2024-05-29 16:19:25] [INFO ] Flatten gal took : 284 ms
[2024-05-29 16:19:25] [INFO ] Applying decomposition
[2024-05-29 16:19:25] [INFO ] Flatten gal took : 291 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12060924073128203564.txt' '-o' '/tmp/graph12060924073128203564.bin' '-w' '/tmp/graph12060924073128203564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12060924073128203564.bin' '-l' '-1' '-v' '-w' '/tmp/graph12060924073128203564.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:19:26] [INFO ] Decomposing Gal with order
[2024-05-29 16:19:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:19:28] [INFO ] Removed a total of 45150 redundant transitions.
[2024-05-29 16:19:28] [INFO ] Flatten gal took : 1196 ms
[2024-05-29 16:19:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 388 ms.
[2024-05-29 16:19:28] [INFO ] Time to serialize gal into /tmp/LTL9671665208138110044.gal : 50 ms
[2024-05-29 16:19:28] [INFO ] Time to serialize properties into /tmp/LTL15155720224039593999.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9671665208138110044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15155720224039593999.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i2.i0.u4.p19==0)||(i2.i7.u37.p270==1))")U(X(X("((i2.i0.u4.p19==0)||(i2.i7.u37.p270==1))"))))))
Formula 0 simplified : F(!"((i2.i0.u4.p19==0)||(i2.i7.u37.p270==1))" R XX!"((i2.i0.u4.p19==0)||(i2.i7.u37.p270==1))")
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-06 finished in 417227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(G(p1)&&F((G(p1)&&p2))))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 164 transition count 4326
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 164 transition count 4326
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 164 transition count 4325
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 153 transition count 4314
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 153 transition count 4314
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 153 transition count 4309
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 149 transition count 4305
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 149 transition count 4305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 149 transition count 4304
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 147 transition count 4302
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 147 transition count 4302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 147 transition count 4301
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 146 transition count 4300
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 146 transition count 4300
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 145 transition count 4299
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 145 transition count 4299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 145 transition count 4298
Applied a total of 75 rules in 110 ms. Remains 145 /178 variables (removed 33) and now considering 4298/4342 (removed 44) transitions.
[2024-05-29 16:19:44] [INFO ] Flow matrix only has 4285 transitions (discarded 13 similar events)
// Phase 1: matrix 4285 rows 145 cols
[2024-05-29 16:19:44] [INFO ] Computed 1 invariants in 23 ms
[2024-05-29 16:19:45] [INFO ] Implicit Places using invariants in 1248 ms returned []
[2024-05-29 16:19:45] [INFO ] Flow matrix only has 4285 transitions (discarded 13 similar events)
[2024-05-29 16:19:45] [INFO ] Invariant cache hit.
[2024-05-29 16:19:46] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:19:47] [INFO ] Implicit Places using invariants and state equation in 2610 ms returned []
Implicit Place search using SMT with State Equation took 3859 ms to find 0 implicit places.
Running 4297 sub problems to find dead transitions.
[2024-05-29 16:19:48] [INFO ] Flow matrix only has 4285 transitions (discarded 13 similar events)
[2024-05-29 16:19:48] [INFO ] Invariant cache hit.
[2024-05-29 16:19:48] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4297 unsolved
SMT process timed out in 97768ms, After SMT, problems are : Problem set: 0 solved, 4297 unsolved
Search for dead transitions found 0 dead transitions in 97811ms
Starting structural reductions in LTL mode, iteration 1 : 145/178 places, 4298/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101810 ms. Remains : 145/178 places, 4298/4342 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-08
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-08 finished in 102051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 162 transition count 4323
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 162 transition count 4323
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 162 transition count 4322
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 149 transition count 4308
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 149 transition count 4308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 64 place count 149 transition count 4303
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 143 transition count 4297
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 143 transition count 4297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 143 transition count 4296
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 140 transition count 4293
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 140 transition count 4293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 140 transition count 4292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 139 transition count 4291
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 139 transition count 4291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 138 transition count 4290
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 138 transition count 4290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 138 transition count 4289
Applied a total of 89 rules in 101 ms. Remains 138 /178 variables (removed 40) and now considering 4289/4342 (removed 53) transitions.
[2024-05-29 16:21:26] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
// Phase 1: matrix 4277 rows 138 cols
[2024-05-29 16:21:26] [INFO ] Computed 1 invariants in 22 ms
[2024-05-29 16:21:27] [INFO ] Implicit Places using invariants in 1244 ms returned []
[2024-05-29 16:21:27] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
[2024-05-29 16:21:27] [INFO ] Invariant cache hit.
[2024-05-29 16:21:28] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:21:30] [INFO ] Implicit Places using invariants and state equation in 2757 ms returned []
Implicit Place search using SMT with State Equation took 4004 ms to find 0 implicit places.
Running 4288 sub problems to find dead transitions.
[2024-05-29 16:21:30] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
[2024-05-29 16:21:30] [INFO ] Invariant cache hit.
[2024-05-29 16:21:30] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4288 unsolved
SMT process timed out in 97286ms, After SMT, problems are : Problem set: 0 solved, 4288 unsolved
Search for dead transitions found 0 dead transitions in 97329ms
Starting structural reductions in LTL mode, iteration 1 : 138/178 places, 4289/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101452 ms. Remains : 138/178 places, 4289/4342 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-10a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-09 finished in 102243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 162 transition count 4324
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 162 transition count 4324
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 162 transition count 4323
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 149 transition count 4309
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 149 transition count 4309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 149 transition count 4303
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 143 transition count 4297
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 143 transition count 4297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 143 transition count 4296
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 140 transition count 4293
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 140 transition count 4293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 140 transition count 4292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 139 transition count 4291
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 139 transition count 4291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 138 transition count 4290
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 138 transition count 4290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 138 transition count 4289
Applied a total of 90 rules in 100 ms. Remains 138 /178 variables (removed 40) and now considering 4289/4342 (removed 53) transitions.
[2024-05-29 16:23:08] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
// Phase 1: matrix 4277 rows 138 cols
[2024-05-29 16:23:08] [INFO ] Computed 1 invariants in 32 ms
[2024-05-29 16:23:09] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2024-05-29 16:23:09] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
[2024-05-29 16:23:09] [INFO ] Invariant cache hit.
[2024-05-29 16:23:10] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:23:12] [INFO ] Implicit Places using invariants and state equation in 2600 ms returned []
Implicit Place search using SMT with State Equation took 3806 ms to find 0 implicit places.
Running 4288 sub problems to find dead transitions.
[2024-05-29 16:23:12] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
[2024-05-29 16:23:12] [INFO ] Invariant cache hit.
[2024-05-29 16:23:12] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4288 unsolved
SMT process timed out in 97139ms, After SMT, problems are : Problem set: 0 solved, 4288 unsolved
Search for dead transitions found 0 dead transitions in 97201ms
Starting structural reductions in LTL mode, iteration 1 : 138/178 places, 4289/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101126 ms. Remains : 138/178 places, 4289/4342 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-11
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-11 finished in 101302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 163 transition count 4324
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 163 transition count 4324
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 43 place count 150 transition count 4310
Iterating global reduction 0 with 13 rules applied. Total rules applied 56 place count 150 transition count 4310
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 150 transition count 4305
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 144 transition count 4299
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 144 transition count 4299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 144 transition count 4298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 141 transition count 4295
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 141 transition count 4295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 141 transition count 4294
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 140 transition count 4293
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 140 transition count 4293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 139 transition count 4292
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 139 transition count 4292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 139 transition count 4291
Applied a total of 86 rules in 98 ms. Remains 139 /178 variables (removed 39) and now considering 4291/4342 (removed 51) transitions.
[2024-05-29 16:24:49] [INFO ] Flow matrix only has 4279 transitions (discarded 12 similar events)
// Phase 1: matrix 4279 rows 139 cols
[2024-05-29 16:24:49] [INFO ] Computed 1 invariants in 19 ms
[2024-05-29 16:24:50] [INFO ] Implicit Places using invariants in 1199 ms returned []
[2024-05-29 16:24:50] [INFO ] Flow matrix only has 4279 transitions (discarded 12 similar events)
[2024-05-29 16:24:50] [INFO ] Invariant cache hit.
[2024-05-29 16:24:51] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:24:53] [INFO ] Implicit Places using invariants and state equation in 2663 ms returned []
Implicit Place search using SMT with State Equation took 3864 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2024-05-29 16:24:53] [INFO ] Flow matrix only has 4279 transitions (discarded 12 similar events)
[2024-05-29 16:24:53] [INFO ] Invariant cache hit.
[2024-05-29 16:24:53] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 97504ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 97546ms
Starting structural reductions in LTL mode, iteration 1 : 139/178 places, 4291/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101530 ms. Remains : 139/178 places, 4291/4342 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-12
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 8 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-12 finished in 101708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1||G(F(p0))))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 163 transition count 4324
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 163 transition count 4324
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 163 transition count 4323
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 150 transition count 4309
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 150 transition count 4309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 150 transition count 4303
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 145 transition count 4298
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 145 transition count 4298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 145 transition count 4297
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 143 transition count 4295
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 143 transition count 4295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 143 transition count 4294
Applied a total of 79 rules in 71 ms. Remains 143 /178 variables (removed 35) and now considering 4294/4342 (removed 48) transitions.
[2024-05-29 16:26:31] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
// Phase 1: matrix 4282 rows 143 cols
[2024-05-29 16:26:31] [INFO ] Computed 1 invariants in 18 ms
[2024-05-29 16:26:32] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2024-05-29 16:26:32] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-05-29 16:26:32] [INFO ] Invariant cache hit.
[2024-05-29 16:26:33] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:26:35] [INFO ] Implicit Places using invariants and state equation in 2606 ms returned []
Implicit Place search using SMT with State Equation took 3833 ms to find 0 implicit places.
Running 4293 sub problems to find dead transitions.
[2024-05-29 16:26:35] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-05-29 16:26:35] [INFO ] Invariant cache hit.
[2024-05-29 16:26:35] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
SMT process timed out in 97181ms, After SMT, problems are : Problem set: 0 solved, 4293 unsolved
Search for dead transitions found 0 dead transitions in 97219ms
Starting structural reductions in LTL mode, iteration 1 : 143/178 places, 4294/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101161 ms. Remains : 143/178 places, 4294/4342 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-15
Product exploration timeout after 47190 steps with 0 reset in 10003 ms.
Product exploration explored 100000 steps with 3 reset in 2258 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 99 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 11592 ms. (3 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 932632 steps, run timeout after 9001 ms. (steps per millisecond=103 ) properties seen :3 out of 4
Probabilistic random walk after 932632 steps, saw 107881 distinct states, run finished after 9005 ms. (steps per millisecond=103 ) properties seen :3
[2024-05-29 16:28:37] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-05-29 16:28:37] [INFO ] Invariant cache hit.
[2024-05-29 16:28:37] [INFO ] State equation strengthened by 4104 read => feed constraints.
All remaining problems are real, not stopping.
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) 141/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4281/4424 variables, 143/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4424 variables, 4103/4247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4424 variables, 0/4247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/4425 variables, 1/4248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4425 variables, 0/4248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4425 variables, 0/4248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4425/4425 variables, and 4248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1384 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 4104/4104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 141/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 16:28:40] [INFO ] Deduced a trap composed of 13 places in 1390 ms of which 6 ms to minimize.
[2024-05-29 16:28:41] [INFO ] Deduced a trap composed of 16 places in 1390 ms of which 1 ms to minimize.
[2024-05-29 16:28:43] [INFO ] Deduced a trap composed of 13 places in 1493 ms of which 2 ms to minimize.
[2024-05-29 16:28:44] [INFO ] Deduced a trap composed of 13 places in 1382 ms of which 1 ms to minimize.
SMT process timed out in 7353ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 4294/4294 transitions.
Graph (complete) has 549 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 142 transition count 4220
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 71 rules applied. Total rules applied 145 place count 92 transition count 4199
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 155 place count 82 transition count 4199
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 166 place count 71 transition count 4188
Iterating global reduction 3 with 11 rules applied. Total rules applied 177 place count 71 transition count 4188
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 188 place count 60 transition count 4177
Iterating global reduction 3 with 11 rules applied. Total rules applied 199 place count 60 transition count 4177
Performed 45 Post agglomeration using F-continuation condition with reduction of 4084 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 297 place count 7 transition count 48
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 339 place count 7 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 340 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 5 transition count 5
Applied a total of 341 rules in 193 ms. Remains 5 /143 variables (removed 138) and now considering 5/4294 (removed 4289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 5/143 places, 5/4294 transitions.
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Probably explored full state space saw : 4 states, properties seen :0
Probabilistic random walk after 9 steps, saw 4 distinct states, run finished after 4 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 4 states, properties seen :0
Exhaustive walk after 9 steps, saw 4 distinct states, run finished after 1 ms. (steps per millisecond=9 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 4294/4294 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 4294/4294 (removed 0) transitions.
[2024-05-29 16:28:45] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-05-29 16:28:45] [INFO ] Invariant cache hit.
[2024-05-29 16:28:46] [INFO ] Implicit Places using invariants in 1233 ms returned []
[2024-05-29 16:28:46] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-05-29 16:28:46] [INFO ] Invariant cache hit.
[2024-05-29 16:28:47] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:28:49] [INFO ] Implicit Places using invariants and state equation in 2618 ms returned []
Implicit Place search using SMT with State Equation took 3852 ms to find 0 implicit places.
Running 4293 sub problems to find dead transitions.
[2024-05-29 16:28:49] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-05-29 16:28:49] [INFO ] Invariant cache hit.
[2024-05-29 16:28:49] [INFO ] State equation strengthened by 4104 read => feed constraints.
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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
SMT process timed out in 97443ms, After SMT, problems are : Problem set: 0 solved, 4293 unsolved
Search for dead transitions found 0 dead transitions in 97486ms
Finished structural reductions in LTL mode , in 1 iterations and 101374 ms. Remains : 143/143 places, 4294/4294 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (10 resets) in 10887 ms. (3 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4723 steps, run visited all 2 properties in 44 ms. (steps per millisecond=107 )
Probabilistic random walk after 4723 steps, saw 4570 distinct states, run finished after 44 ms. (steps per millisecond=107 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Product exploration timeout after 47540 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 4294/4294 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 143 transition count 4294
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 39 place count 143 transition count 4304
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 49 place count 143 transition count 4304
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 74 place count 118 transition count 4279
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 99 place count 118 transition count 4279
Performed 56 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 155 place count 118 transition count 4291
Ensure Unique test removed 1056 transitions
Reduce isomorphic transitions removed 1056 transitions.
Iterating post reduction 1 with 1056 rules applied. Total rules applied 1211 place count 118 transition count 3235
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1247 place count 82 transition count 3199
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1283 place count 82 transition count 3199
Deduced a syphon composed of 44 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3076 transitions
Redundant transition composition rules discarded 3076 transitions
Iterating global reduction 2 with 3076 rules applied. Total rules applied 4359 place count 82 transition count 123
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 4370 place count 82 transition count 123
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 4391 place count 61 transition count 102
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 4412 place count 61 transition count 102
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 4412 rules in 1401 ms. Remains 61 /143 variables (removed 82) and now considering 102/4294 (removed 4192) transitions.
[2024-05-29 16:30:42] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-29 16:30:42] [INFO ] Flow matrix only has 91 transitions (discarded 11 similar events)
// Phase 1: matrix 91 rows 61 cols
[2024-05-29 16:30:42] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 16:30:42] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 16:30:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 5 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:30:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:30:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:30:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:30:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 16:30:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 16:30:45] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-29 16:30:45] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 8 (OVERLAPS) 90/151 variables, 61/132 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 27/159 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/159 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 1/152 variables, 1/160 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/160 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/160 constraints. Problems are: Problem set: 46 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 160 constraints, problems are : Problem set: 46 solved, 55 unsolved in 5282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 46 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 35/61 variables, 1/1 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 70/71 constraints. Problems are: Problem set: 46 solved, 55 unsolved
[2024-05-29 16:30:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:30:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:30:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:30:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:30:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:30:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 20/91 constraints. Problems are: Problem set: 46 solved, 55 unsolved
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:30:48] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:30:49] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:30:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:30:49] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:30:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 11/102 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/102 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 90/151 variables, 61/163 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 27/190 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 55/245 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/245 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 1/152 variables, 1/246 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/246 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/152 variables, 0/246 constraints. Problems are: Problem set: 46 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 246 constraints, problems are : Problem set: 46 solved, 55 unsolved in 6886 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 55/101 constraints, Known Traps: 101/101 constraints]
After SMT, in 12211ms problems are : Problem set: 46 solved, 55 unsolved
Search for dead transitions found 46 dead transitions in 12214ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 61/143 places, 56/4294 transitions.
Graph (complete) has 312 edges and 61 vertex of which 27 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 27 /61 variables (removed 34) and now considering 56/56 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/143 places, 56/4294 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13633 ms. Remains : 27/143 places, 56/4294 transitions.
Built C files in :
/tmp/ltsmin8043245347798753744
[2024-05-29 16:30:54] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8043245347798753744
Running compilation step : cd /tmp/ltsmin8043245347798753744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8043245347798753744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin8043245347798753744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 4294/4294 transitions.
Applied a total of 0 rules in 12 ms. Remains 143 /143 variables (removed 0) and now considering 4294/4294 (removed 0) transitions.
[2024-05-29 16:30:57] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
// Phase 1: matrix 4282 rows 143 cols
[2024-05-29 16:30:57] [INFO ] Computed 1 invariants in 16 ms
[2024-05-29 16:30:58] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2024-05-29 16:30:58] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-05-29 16:30:58] [INFO ] Invariant cache hit.
[2024-05-29 16:30:59] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 16:31:01] [INFO ] Implicit Places using invariants and state equation in 2621 ms returned []
Implicit Place search using SMT with State Equation took 3823 ms to find 0 implicit places.
Running 4293 sub problems to find dead transitions.
[2024-05-29 16:31:01] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-05-29 16:31:01] [INFO ] Invariant cache hit.
[2024-05-29 16:31:01] [INFO ] State equation strengthened by 4104 read => feed constraints.
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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
SMT process timed out in 97330ms, After SMT, problems are : Problem set: 0 solved, 4293 unsolved
Search for dead transitions found 0 dead transitions in 97372ms
Finished structural reductions in LTL mode , in 1 iterations and 101229 ms. Remains : 143/143 places, 4294/4294 transitions.
Built C files in :
/tmp/ltsmin16560067042105504695
[2024-05-29 16:32:38] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16560067042105504695
Running compilation step : cd /tmp/ltsmin16560067042105504695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin16560067042105504695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin16560067042105504695;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-29 16:32:42] [INFO ] Flatten gal took : 320 ms
[2024-05-29 16:32:42] [INFO ] Flatten gal took : 261 ms
[2024-05-29 16:32:42] [INFO ] Time to serialize gal into /tmp/LTL5023903880953881303.gal : 52 ms
[2024-05-29 16:32:42] [INFO ] Time to serialize properties into /tmp/LTL8146287628522661889.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5023903880953881303.gal' '-t' 'CGAL' '-hoa' '/tmp/aut573821843895928530.hoa' '-atoms' '/tmp/LTL8146287628522661889.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL8146287628522661889.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut573821843895928530.hoa
Detected timeout of ITS tools.
[2024-05-29 16:32:58] [INFO ] Flatten gal took : 264 ms
[2024-05-29 16:32:58] [INFO ] Flatten gal took : 264 ms
[2024-05-29 16:32:58] [INFO ] Time to serialize gal into /tmp/LTL9922310560024770212.gal : 49 ms
[2024-05-29 16:32:58] [INFO ] Time to serialize properties into /tmp/LTL7896097588268987918.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9922310560024770212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7896097588268987918.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X("((p87==0)||(p115==1))"))&&((G(F("((p87==0)||(p115==1))")))||("((p115==0)&&(p87==1))")))))
Formula 0 simplified : G(X!"((p87==0)||(p115==1))" | (!"((p115==0)&&(p87==1))" & FG!"((p87==0)||(p115==1))"))
Detected timeout of ITS tools.
[2024-05-29 16:33:14] [INFO ] Flatten gal took : 266 ms
[2024-05-29 16:33:14] [INFO ] Applying decomposition
[2024-05-29 16:33:14] [INFO ] Flatten gal took : 269 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1189331430303991336.txt' '-o' '/tmp/graph1189331430303991336.bin' '-w' '/tmp/graph1189331430303991336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1189331430303991336.bin' '-l' '-1' '-v' '-w' '/tmp/graph1189331430303991336.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:33:15] [INFO ] Decomposing Gal with order
[2024-05-29 16:33:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:33:16] [INFO ] Removed a total of 45147 redundant transitions.
[2024-05-29 16:33:16] [INFO ] Flatten gal took : 639 ms
[2024-05-29 16:33:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 208 ms.
[2024-05-29 16:33:16] [INFO ] Time to serialize gal into /tmp/LTL8722125530037782415.gal : 26 ms
[2024-05-29 16:33:16] [INFO ] Time to serialize properties into /tmp/LTL1539599280105326812.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8722125530037782415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1539599280105326812.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((X("((i2.i1.i0.u12.p87==0)||(i1.u41.p115==1))"))&&((G(F("((i2.i1.i0.u12.p87==0)||(i1.u41.p115==1))")))||("((i1.u41.p115==0)&&(i2....179
Formula 0 simplified : G(X!"((i2.i1.i0.u12.p87==0)||(i1.u41.p115==1))" | (!"((i1.u41.p115==0)&&(i2.i1.i0.u12.p87==1))" & FG!"((i2.i1.i0.u12.p87==0)||(i1.u4...169
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-15 finished in 420434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1||G(F(p0))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-10a-LTLCardinality-15
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 177 transition count 4276
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 134 place count 112 transition count 4272
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 111 transition count 4271
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 136 place count 111 transition count 4258
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 162 place count 98 transition count 4258
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 95 transition count 4252
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 95 transition count 4252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 171 place count 95 transition count 4249
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 94 transition count 4247
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 94 transition count 4247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 177 place count 94 transition count 4243
Performed 46 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 269 place count 48 transition count 4177
Ensure Unique test removed 1027 transitions
Reduce isomorphic transitions removed 1027 transitions.
Iterating post reduction 5 with 1027 rules applied. Total rules applied 1296 place count 48 transition count 3150
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1310 place count 41 transition count 3143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1317 place count 41 transition count 3136
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1321 place count 37 transition count 3132
Applied a total of 1321 rules in 445 ms. Remains 37 /178 variables (removed 141) and now considering 3132/4342 (removed 1210) transitions.
[2024-05-29 16:33:32] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
// Phase 1: matrix 3120 rows 37 cols
[2024-05-29 16:33:32] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 16:33:33] [INFO ] Implicit Places using invariants in 915 ms returned []
[2024-05-29 16:33:33] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-05-29 16:33:33] [INFO ] Invariant cache hit.
[2024-05-29 16:33:34] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-29 16:33:34] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-05-29 16:33:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 11/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:33:36] [INFO ] Deduced a trap composed of 5 places in 941 ms of which 0 ms to minimize.
[2024-05-29 16:33:37] [INFO ] Deduced a trap composed of 4 places in 941 ms of which 1 ms to minimize.
[2024-05-29 16:33:38] [INFO ] Deduced a trap composed of 4 places in 949 ms of which 0 ms to minimize.
[2024-05-29 16:33:38] [INFO ] Deduced a trap composed of 4 places in 935 ms of which 0 ms to minimize.
[2024-05-29 16:33:39] [INFO ] Deduced a trap composed of 4 places in 885 ms of which 1 ms to minimize.
[2024-05-29 16:33:40] [INFO ] Deduced a trap composed of 6 places in 885 ms of which 0 ms to minimize.
[2024-05-29 16:33:41] [INFO ] Deduced a trap composed of 4 places in 921 ms of which 0 ms to minimize.
[2024-05-29 16:33:42] [INFO ] Deduced a trap composed of 4 places in 906 ms of which 1 ms to minimize.
[2024-05-29 16:33:43] [INFO ] Deduced a trap composed of 4 places in 898 ms of which 0 ms to minimize.
[2024-05-29 16:33:44] [INFO ] Deduced a trap composed of 4 places in 899 ms of which 1 ms to minimize.
[2024-05-29 16:33:45] [INFO ] Deduced a trap composed of 4 places in 896 ms of which 0 ms to minimize.
[2024-05-29 16:33:46] [INFO ] Deduced a trap composed of 4 places in 890 ms of which 0 ms to minimize.
[2024-05-29 16:33:47] [INFO ] Deduced a trap composed of 4 places in 765 ms of which 1 ms to minimize.
[2024-05-29 16:33:47] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 0 ms to minimize.
[2024-05-29 16:33:48] [INFO ] Deduced a trap composed of 5 places in 747 ms of which 1 ms to minimize.
[2024-05-29 16:33:49] [INFO ] Deduced a trap composed of 4 places in 750 ms of which 1 ms to minimize.
[2024-05-29 16:33:49] [INFO ] Deduced a trap composed of 4 places in 640 ms of which 1 ms to minimize.
[2024-05-29 16:33:50] [INFO ] Deduced a trap composed of 4 places in 571 ms of which 1 ms to minimize.
[2024-05-29 16:33:51] [INFO ] Deduced a trap composed of 4 places in 776 ms of which 0 ms to minimize.
[2024-05-29 16:33:51] [INFO ] Deduced a trap composed of 4 places in 751 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:33:52] [INFO ] Deduced a trap composed of 5 places in 690 ms of which 0 ms to minimize.
[2024-05-29 16:33:53] [INFO ] Deduced a trap composed of 5 places in 582 ms of which 1 ms to minimize.
[2024-05-29 16:33:53] [INFO ] Deduced a trap composed of 5 places in 502 ms of which 0 ms to minimize.
[2024-05-29 16:33:54] [INFO ] Deduced a trap composed of 4 places in 755 ms of which 0 ms to minimize.
[2024-05-29 16:33:55] [INFO ] Deduced a trap composed of 4 places in 736 ms of which 1 ms to minimize.
[2024-05-29 16:33:55] [INFO ] Deduced a trap composed of 4 places in 569 ms of which 1 ms to minimize.
[2024-05-29 16:33:56] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 1 ms to minimize.
[2024-05-29 16:33:56] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 1 ms to minimize.
[2024-05-29 16:33:57] [INFO ] Deduced a trap composed of 5 places in 496 ms of which 1 ms to minimize.
[2024-05-29 16:33:57] [INFO ] Deduced a trap composed of 5 places in 411 ms of which 0 ms to minimize.
[2024-05-29 16:33:58] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 1 ms to minimize.
[2024-05-29 16:33:58] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 0 ms to minimize.
[2024-05-29 16:33:58] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 0 ms to minimize.
[2024-05-29 16:33:58] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 0 ms to minimize.
[2024-05-29 16:33:59] [INFO ] Deduced a trap composed of 4 places in 590 ms of which 1 ms to minimize.
[2024-05-29 16:34:00] [INFO ] Deduced a trap composed of 4 places in 860 ms of which 1 ms to minimize.
[2024-05-29 16:34:01] [INFO ] Deduced a trap composed of 4 places in 765 ms of which 1 ms to minimize.
[2024-05-29 16:34:01] [INFO ] Deduced a trap composed of 4 places in 664 ms of which 1 ms to minimize.
[2024-05-29 16:34:02] [INFO ] Deduced a trap composed of 4 places in 671 ms of which 0 ms to minimize.
[2024-05-29 16:34:02] [INFO ] Deduced a trap composed of 4 places in 585 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:34:03] [INFO ] Deduced a trap composed of 4 places in 724 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:34:04] [INFO ] Deduced a trap composed of 4 places in 724 ms of which 1 ms to minimize.
[2024-05-29 16:34:05] [INFO ] Deduced a trap composed of 4 places in 856 ms of which 1 ms to minimize.
SMT process timed out in 30886ms, After SMT, problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 30886ms
Starting structural reductions in LI_LTL mode, iteration 1 : 37/178 places, 3132/4342 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 33615 ms. Remains : 37/178 places, 3132/4342 transitions.
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-15
Product exploration explored 100000 steps with 5 reset in 1581 ms.
Product exploration explored 100000 steps with 1 reset in 1559 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (19 resets) in 14596 ms. (2 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
[2024-05-29 16:34:13] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-05-29 16:34:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3119/3156 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3156 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/3156 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3156/3157 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 16:34:15] [INFO ] Deduced a trap composed of 4 places in 993 ms of which 0 ms to minimize.
[2024-05-29 16:34:16] [INFO ] Deduced a trap composed of 4 places in 992 ms of which 0 ms to minimize.
[2024-05-29 16:34:17] [INFO ] Deduced a trap composed of 4 places in 812 ms of which 1 ms to minimize.
[2024-05-29 16:34:17] [INFO ] Deduced a trap composed of 4 places in 797 ms of which 1 ms to minimize.
[2024-05-29 16:34:18] [INFO ] Deduced a trap composed of 4 places in 801 ms of which 0 ms to minimize.
[2024-05-29 16:34:19] [INFO ] Deduced a trap composed of 4 places in 710 ms of which 0 ms to minimize.
SMT process timed out in 5747ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 3132/3132 transitions.
Graph (complete) has 190 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 36 transition count 3108
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 25 transition count 3097
Performed 11 Post agglomeration using F-continuation condition with reduction of 3049 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 14 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 89 place count 14 transition count 16
Applied a total of 89 rules in 82 ms. Remains 14 /37 variables (removed 23) and now considering 16/3132 (removed 3116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 14/37 places, 16/3132 transitions.
RANDOM walk for 40000 steps (16328 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2448 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Probably explored full state space saw : 15 states, properties seen :0
Probabilistic random walk after 31 steps, saw 15 distinct states, run finished after 4 ms. (steps per millisecond=7 ) properties seen :0
Explored full state space saw : 15 states, properties seen :0
Exhaustive walk after 31 steps, saw 15 distinct states, run finished after 1 ms. (steps per millisecond=31 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 229 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 3132/3132 transitions.
Applied a total of 0 rules in 12 ms. Remains 37 /37 variables (removed 0) and now considering 3132/3132 (removed 0) transitions.
[2024-05-29 16:34:19] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-05-29 16:34:19] [INFO ] Invariant cache hit.
[2024-05-29 16:34:20] [INFO ] Implicit Places using invariants in 942 ms returned []
[2024-05-29 16:34:20] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-05-29 16:34:20] [INFO ] Invariant cache hit.
[2024-05-29 16:34:22] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 2419 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-29 16:34:22] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-05-29 16:34:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 11/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:34:23] [INFO ] Deduced a trap composed of 5 places in 968 ms of which 1 ms to minimize.
[2024-05-29 16:34:24] [INFO ] Deduced a trap composed of 4 places in 965 ms of which 0 ms to minimize.
[2024-05-29 16:34:25] [INFO ] Deduced a trap composed of 4 places in 950 ms of which 1 ms to minimize.
[2024-05-29 16:34:26] [INFO ] Deduced a trap composed of 4 places in 906 ms of which 0 ms to minimize.
[2024-05-29 16:34:27] [INFO ] Deduced a trap composed of 4 places in 899 ms of which 0 ms to minimize.
[2024-05-29 16:34:28] [INFO ] Deduced a trap composed of 6 places in 899 ms of which 1 ms to minimize.
[2024-05-29 16:34:29] [INFO ] Deduced a trap composed of 4 places in 911 ms of which 1 ms to minimize.
[2024-05-29 16:34:30] [INFO ] Deduced a trap composed of 4 places in 932 ms of which 0 ms to minimize.
[2024-05-29 16:34:31] [INFO ] Deduced a trap composed of 4 places in 907 ms of which 0 ms to minimize.
[2024-05-29 16:34:32] [INFO ] Deduced a trap composed of 4 places in 895 ms of which 1 ms to minimize.
[2024-05-29 16:34:33] [INFO ] Deduced a trap composed of 4 places in 907 ms of which 1 ms to minimize.
[2024-05-29 16:34:33] [INFO ] Deduced a trap composed of 4 places in 902 ms of which 1 ms to minimize.
[2024-05-29 16:34:34] [INFO ] Deduced a trap composed of 4 places in 780 ms of which 1 ms to minimize.
[2024-05-29 16:34:35] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 0 ms to minimize.
[2024-05-29 16:34:36] [INFO ] Deduced a trap composed of 5 places in 762 ms of which 1 ms to minimize.
[2024-05-29 16:34:36] [INFO ] Deduced a trap composed of 4 places in 770 ms of which 1 ms to minimize.
[2024-05-29 16:34:37] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 2 ms to minimize.
[2024-05-29 16:34:38] [INFO ] Deduced a trap composed of 4 places in 564 ms of which 0 ms to minimize.
[2024-05-29 16:34:38] [INFO ] Deduced a trap composed of 4 places in 781 ms of which 0 ms to minimize.
[2024-05-29 16:34:39] [INFO ] Deduced a trap composed of 4 places in 747 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:34:40] [INFO ] Deduced a trap composed of 5 places in 667 ms of which 0 ms to minimize.
[2024-05-29 16:34:40] [INFO ] Deduced a trap composed of 5 places in 583 ms of which 0 ms to minimize.
[2024-05-29 16:34:41] [INFO ] Deduced a trap composed of 5 places in 524 ms of which 1 ms to minimize.
[2024-05-29 16:34:42] [INFO ] Deduced a trap composed of 4 places in 737 ms of which 0 ms to minimize.
[2024-05-29 16:34:42] [INFO ] Deduced a trap composed of 4 places in 660 ms of which 0 ms to minimize.
[2024-05-29 16:34:43] [INFO ] Deduced a trap composed of 4 places in 551 ms of which 0 ms to minimize.
[2024-05-29 16:34:43] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 0 ms to minimize.
[2024-05-29 16:34:44] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 0 ms to minimize.
[2024-05-29 16:34:44] [INFO ] Deduced a trap composed of 5 places in 429 ms of which 0 ms to minimize.
[2024-05-29 16:34:45] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 0 ms to minimize.
[2024-05-29 16:34:45] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 0 ms to minimize.
[2024-05-29 16:34:45] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 0 ms to minimize.
[2024-05-29 16:34:45] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2024-05-29 16:34:46] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2024-05-29 16:34:46] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 0 ms to minimize.
[2024-05-29 16:34:47] [INFO ] Deduced a trap composed of 4 places in 744 ms of which 0 ms to minimize.
[2024-05-29 16:34:47] [INFO ] Deduced a trap composed of 4 places in 650 ms of which 1 ms to minimize.
[2024-05-29 16:34:48] [INFO ] Deduced a trap composed of 4 places in 582 ms of which 0 ms to minimize.
[2024-05-29 16:34:49] [INFO ] Deduced a trap composed of 4 places in 646 ms of which 0 ms to minimize.
[2024-05-29 16:34:49] [INFO ] Deduced a trap composed of 4 places in 567 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:34:50] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:34:51] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 1 ms to minimize.
[2024-05-29 16:34:52] [INFO ] Deduced a trap composed of 4 places in 794 ms of which 1 ms to minimize.
[2024-05-29 16:34:53] [INFO ] Deduced a trap composed of 4 places in 778 ms of which 1 ms to minimize.
SMT process timed out in 30750ms, After SMT, problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 30751ms
Finished structural reductions in LTL mode , in 1 iterations and 33183 ms. Remains : 37/37 places, 3132/3132 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (18 resets) in 11428 ms. (3 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 938781 steps, run timeout after 6001 ms. (steps per millisecond=156 ) properties seen :0 out of 2
Probabilistic random walk after 938781 steps, saw 82396 distinct states, run finished after 6002 ms. (steps per millisecond=156 ) properties seen :0
[2024-05-29 16:35:02] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-05-29 16:35:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 16:35:03] [INFO ] Deduced a trap composed of 4 places in 950 ms of which 0 ms to minimize.
[2024-05-29 16:35:04] [INFO ] Deduced a trap composed of 4 places in 964 ms of which 1 ms to minimize.
[2024-05-29 16:35:05] [INFO ] Deduced a trap composed of 4 places in 830 ms of which 1 ms to minimize.
[2024-05-29 16:35:05] [INFO ] Deduced a trap composed of 4 places in 703 ms of which 1 ms to minimize.
[2024-05-29 16:35:06] [INFO ] Deduced a trap composed of 4 places in 706 ms of which 0 ms to minimize.
[2024-05-29 16:35:07] [INFO ] Deduced a trap composed of 4 places in 813 ms of which 0 ms to minimize.
SMT process timed out in 5056ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 3132/3132 transitions.
Graph (complete) has 190 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 36 transition count 3108
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 25 transition count 3097
Performed 11 Post agglomeration using F-continuation condition with reduction of 3049 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 14 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 89 place count 14 transition count 16
Applied a total of 89 rules in 83 ms. Remains 14 /37 variables (removed 23) and now considering 16/3132 (removed 3116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 14/37 places, 16/3132 transitions.
RANDOM walk for 46 steps (19 resets) in 4 ms. (9 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1 reset in 558 ms.
Product exploration explored 100000 steps with 0 reset in 1008 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 3132/3132 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3066 transitions
Redundant transition composition rules discarded 3066 transitions
Iterating global reduction 0 with 3066 rules applied. Total rules applied 3066 place count 37 transition count 66
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 3077 place count 37 transition count 66
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 3077 rules in 730 ms. Remains 37 /37 variables (removed 0) and now considering 66/3132 (removed 3066) transitions.
[2024-05-29 16:35:10] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2024-05-29 16:35:10] [INFO ] Flow matrix only has 55 transitions (discarded 11 similar events)
// Phase 1: matrix 55 rows 37 cols
[2024-05-29 16:35:10] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 16:35:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 11/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:35:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 5 (OVERLAPS) 54/91 variables, 37/68 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 16:35:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 13/81 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/81 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/92 variables, 1/82 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/83 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/83 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 1/84 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/84 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/84 constraints. Problems are: Problem set: 11 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 84 constraints, problems are : Problem set: 11 solved, 26 unsolved in 2023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 11 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 22/37 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 45/46 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:35:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/66 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 16:35:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 20/86 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 15/101 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 16:35:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 2/103 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/103 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 54/91 variables, 37/140 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 26/166 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 1/92 variables, 1/167 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/167 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/167 constraints. Problems are: Problem set: 11 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 167 constraints, problems are : Problem set: 11 solved, 26 unsolved in 3065 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/37 constraints, Known Traps: 102/102 constraints]
After SMT, in 5097ms problems are : Problem set: 11 solved, 26 unsolved
Search for dead transitions found 11 dead transitions in 5098ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 37/37 places, 55/3132 transitions.
Graph (complete) has 301 edges and 37 vertex of which 26 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 26 /37 variables (removed 11) and now considering 55/55 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/37 places, 55/3132 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5845 ms. Remains : 26/37 places, 55/3132 transitions.
Built C files in :
/tmp/ltsmin9575865294069985871
[2024-05-29 16:35:15] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9575865294069985871
Running compilation step : cd /tmp/ltsmin9575865294069985871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin9575865294069985871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin9575865294069985871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 3132/3132 transitions.
Applied a total of 0 rules in 14 ms. Remains 37 /37 variables (removed 0) and now considering 3132/3132 (removed 0) transitions.
[2024-05-29 16:35:18] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
// Phase 1: matrix 3120 rows 37 cols
[2024-05-29 16:35:18] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 16:35:19] [INFO ] Implicit Places using invariants in 887 ms returned []
[2024-05-29 16:35:19] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-05-29 16:35:19] [INFO ] Invariant cache hit.
[2024-05-29 16:35:21] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 2341 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-29 16:35:21] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-05-29 16:35:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 11/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:35:22] [INFO ] Deduced a trap composed of 5 places in 989 ms of which 1 ms to minimize.
[2024-05-29 16:35:23] [INFO ] Deduced a trap composed of 4 places in 1167 ms of which 1 ms to minimize.
[2024-05-29 16:35:24] [INFO ] Deduced a trap composed of 4 places in 972 ms of which 0 ms to minimize.
[2024-05-29 16:35:25] [INFO ] Deduced a trap composed of 4 places in 912 ms of which 1 ms to minimize.
[2024-05-29 16:35:26] [INFO ] Deduced a trap composed of 4 places in 892 ms of which 0 ms to minimize.
[2024-05-29 16:35:27] [INFO ] Deduced a trap composed of 6 places in 896 ms of which 0 ms to minimize.
[2024-05-29 16:35:28] [INFO ] Deduced a trap composed of 4 places in 910 ms of which 0 ms to minimize.
[2024-05-29 16:35:29] [INFO ] Deduced a trap composed of 4 places in 899 ms of which 1 ms to minimize.
[2024-05-29 16:35:30] [INFO ] Deduced a trap composed of 4 places in 894 ms of which 1 ms to minimize.
[2024-05-29 16:35:31] [INFO ] Deduced a trap composed of 4 places in 913 ms of which 1 ms to minimize.
[2024-05-29 16:35:31] [INFO ] Deduced a trap composed of 4 places in 899 ms of which 0 ms to minimize.
[2024-05-29 16:35:32] [INFO ] Deduced a trap composed of 4 places in 893 ms of which 1 ms to minimize.
[2024-05-29 16:35:33] [INFO ] Deduced a trap composed of 4 places in 748 ms of which 0 ms to minimize.
[2024-05-29 16:35:34] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 1 ms to minimize.
[2024-05-29 16:35:34] [INFO ] Deduced a trap composed of 5 places in 754 ms of which 1 ms to minimize.
[2024-05-29 16:35:35] [INFO ] Deduced a trap composed of 4 places in 774 ms of which 1 ms to minimize.
[2024-05-29 16:35:36] [INFO ] Deduced a trap composed of 4 places in 653 ms of which 1 ms to minimize.
[2024-05-29 16:35:36] [INFO ] Deduced a trap composed of 4 places in 554 ms of which 0 ms to minimize.
[2024-05-29 16:35:37] [INFO ] Deduced a trap composed of 4 places in 791 ms of which 0 ms to minimize.
[2024-05-29 16:35:38] [INFO ] Deduced a trap composed of 4 places in 763 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:35:39] [INFO ] Deduced a trap composed of 5 places in 673 ms of which 1 ms to minimize.
[2024-05-29 16:35:39] [INFO ] Deduced a trap composed of 5 places in 583 ms of which 1 ms to minimize.
[2024-05-29 16:35:40] [INFO ] Deduced a trap composed of 5 places in 517 ms of which 1 ms to minimize.
[2024-05-29 16:35:41] [INFO ] Deduced a trap composed of 4 places in 740 ms of which 0 ms to minimize.
[2024-05-29 16:35:41] [INFO ] Deduced a trap composed of 4 places in 657 ms of which 0 ms to minimize.
[2024-05-29 16:35:42] [INFO ] Deduced a trap composed of 4 places in 550 ms of which 1 ms to minimize.
[2024-05-29 16:35:42] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 1 ms to minimize.
[2024-05-29 16:35:43] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 0 ms to minimize.
[2024-05-29 16:35:43] [INFO ] Deduced a trap composed of 5 places in 427 ms of which 0 ms to minimize.
[2024-05-29 16:35:44] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
[2024-05-29 16:35:44] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 0 ms to minimize.
[2024-05-29 16:35:44] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 0 ms to minimize.
[2024-05-29 16:35:44] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 0 ms to minimize.
[2024-05-29 16:35:45] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 0 ms to minimize.
[2024-05-29 16:35:45] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 0 ms to minimize.
[2024-05-29 16:35:46] [INFO ] Deduced a trap composed of 4 places in 757 ms of which 1 ms to minimize.
[2024-05-29 16:35:46] [INFO ] Deduced a trap composed of 4 places in 656 ms of which 1 ms to minimize.
[2024-05-29 16:35:47] [INFO ] Deduced a trap composed of 4 places in 580 ms of which 1 ms to minimize.
[2024-05-29 16:35:48] [INFO ] Deduced a trap composed of 4 places in 647 ms of which 0 ms to minimize.
[2024-05-29 16:35:48] [INFO ] Deduced a trap composed of 4 places in 565 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:35:49] [INFO ] Deduced a trap composed of 4 places in 632 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-29 16:35:50] [INFO ] Deduced a trap composed of 4 places in 655 ms of which 0 ms to minimize.
[2024-05-29 16:35:51] [INFO ] Deduced a trap composed of 4 places in 805 ms of which 1 ms to minimize.
[2024-05-29 16:35:52] [INFO ] Deduced a trap composed of 4 places in 809 ms of which 0 ms to minimize.
SMT process timed out in 31077ms, After SMT, problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 31078ms
Finished structural reductions in LTL mode , in 1 iterations and 33434 ms. Remains : 37/37 places, 3132/3132 transitions.
Built C files in :
/tmp/ltsmin837276542060140264
[2024-05-29 16:35:52] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin837276542060140264
Running compilation step : cd /tmp/ltsmin837276542060140264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin837276542060140264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin837276542060140264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-29 16:35:55] [INFO ] Flatten gal took : 241 ms
[2024-05-29 16:35:55] [INFO ] Flatten gal took : 235 ms
[2024-05-29 16:35:55] [INFO ] Time to serialize gal into /tmp/LTL7037658901916260820.gal : 41 ms
[2024-05-29 16:35:55] [INFO ] Time to serialize properties into /tmp/LTL6908503996459612087.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7037658901916260820.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16080386267403585711.hoa' '-atoms' '/tmp/LTL6908503996459612087.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6908503996459612087.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16080386267403585711.hoa
Reverse transition relation is NOT exact ! Due to transitions t5, t13, t18, t23, t28, t35, t40, t45, t46, t50, t55, t60, t4334, t62.t61, t57.t56, t52.t51, ...330
Detected timeout of ITS tools.
[2024-05-29 16:36:11] [INFO ] Flatten gal took : 232 ms
[2024-05-29 16:36:11] [INFO ] Flatten gal took : 232 ms
[2024-05-29 16:36:11] [INFO ] Time to serialize gal into /tmp/LTL13860463767237984537.gal : 38 ms
[2024-05-29 16:36:11] [INFO ] Time to serialize properties into /tmp/LTL16094659475870997798.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13860463767237984537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16094659475870997798.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((X("((p87==0)||(p115==1))"))&&((G(F("((p87==0)||(p115==1))")))||("((p115==0)&&(p87==1))")))))
Formula 0 simplified : G(X!"((p87==0)||(p115==1))" | (!"((p115==0)&&(p87==1))" & FG!"((p87==0)||(p115==1))"))
Reverse transition relation is NOT exact ! Due to transitions t5, t13, t18, t23, t28, t35, t40, t45, t46, t50, t55, t60, t4334, t62.t61, t57.t56, t52.t51, ...330
Detected timeout of ITS tools.
[2024-05-29 16:36:26] [INFO ] Flatten gal took : 231 ms
[2024-05-29 16:36:26] [INFO ] Applying decomposition
[2024-05-29 16:36:27] [INFO ] Flatten gal took : 232 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph649129600032535754.txt' '-o' '/tmp/graph649129600032535754.bin' '-w' '/tmp/graph649129600032535754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph649129600032535754.bin' '-l' '-1' '-v' '-w' '/tmp/graph649129600032535754.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:36:27] [INFO ] Decomposing Gal with order
[2024-05-29 16:36:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:36:28] [INFO ] Removed a total of 33888 redundant transitions.
[2024-05-29 16:36:28] [INFO ] Flatten gal took : 410 ms
[2024-05-29 16:36:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 151 ms.
[2024-05-29 16:36:28] [INFO ] Time to serialize gal into /tmp/LTL16842970271297944694.gal : 15 ms
[2024-05-29 16:36:28] [INFO ] Time to serialize properties into /tmp/LTL6525275658720660005.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16842970271297944694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6525275658720660005.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X("((i2.u2.p87==0)||(i4.u6.p115==1))"))&&((G(F("((i2.u2.p87==0)||(i4.u6.p115==1))")))||("((i4.u6.p115==0)&&(i2.u2.p87==1))")))))
Formula 0 simplified : G(X!"((i2.u2.p87==0)||(i4.u6.p115==1))" | (!"((i4.u6.p115==0)&&(i2.u2.p87==1))" & FG!"((i2.u2.p87==0)||(i4.u6.p115==1))"))
Reverse transition relation is NOT exact ! Due to transitions u0.t60, u0.t62.t61, u1.t55, u1.t57.t56, u4.t40, u4.t42.t41, u7.t28, u7.t30.t29, u8.t23, u8.t2...396
5 unique states visited
0 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
59 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,0.789389,28076,1,0,5781,175,19424,1845,165,449,22803
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-15 finished in 177695 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-15 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-29 16:36:29] [INFO ] Flatten gal took : 263 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6872736129792081962
[2024-05-29 16:36:29] [INFO ] Too many transitions (4342) to apply POR reductions. Disabling POR matrices.
[2024-05-29 16:36:30] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6872736129792081962
Running compilation step : cd /tmp/ltsmin6872736129792081962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 16:36:30] [INFO ] Applying decomposition
[2024-05-29 16:36:30] [INFO ] Flatten gal took : 266 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13960064467712050561.txt' '-o' '/tmp/graph13960064467712050561.bin' '-w' '/tmp/graph13960064467712050561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13960064467712050561.bin' '-l' '-1' '-v' '-w' '/tmp/graph13960064467712050561.weights' '-q' '0' '-e' '0.001'
[2024-05-29 16:36:31] [INFO ] Decomposing Gal with order
[2024-05-29 16:36:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 16:36:32] [INFO ] Removed a total of 45155 redundant transitions.
[2024-05-29 16:36:32] [INFO ] Flatten gal took : 628 ms
[2024-05-29 16:36:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 355 ms.
[2024-05-29 16:36:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality5064287798157300817.gal : 30 ms
[2024-05-29 16:36:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality6509788865923019863.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5064287798157300817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6509788865923019863.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((i1.i0.i0.u3.p19==0)||(i1.i1.i4.u44.p270==1))")U(X(X("((i1.i0.i0.u3.p19==0)||(i1.i1.i4.u44.p270==1))"))))))
Formula 0 simplified : F(!"((i1.i0.i0.u3.p19==0)||(i1.i1.i4.u44.p270==1))" R XX!"((i1.i0.i0.u3.p19==0)||(i1.i1.i4.u44.p270==1))")
Compilation finished in 26712 ms.
Running link step : cd /tmp/ltsmin6872736129792081962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin6872736129792081962;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U X(X((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 17:04:51] [INFO ] Applying decomposition
[2024-05-29 17:04:51] [INFO ] Flatten gal took : 726 ms
[2024-05-29 17:04:52] [INFO ] Decomposing Gal with order
[2024-05-29 17:04:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:04:54] [INFO ] Removed a total of 45131 redundant transitions.
[2024-05-29 17:04:54] [INFO ] Flatten gal took : 1520 ms
[2024-05-29 17:04:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 237 ms.
[2024-05-29 17:04:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality12999521923642955760.gal : 69 ms
[2024-05-29 17:04:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality1401058331926873805.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12999521923642955760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1401058331926873805.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("((u1.p19==0)||(u8.p270==1))")U(X(X("((u1.p19==0)||(u8.p270==1))"))))))
Formula 0 simplified : F(!"((u1.p19==0)||(u8.p270==1))" R XX!"((u1.p19==0)||(u8.p270==1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t16, t21, t26, t31, t38, t43, t48, t53, u1.t58, u1.t60, u1.t61, u1.t69, u1.t168, u1.t...1040
71 unique states visited
0 strongly connected components in search stack
139 transitions explored
71 items max in DFS search stack
245 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.20813,49716,1,0,29998,10167,38813,31881,1817,64277,101099
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3204999 ms.

BK_STOP 1717002302219

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-10a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531800219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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