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

About the Execution of ITS-Tools for StigmergyCommit-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12606.771 3600000.00 4061117.00 9808.60 TF?TF???FF???F?? 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-171690531800195.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-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531800195
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K 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 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 17:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 38M 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-08b-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716993133404

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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 14:32:14] [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 14:32:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:32:16] [INFO ] Load time of PNML (sax parser for PT used): 1577 ms
[2024-05-29 14:32:16] [INFO ] Transformed 2746 places.
[2024-05-29 14:32:16] [INFO ] Transformed 42776 transitions.
[2024-05-29 14:32:16] [INFO ] Found NUPN structural information;
[2024-05-29 14:32:16] [INFO ] Parsed PT model containing 2746 places and 42776 transitions and 723933 arcs in 1904 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyCommit-PT-08b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 2746 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2746/2746 places, 42776/42776 transitions.
Discarding 215 places :
Symmetric choice reduction at 0 with 215 rule applications. Total rules 215 place count 2531 transition count 42561
Iterating global reduction 0 with 215 rules applied. Total rules applied 430 place count 2531 transition count 42561
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 564 place count 2397 transition count 42427
Iterating global reduction 0 with 134 rules applied. Total rules applied 698 place count 2397 transition count 42427
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 777 place count 2318 transition count 42348
Iterating global reduction 0 with 79 rules applied. Total rules applied 856 place count 2318 transition count 42348
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 925 place count 2249 transition count 42279
Iterating global reduction 0 with 69 rules applied. Total rules applied 994 place count 2249 transition count 42279
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 1054 place count 2189 transition count 42219
Iterating global reduction 0 with 60 rules applied. Total rules applied 1114 place count 2189 transition count 42219
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 1173 place count 2130 transition count 42160
Iterating global reduction 0 with 59 rules applied. Total rules applied 1232 place count 2130 transition count 42160
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 1291 place count 2071 transition count 42101
Iterating global reduction 0 with 59 rules applied. Total rules applied 1350 place count 2071 transition count 42101
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 1407 place count 2014 transition count 42044
Iterating global reduction 0 with 57 rules applied. Total rules applied 1464 place count 2014 transition count 42044
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 1513 place count 1965 transition count 41995
Iterating global reduction 0 with 49 rules applied. Total rules applied 1562 place count 1965 transition count 41995
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1601 place count 1926 transition count 41956
Iterating global reduction 0 with 39 rules applied. Total rules applied 1640 place count 1926 transition count 41956
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 1647 place count 1926 transition count 41949
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 1662 place count 1911 transition count 41934
Iterating global reduction 1 with 15 rules applied. Total rules applied 1677 place count 1911 transition count 41934
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 1692 place count 1896 transition count 41919
Iterating global reduction 1 with 15 rules applied. Total rules applied 1707 place count 1896 transition count 41919
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1714 place count 1889 transition count 41912
Iterating global reduction 1 with 7 rules applied. Total rules applied 1721 place count 1889 transition count 41912
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1728 place count 1882 transition count 41905
Iterating global reduction 1 with 7 rules applied. Total rules applied 1735 place count 1882 transition count 41905
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1742 place count 1875 transition count 41898
Iterating global reduction 1 with 7 rules applied. Total rules applied 1749 place count 1875 transition count 41898
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1756 place count 1868 transition count 41891
Iterating global reduction 1 with 7 rules applied. Total rules applied 1763 place count 1868 transition count 41891
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1770 place count 1861 transition count 41884
Iterating global reduction 1 with 7 rules applied. Total rules applied 1777 place count 1861 transition count 41884
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1784 place count 1854 transition count 41877
Iterating global reduction 1 with 7 rules applied. Total rules applied 1791 place count 1854 transition count 41877
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1798 place count 1847 transition count 41870
Iterating global reduction 1 with 7 rules applied. Total rules applied 1805 place count 1847 transition count 41870
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1812 place count 1840 transition count 41863
Iterating global reduction 1 with 7 rules applied. Total rules applied 1819 place count 1840 transition count 41863
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1826 place count 1833 transition count 41856
Iterating global reduction 1 with 7 rules applied. Total rules applied 1833 place count 1833 transition count 41856
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1840 place count 1826 transition count 41849
Iterating global reduction 1 with 7 rules applied. Total rules applied 1847 place count 1826 transition count 41849
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 1854 place count 1826 transition count 41842
Applied a total of 1854 rules in 11267 ms. Remains 1826 /2746 variables (removed 920) and now considering 41842/42776 (removed 934) transitions.
// Phase 1: matrix 41842 rows 1826 cols
[2024-05-29 14:32:29] [INFO ] Computed 10 invariants in 942 ms
[2024-05-29 14:32:43] [INFO ] Implicit Places using invariants in 14835 ms returned []
Implicit Place search using SMT only with invariants took 14868 ms to find 0 implicit places.
Running 41841 sub problems to find dead transitions.
[2024-05-29 14:32:43] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1825/43668 variables, and 0 constraints, problems are : Problem set: 0 solved, 41841 unsolved in 30489 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1826 constraints, PredecessorRefiner: 41841/2420 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41841 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1825/43668 variables, and 0 constraints, problems are : Problem set: 0 solved, 41841 unsolved in 30405 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1826 constraints, PredecessorRefiner: 39421/2420 constraints, Known Traps: 0/0 constraints]
After SMT, in 779319ms problems are : Problem set: 0 solved, 41841 unsolved
Search for dead transitions found 0 dead transitions in 779794ms
Starting structural reductions in LTL mode, iteration 1 : 1826/2746 places, 41842/42776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 806173 ms. Remains : 1826/2746 places, 41842/42776 transitions.
Support contains 22 out of 1826 places after structural reductions.
[2024-05-29 14:45:47] [INFO ] Flatten gal took : 3917 ms
[2024-05-29 14:45:51] [INFO ] Flatten gal took : 4068 ms
[2024-05-29 14:45:59] [INFO ] Input system was already deterministic with 41842 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (239 resets) in 2779 ms. (14 steps per ms) remains 11/15 properties
BEST_FIRST walk for 40003 steps (30 resets) in 233 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 208 ms. (191 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (29 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (28 resets) in 238 ms. (167 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (28 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (41 resets) in 226 ms. (176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (31 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (30 resets) in 172 ms. (231 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
[2024-05-29 14:46:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1409/1426 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1426 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 400/1826 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1826 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5334ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 1826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1826/1826 places, 41842/41842 transitions.
Graph (trivial) has 1793 edges and 1826 vertex of which 152 / 1826 are part of one of the 27 SCC in 14 ms
Free SCC test removed 125 places
Drop transitions (Empty/Sink Transition effects.) removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Graph (complete) has 3710 edges and 1701 vertex of which 1692 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.121 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1251 transitions
Trivial Post-agglo rules discarded 1251 transitions
Performed 1251 trivial Post agglomeration. Transition count delta: 1251
Iterating post reduction 0 with 1260 rules applied. Total rules applied 1262 place count 1692 transition count 40413
Reduce places removed 1251 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 1277 rules applied. Total rules applied 2539 place count 441 transition count 40387
Reduce places removed 9 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 14 rules applied. Total rules applied 2553 place count 432 transition count 40382
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2558 place count 427 transition count 40382
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 102 Pre rules applied. Total rules applied 2558 place count 427 transition count 40280
Deduced a syphon composed of 102 places in 22 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 2762 place count 325 transition count 40280
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2763 place count 324 transition count 40279
Iterating global reduction 4 with 1 rules applied. Total rules applied 2764 place count 324 transition count 40279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2764 place count 324 transition count 40278
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2766 place count 323 transition count 40278
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 15 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 2904 place count 254 transition count 40209
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 2922 place count 254 transition count 40191
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 2973 place count 203 transition count 2054
Iterating global reduction 5 with 51 rules applied. Total rules applied 3024 place count 203 transition count 2054
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 3047 place count 203 transition count 2031
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 3072 place count 178 transition count 2006
Iterating global reduction 6 with 25 rules applied. Total rules applied 3097 place count 178 transition count 2006
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 3113 place count 162 transition count 1990
Iterating global reduction 6 with 16 rules applied. Total rules applied 3129 place count 162 transition count 1990
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 3136 place count 162 transition count 1983
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 3156 place count 152 transition count 1973
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 3166 place count 147 transition count 1980
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3167 place count 147 transition count 1979
Free-agglomeration rule applied 55 times.
Iterating global reduction 8 with 55 rules applied. Total rules applied 3222 place count 147 transition count 1924
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 8 with 87 rules applied. Total rules applied 3309 place count 92 transition count 1892
Renaming transitions due to excessive name length > 1024 char.
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 3318 place count 83 transition count 1883
Iterating global reduction 9 with 9 rules applied. Total rules applied 3327 place count 83 transition count 1883
Drop transitions (Redundant composition of simpler transitions.) removed 579 transitions
Redundant transition composition rules discarded 579 transitions
Iterating global reduction 9 with 579 rules applied. Total rules applied 3906 place count 83 transition count 1304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3908 place count 82 transition count 1303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3912 place count 80 transition count 1321
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 3913 place count 80 transition count 1320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3914 place count 79 transition count 1320
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 3925 place count 79 transition count 1320
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 3931 place count 79 transition count 1314
Applied a total of 3931 rules in 13069 ms. Remains 79 /1826 variables (removed 1747) and now considering 1314/41842 (removed 40528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13069 ms. Remains : 79/1826 places, 1314/41842 transitions.
RANDOM walk for 40000 steps (1317 resets) in 1540 ms. (25 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (116 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (167 resets) in 85 ms. (465 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (164 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (113 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
// Phase 1: matrix 1314 rows 79 cols
[2024-05-29 14:46:20] [INFO ] Computed 10 invariants in 4 ms
[2024-05-29 14:46:21] [INFO ] State equation strengthened by 1244 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 45/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/79 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1314/1393 variables, 79/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1393 variables, 1244/1333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1393 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1393 variables, 0/1333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1393/1393 variables, and 1333 constraints, problems are : Problem set: 0 solved, 4 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 79/79 constraints, ReadFeed: 1244/1244 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 45/53 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 14:46:22] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 6 ms to minimize.
[2024-05-29 14:46:22] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 4 ms to minimize.
[2024-05-29 14:46:22] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-05-29 14:46:23] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 26/79 variables, 5/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1314/1393 variables, 79/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1393 variables, 1244/1337 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1393 variables, 3/1340 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-29 14:46:24] [INFO ] Deduced a trap composed of 12 places in 356 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1393 variables, 1/1341 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-29 14:46:24] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 1 ms to minimize.
[2024-05-29 14:46:24] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 1 ms to minimize.
[2024-05-29 14:46:25] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 7 ms to minimize.
[2024-05-29 14:46:25] [INFO ] Deduced a trap composed of 16 places in 298 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1393 variables, 4/1345 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1393 variables, 0/1345 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1393 variables, 0/1345 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1393/1393 variables, and 1345 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4097 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 79/79 constraints, ReadFeed: 1244/1244 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 5193ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 349 steps, including 34 resets, run visited all 3 properties in 15 ms. (steps per millisecond=23 )
Parikh walk visited 3 properties in 20 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 369 stabilizing places and 387 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' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 1826 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1826/1826 places, 41842/41842 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1817 transition count 41833
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1817 transition count 41833
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1808 transition count 41824
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1808 transition count 41824
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 1801 transition count 41817
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 1801 transition count 41817
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 1801 transition count 41816
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 1796 transition count 41811
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 1796 transition count 41811
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 1791 transition count 41806
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 1791 transition count 41806
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 1787 transition count 41802
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 1787 transition count 41802
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 1783 transition count 41798
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 1783 transition count 41798
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 1779 transition count 41794
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 1779 transition count 41794
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 1779 transition count 41793
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 1776 transition count 41790
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 1776 transition count 41790
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 1773 transition count 41787
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 1773 transition count 41787
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 1771 transition count 41785
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 1771 transition count 41785
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 1769 transition count 41783
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 1769 transition count 41783
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 1767 transition count 41781
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 1767 transition count 41781
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 1767 transition count 41780
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 1766 transition count 41779
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 1766 transition count 41779
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 1765 transition count 41778
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 1765 transition count 41778
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 1764 transition count 41777
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 1764 transition count 41777
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 1763 transition count 41776
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 1763 transition count 41776
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 1762 transition count 41775
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 1762 transition count 41775
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 1761 transition count 41774
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 1761 transition count 41774
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 1761 transition count 41773
Applied a total of 134 rules in 9497 ms. Remains 1761 /1826 variables (removed 65) and now considering 41773/41842 (removed 69) transitions.
// Phase 1: matrix 41773 rows 1761 cols
[2024-05-29 14:46:37] [INFO ] Computed 10 invariants in 734 ms
[2024-05-29 14:46:50] [INFO ] Implicit Places using invariants in 14062 ms returned []
Implicit Place search using SMT only with invariants took 14064 ms to find 0 implicit places.
Running 41772 sub problems to find dead transitions.
[2024-05-29 14:46:51] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1760/43534 variables, and 0 constraints, problems are : Problem set: 0 solved, 41772 unsolved in 30444 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 41772/2352 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41772 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/43534 variables, and 0 constraints, problems are : Problem set: 0 solved, 41772 unsolved in 30489 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1761 constraints, PredecessorRefiner: 39420/2352 constraints, Known Traps: 0/0 constraints]
After SMT, in 814107ms problems are : Problem set: 0 solved, 41772 unsolved
Search for dead transitions found 0 dead transitions in 814521ms
Starting structural reductions in LTL mode, iteration 1 : 1761/1826 places, 41773/41842 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 838208 ms. Remains : 1761/1826 places, 41773/41842 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-08b-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 2465 ms.
Product exploration explored 100000 steps with 50000 reset in 1990 ms.
Computed a total of 369 stabilizing places and 387 stable transitions
Computed a total of 369 stabilizing places and 387 stable transitions
Detected a total of 369/1761 stabilizing places and 387/41773 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-08b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-08b-LTLCardinality-00 finished in 843761 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((p0 U ((!p0 U G(!p0))||G(p0)))))'
Support contains 2 out of 1826 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1826/1826 places, 41842/41842 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1817 transition count 41833
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1817 transition count 41833
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 1810 transition count 41826
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 1810 transition count 41826
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 1805 transition count 41821
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 1805 transition count 41821
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1805 transition count 41820
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 1802 transition count 41817
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 1802 transition count 41817
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 1799 transition count 41814
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 1799 transition count 41814
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1796 transition count 41811
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1796 transition count 41811
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 1793 transition count 41808
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 1793 transition count 41808
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 1790 transition count 41805
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 1790 transition count 41805
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 1790 transition count 41804
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 1788 transition count 41802
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 1788 transition count 41802
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 1786 transition count 41800
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 1786 transition count 41800
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 1785 transition count 41799
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 1785 transition count 41799
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1784 transition count 41798
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1784 transition count 41798
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1783 transition count 41797
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1783 transition count 41797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 1783 transition count 41796
Applied a total of 89 rules in 6975 ms. Remains 1783 /1826 variables (removed 43) and now considering 41796/41842 (removed 46) transitions.
// Phase 1: matrix 41796 rows 1783 cols
[2024-05-29 15:00:38] [INFO ] Computed 10 invariants in 862 ms
[2024-05-29 15:00:51] [INFO ] Implicit Places using invariants in 14103 ms returned []
Implicit Place search using SMT only with invariants took 14105 ms to find 0 implicit places.
Running 41795 sub problems to find dead transitions.
[2024-05-29 15:00:52] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1782/43579 variables, and 0 constraints, problems are : Problem set: 0 solved, 41795 unsolved in 30525 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1783 constraints, PredecessorRefiner: 41795/2375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/43579 variables, and 0 constraints, problems are : Problem set: 0 solved, 41795 unsolved in 30441 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1783 constraints, PredecessorRefiner: 39420/2375 constraints, Known Traps: 0/0 constraints]
After SMT, in 782330ms problems are : Problem set: 0 solved, 41795 unsolved
Search for dead transitions found 0 dead transitions in 782782ms
Starting structural reductions in LTL mode, iteration 1 : 1783/1826 places, 41796/41842 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 803947 ms. Remains : 1783/1826 places, 41796/41842 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, p0, false, false]
Running random walk in product with property : StigmergyCommit-PT-08b-LTLCardinality-02
Product exploration explored 100000 steps with 604 reset in 1754 ms.
Product exploration explored 100000 steps with 603 reset in 1699 ms.
Computed a total of 369 stabilizing places and 387 stable transitions
Computed a total of 369 stabilizing places and 387 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[true, false, p0]
RANDOM walk for 40000 steps (241 resets) in 1022 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (30 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 24047 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 1
Probabilistic random walk after 24047 steps, saw 10866 distinct states, run finished after 3005 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-29 15:14:02] [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) 416/418 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1365/1783 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1783 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5179ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1783/1783 places, 41796/41796 transitions.
Graph (trivial) has 1776 edges and 1783 vertex of which 153 / 1783 are part of one of the 27 SCC in 11 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 3657 edges and 1657 vertex of which 1648 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.55 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1246 transitions
Trivial Post-agglo rules discarded 1246 transitions
Performed 1246 trivial Post agglomeration. Transition count delta: 1246
Iterating post reduction 0 with 1255 rules applied. Total rules applied 1257 place count 1648 transition count 40370
Reduce places removed 1246 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 1273 rules applied. Total rules applied 2530 place count 402 transition count 40343
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 2539 place count 393 transition count 40343
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 2539 place count 393 transition count 40240
Deduced a syphon composed of 103 places in 19 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 2745 place count 290 transition count 40240
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2746 place count 290 transition count 40239
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 11 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 2874 place count 226 transition count 40175
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 2892 place count 226 transition count 40157
Discarding 55 places :
Symmetric choice reduction at 5 with 55 rule applications. Total rules 2947 place count 171 transition count 1761
Iterating global reduction 5 with 55 rules applied. Total rules applied 3002 place count 171 transition count 1761
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 3029 place count 171 transition count 1734
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 3056 place count 144 transition count 1707
Iterating global reduction 6 with 27 rules applied. Total rules applied 3083 place count 144 transition count 1707
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 3101 place count 126 transition count 1689
Iterating global reduction 6 with 18 rules applied. Total rules applied 3119 place count 126 transition count 1689
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 3128 place count 126 transition count 1680
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 3146 place count 117 transition count 1671
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 3152 place count 114 transition count 1679
Free-agglomeration rule applied 48 times.
Iterating global reduction 7 with 48 rules applied. Total rules applied 3200 place count 114 transition count 1631
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 513 transitions.
Iterating post reduction 7 with 561 rules applied. Total rules applied 3761 place count 66 transition count 1118
Renaming transitions due to excessive name length > 1024 char.
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 3770 place count 57 transition count 1109
Iterating global reduction 8 with 9 rules applied. Total rules applied 3779 place count 57 transition count 1109
Drop transitions (Redundant composition of simpler transitions.) removed 519 transitions
Redundant transition composition rules discarded 519 transitions
Iterating global reduction 8 with 519 rules applied. Total rules applied 4298 place count 57 transition count 590
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4300 place count 56 transition count 589
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4304 place count 54 transition count 607
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4308 place count 54 transition count 603
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4312 place count 50 transition count 603
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 4321 place count 50 transition count 603
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 4327 place count 50 transition count 597
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 4331 place count 46 transition count 589
Iterating global reduction 9 with 4 rules applied. Total rules applied 4335 place count 46 transition count 589
Applied a total of 4335 rules in 9573 ms. Remains 46 /1783 variables (removed 1737) and now considering 589/41796 (removed 41207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9573 ms. Remains : 46/1783 places, 589/41796 transitions.
RANDOM walk for 2113 steps (0 resets) in 84 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[true, false, p0]
Stuttering acceptance computed with spot in 98 ms :[true, false, p0]
Support contains 2 out of 1783 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1783/1783 places, 41796/41796 transitions.
Graph (trivial) has 1776 edges and 1783 vertex of which 153 / 1783 are part of one of the 27 SCC in 2 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1228 transitions
Trivial Post-agglo rules discarded 1228 transitions
Performed 1228 trivial Post agglomeration. Transition count delta: 1228
Iterating post reduction 0 with 1228 rules applied. Total rules applied 1229 place count 1656 transition count 40423
Reduce places removed 1228 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 1255 rules applied. Total rules applied 2484 place count 428 transition count 40396
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 2493 place count 419 transition count 40396
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 2493 place count 419 transition count 40302
Deduced a syphon composed of 94 places in 17 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 2681 place count 325 transition count 40302
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2689 place count 317 transition count 40294
Iterating global reduction 3 with 8 rules applied. Total rules applied 2697 place count 317 transition count 40294
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 14 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 2839 place count 246 transition count 40223
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2893 place count 192 transition count 1836
Iterating global reduction 3 with 54 rules applied. Total rules applied 2947 place count 192 transition count 1836
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 2973 place count 192 transition count 1810
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 3000 place count 165 transition count 1774
Iterating global reduction 4 with 27 rules applied. Total rules applied 3027 place count 165 transition count 1774
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 3054 place count 138 transition count 1738
Iterating global reduction 4 with 27 rules applied. Total rules applied 3081 place count 138 transition count 1738
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 3090 place count 138 transition count 1729
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 3116 place count 125 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3117 place count 124 transition count 1718
Iterating global reduction 5 with 1 rules applied. Total rules applied 3118 place count 124 transition count 1718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3119 place count 124 transition count 1717
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 3128 place count 124 transition count 1708
Applied a total of 3128 rules in 9696 ms. Remains 124 /1783 variables (removed 1659) and now considering 1708/41796 (removed 40088) transitions.
[2024-05-29 15:14:27] [INFO ] Flow matrix only has 1698 transitions (discarded 10 similar events)
// Phase 1: matrix 1698 rows 124 cols
[2024-05-29 15:14:27] [INFO ] Computed 2 invariants in 26 ms
[2024-05-29 15:14:27] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-29 15:14:27] [INFO ] Flow matrix only has 1698 transitions (discarded 10 similar events)
[2024-05-29 15:14:27] [INFO ] Invariant cache hit.
[2024-05-29 15:14:28] [INFO ] State equation strengthened by 511 read => feed constraints.
[2024-05-29 15:14:30] [INFO ] Implicit Places using invariants and state equation in 2882 ms returned []
Implicit Place search using SMT with State Equation took 3470 ms to find 0 implicit places.
[2024-05-29 15:14:31] [INFO ] Redundant transitions in 124 ms returned []
Running 1691 sub problems to find dead transitions.
[2024-05-29 15:14:31] [INFO ] Flow matrix only has 1698 transitions (discarded 10 similar events)
[2024-05-29 15:14:31] [INFO ] Invariant cache hit.
[2024-05-29 15:14:31] [INFO ] State equation strengthened by 511 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
[2024-05-29 15:15:04] [INFO ] Deduced a trap composed of 23 places in 663 ms of which 1 ms to minimize.
[2024-05-29 15:15:05] [INFO ] Deduced a trap composed of 24 places in 646 ms of which 1 ms to minimize.
[2024-05-29 15:15:06] [INFO ] Deduced a trap composed of 19 places in 633 ms of which 1 ms to minimize.
[2024-05-29 15:15:07] [INFO ] Deduced a trap composed of 18 places in 695 ms of which 1 ms to minimize.
[2024-05-29 15:15:07] [INFO ] Deduced a trap composed of 24 places in 676 ms of which 1 ms to minimize.
[2024-05-29 15:15:08] [INFO ] Deduced a trap composed of 20 places in 631 ms of which 1 ms to minimize.
[2024-05-29 15:15:08] [INFO ] Deduced a trap composed of 21 places in 617 ms of which 2 ms to minimize.
[2024-05-29 15:15:09] [INFO ] Deduced a trap composed of 17 places in 678 ms of which 1 ms to minimize.
[2024-05-29 15:15:10] [INFO ] Deduced a trap composed of 17 places in 625 ms of which 1 ms to minimize.
[2024-05-29 15:15:17] [INFO ] Deduced a trap composed of 14 places in 422 ms of which 3 ms to minimize.
[2024-05-29 15:15:18] [INFO ] Deduced a trap composed of 14 places in 434 ms of which 1 ms to minimize.
[2024-05-29 15:15:18] [INFO ] Deduced a trap composed of 15 places in 431 ms of which 0 ms to minimize.
[2024-05-29 15:15:19] [INFO ] Deduced a trap composed of 15 places in 483 ms of which 0 ms to minimize.
[2024-05-29 15:15:19] [INFO ] Deduced a trap composed of 19 places in 577 ms of which 1 ms to minimize.
[2024-05-29 15:15:20] [INFO ] Deduced a trap composed of 15 places in 533 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/1822 variables, and 17 constraints, problems are : Problem set: 0 solved, 1691 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/124 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 1691/1180 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
[2024-05-29 15:15:42] [INFO ] Deduced a trap composed of 22 places in 484 ms of which 1 ms to minimize.
[2024-05-29 15:15:42] [INFO ] Deduced a trap composed of 23 places in 477 ms of which 0 ms to minimize.
[2024-05-29 15:15:43] [INFO ] Deduced a trap composed of 24 places in 497 ms of which 1 ms to minimize.
[2024-05-29 15:15:43] [INFO ] Deduced a trap composed of 23 places in 511 ms of which 0 ms to minimize.
[2024-05-29 15:15:44] [INFO ] Deduced a trap composed of 23 places in 504 ms of which 0 ms to minimize.
[2024-05-29 15:15:44] [INFO ] Deduced a trap composed of 25 places in 505 ms of which 1 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 25 places in 529 ms of which 1 ms to minimize.
[2024-05-29 15:15:45] [INFO ] Deduced a trap composed of 16 places in 538 ms of which 1 ms to minimize.
[2024-05-29 15:15:46] [INFO ] Deduced a trap composed of 20 places in 583 ms of which 1 ms to minimize.
[2024-05-29 15:15:46] [INFO ] Deduced a trap composed of 19 places in 498 ms of which 1 ms to minimize.
[2024-05-29 15:15:47] [INFO ] Deduced a trap composed of 15 places in 521 ms of which 4 ms to minimize.
[2024-05-29 15:15:47] [INFO ] Deduced a trap composed of 23 places in 502 ms of which 1 ms to minimize.
[2024-05-29 15:15:48] [INFO ] Deduced a trap composed of 23 places in 515 ms of which 1 ms to minimize.
[2024-05-29 15:15:48] [INFO ] Deduced a trap composed of 20 places in 473 ms of which 2 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 25 places in 519 ms of which 1 ms to minimize.
[2024-05-29 15:15:49] [INFO ] Deduced a trap composed of 23 places in 519 ms of which 2 ms to minimize.
[2024-05-29 15:15:50] [INFO ] Deduced a trap composed of 15 places in 548 ms of which 1 ms to minimize.
[2024-05-29 15:15:51] [INFO ] Deduced a trap composed of 23 places in 491 ms of which 1 ms to minimize.
[2024-05-29 15:15:51] [INFO ] Deduced a trap composed of 23 places in 510 ms of which 1 ms to minimize.
[2024-05-29 15:15:52] [INFO ] Deduced a trap composed of 23 places in 489 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/1822 variables, and 37 constraints, problems are : Problem set: 0 solved, 1691 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/124 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 511/1180 constraints, Known Traps: 35/35 constraints]
After SMT, in 83473ms problems are : Problem set: 0 solved, 1691 unsolved
Search for dead transitions found 0 dead transitions in 83490ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/1783 places, 1708/41796 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96792 ms. Remains : 124/1783 places, 1708/41796 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, false, p0]
RANDOM walk for 40000 steps (2516 resets) in 2482 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (184 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 560644 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 560644 steps, saw 161110 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-29 15:15:58] [INFO ] Flow matrix only has 1698 transitions (discarded 10 similar events)
[2024-05-29 15:15:58] [INFO ] Invariant cache hit.
[2024-05-29 15:15:58] [INFO ] State equation strengthened by 511 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) 120/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1696/1818 variables, 122/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1818 variables, 510/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1818 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1821 variables, 2/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1821 variables, 1/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1821 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1822 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1822 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1822 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1822/1822 variables, and 637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 511/511 constraints, PredecessorRefiner: 1/1 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) 120/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 15:16:00] [INFO ] Deduced a trap composed of 20 places in 670 ms of which 3 ms to minimize.
[2024-05-29 15:16:01] [INFO ] Deduced a trap composed of 21 places in 596 ms of which 1 ms to minimize.
[2024-05-29 15:16:01] [INFO ] Deduced a trap composed of 15 places in 655 ms of which 1 ms to minimize.
[2024-05-29 15:16:02] [INFO ] Deduced a trap composed of 15 places in 584 ms of which 1 ms to minimize.
[2024-05-29 15:16:03] [INFO ] Deduced a trap composed of 15 places in 510 ms of which 1 ms to minimize.
[2024-05-29 15:16:03] [INFO ] Deduced a trap composed of 19 places in 512 ms of which 0 ms to minimize.
[2024-05-29 15:16:04] [INFO ] Deduced a trap composed of 20 places in 532 ms of which 1 ms to minimize.
[2024-05-29 15:16:04] [INFO ] Deduced a trap composed of 20 places in 478 ms of which 1 ms to minimize.
[2024-05-29 15:16:05] [INFO ] Deduced a trap composed of 20 places in 468 ms of which 1 ms to minimize.
SMT process timed out in 6744ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1708/1708 transitions.
Graph (complete) has 974 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 123 transition count 1688
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 114 transition count 1679
Free-agglomeration rule applied 48 times.
Iterating global reduction 1 with 48 rules applied. Total rules applied 86 place count 114 transition count 1631
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 513 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 1 with 573 rules applied. Total rules applied 659 place count 65 transition count 1107
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 670 place count 54 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 679 place count 45 transition count 1098
Iterating global reduction 3 with 9 rules applied. Total rules applied 688 place count 45 transition count 1098
Performed 18 Post agglomeration using F-continuation condition with reduction of 513 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 724 place count 27 transition count 567
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 760 place count 27 transition count 531
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 765 place count 22 transition count 526
Iterating global reduction 4 with 5 rules applied. Total rules applied 770 place count 22 transition count 526
Performed 7 Post agglomeration using F-continuation condition with reduction of 480 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 790 place count 9 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 818 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 820 place count 8 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 822 place count 8 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 824 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 825 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 826 place count 6 transition count 6
Applied a total of 826 rules in 297 ms. Remains 6 /124 variables (removed 118) and now considering 6/1708 (removed 1702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 6/124 places, 6/1708 transitions.
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[true, false, p0]
Stuttering acceptance computed with spot in 64 ms :[true, false, p0]
Stuttering acceptance computed with spot in 72 ms :[true, false, p0]
Product exploration explored 100000 steps with 6280 reset in 511 ms.
Product exploration explored 100000 steps with 6223 reset in 532 ms.
Built C files in :
/tmp/ltsmin13440013682042491964
[2024-05-29 15:16:06] [INFO ] Too many transitions (1708) to apply POR reductions. Disabling POR matrices.
[2024-05-29 15:16:06] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13440013682042491964
Running compilation step : cd /tmp/ltsmin13440013682042491964;'/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/ltsmin13440013682042491964;'/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/ltsmin13440013682042491964;'/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 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 1708/1708 transitions.
Applied a total of 0 rules in 143 ms. Remains 124 /124 variables (removed 0) and now considering 1708/1708 (removed 0) transitions.
[2024-05-29 15:16:10] [INFO ] Flow matrix only has 1698 transitions (discarded 10 similar events)
[2024-05-29 15:16:10] [INFO ] Invariant cache hit.
[2024-05-29 15:16:10] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-29 15:16:10] [INFO ] Flow matrix only has 1698 transitions (discarded 10 similar events)
[2024-05-29 15:16:10] [INFO ] Invariant cache hit.
[2024-05-29 15:16:11] [INFO ] State equation strengthened by 511 read => feed constraints.
[2024-05-29 15:16:13] [INFO ] Implicit Places using invariants and state equation in 2791 ms returned []
Implicit Place search using SMT with State Equation took 3351 ms to find 0 implicit places.
[2024-05-29 15:16:13] [INFO ] Redundant transitions in 46 ms returned []
Running 1691 sub problems to find dead transitions.
[2024-05-29 15:16:13] [INFO ] Flow matrix only has 1698 transitions (discarded 10 similar events)
[2024-05-29 15:16:13] [INFO ] Invariant cache hit.
[2024-05-29 15:16:13] [INFO ] State equation strengthened by 511 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
[2024-05-29 15:16:48] [INFO ] Deduced a trap composed of 23 places in 779 ms of which 1 ms to minimize.
[2024-05-29 15:16:49] [INFO ] Deduced a trap composed of 24 places in 734 ms of which 1 ms to minimize.
[2024-05-29 15:16:49] [INFO ] Deduced a trap composed of 19 places in 695 ms of which 1 ms to minimize.
[2024-05-29 15:16:50] [INFO ] Deduced a trap composed of 18 places in 723 ms of which 4 ms to minimize.
[2024-05-29 15:16:51] [INFO ] Deduced a trap composed of 24 places in 661 ms of which 1 ms to minimize.
[2024-05-29 15:16:51] [INFO ] Deduced a trap composed of 20 places in 584 ms of which 1 ms to minimize.
[2024-05-29 15:16:52] [INFO ] Deduced a trap composed of 21 places in 594 ms of which 2 ms to minimize.
[2024-05-29 15:16:53] [INFO ] Deduced a trap composed of 17 places in 707 ms of which 1 ms to minimize.
[2024-05-29 15:16:53] [INFO ] Deduced a trap composed of 17 places in 616 ms of which 1 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 14 places in 455 ms of which 0 ms to minimize.
[2024-05-29 15:17:01] [INFO ] Deduced a trap composed of 14 places in 400 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 15 places in 424 ms of which 1 ms to minimize.
[2024-05-29 15:17:02] [INFO ] Deduced a trap composed of 15 places in 542 ms of which 0 ms to minimize.
[2024-05-29 15:17:03] [INFO ] Deduced a trap composed of 19 places in 621 ms of which 1 ms to minimize.
[2024-05-29 15:17:04] [INFO ] Deduced a trap composed of 15 places in 551 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/1822 variables, and 17 constraints, problems are : Problem set: 0 solved, 1691 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/124 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 1691/1180 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
[2024-05-29 15:17:25] [INFO ] Deduced a trap composed of 22 places in 528 ms of which 1 ms to minimize.
[2024-05-29 15:17:25] [INFO ] Deduced a trap composed of 23 places in 557 ms of which 1 ms to minimize.
[2024-05-29 15:17:26] [INFO ] Deduced a trap composed of 24 places in 483 ms of which 1 ms to minimize.
[2024-05-29 15:17:26] [INFO ] Deduced a trap composed of 23 places in 457 ms of which 1 ms to minimize.
[2024-05-29 15:17:27] [INFO ] Deduced a trap composed of 23 places in 552 ms of which 0 ms to minimize.
[2024-05-29 15:17:28] [INFO ] Deduced a trap composed of 25 places in 606 ms of which 1 ms to minimize.
[2024-05-29 15:17:28] [INFO ] Deduced a trap composed of 25 places in 597 ms of which 1 ms to minimize.
[2024-05-29 15:17:29] [INFO ] Deduced a trap composed of 16 places in 578 ms of which 1 ms to minimize.
[2024-05-29 15:17:30] [INFO ] Deduced a trap composed of 20 places in 633 ms of which 1 ms to minimize.
[2024-05-29 15:17:30] [INFO ] Deduced a trap composed of 19 places in 530 ms of which 1 ms to minimize.
[2024-05-29 15:17:31] [INFO ] Deduced a trap composed of 15 places in 508 ms of which 1 ms to minimize.
[2024-05-29 15:17:31] [INFO ] Deduced a trap composed of 23 places in 528 ms of which 1 ms to minimize.
[2024-05-29 15:17:32] [INFO ] Deduced a trap composed of 23 places in 503 ms of which 1 ms to minimize.
[2024-05-29 15:17:32] [INFO ] Deduced a trap composed of 20 places in 505 ms of which 1 ms to minimize.
[2024-05-29 15:17:33] [INFO ] Deduced a trap composed of 25 places in 478 ms of which 1 ms to minimize.
[2024-05-29 15:17:33] [INFO ] Deduced a trap composed of 23 places in 519 ms of which 1 ms to minimize.
[2024-05-29 15:17:34] [INFO ] Deduced a trap composed of 15 places in 574 ms of which 1 ms to minimize.
[2024-05-29 15:17:34] [INFO ] Deduced a trap composed of 23 places in 526 ms of which 1 ms to minimize.
[2024-05-29 15:17:35] [INFO ] Deduced a trap composed of 23 places in 505 ms of which 1 ms to minimize.
[2024-05-29 15:17:35] [INFO ] Deduced a trap composed of 23 places in 543 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 124/1822 variables, and 37 constraints, problems are : Problem set: 0 solved, 1691 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/124 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 511/1180 constraints, Known Traps: 35/35 constraints]
After SMT, in 84756ms problems are : Problem set: 0 solved, 1691 unsolved
Search for dead transitions found 0 dead transitions in 84771ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 88320 ms. Remains : 124/124 places, 1708/1708 transitions.
Built C files in :
/tmp/ltsmin4640275433758198582
[2024-05-29 15:17:38] [INFO ] Too many transitions (1708) to apply POR reductions. Disabling POR matrices.
[2024-05-29 15:17:38] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4640275433758198582
Running compilation step : cd /tmp/ltsmin4640275433758198582;'/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/ltsmin4640275433758198582;'/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/ltsmin4640275433758198582;'/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 15:17:45] [INFO ] Flatten gal took : 403 ms
[2024-05-29 15:17:45] [INFO ] Flatten gal took : 195 ms
[2024-05-29 15:17:45] [INFO ] Time to serialize gal into /tmp/LTL6936802643881746738.gal : 59 ms
[2024-05-29 15:17:45] [INFO ] Time to serialize properties into /tmp/LTL17093559075616884756.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/LTL6936802643881746738.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11326401897360634316.hoa' '-atoms' '/tmp/LTL17093559075616884756.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/LTL17093559075616884756.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11326401897360634316.hoa
Detected timeout of ITS tools.
[2024-05-29 15:18:04] [INFO ] Flatten gal took : 165 ms
[2024-05-29 15:18:04] [INFO ] Flatten gal took : 173 ms
[2024-05-29 15:18:04] [INFO ] Time to serialize gal into /tmp/LTL5615606312785501988.gal : 33 ms
[2024-05-29 15:18:04] [INFO ] Time to serialize properties into /tmp/LTL3015469040731211095.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/LTL5615606312785501988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3015469040731211095.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 : !((X(("((p185==0)||(p830==1))")U(((!("((p185==0)||(p830==1))"))U(G(!("((p185==0)||(p830==1))"))))||(G("((p185==0)||(p830==1))"))))))
Formula 0 simplified : X(!"((p185==0)||(p830==1))" M F"((p185==0)||(p830==1))")
Detected timeout of ITS tools.
[2024-05-29 15:18:19] [INFO ] Flatten gal took : 179 ms
[2024-05-29 15:18:19] [INFO ] Applying decomposition
[2024-05-29 15:18:19] [INFO ] Flatten gal took : 182 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/graph16792071525333011441.txt' '-o' '/tmp/graph16792071525333011441.bin' '-w' '/tmp/graph16792071525333011441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16792071525333011441.bin' '-l' '-1' '-v' '-w' '/tmp/graph16792071525333011441.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:18:20] [INFO ] Decomposing Gal with order
[2024-05-29 15:18:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:18:20] [INFO ] Removed a total of 13926 redundant transitions.
[2024-05-29 15:18:21] [INFO ] Flatten gal took : 495 ms
[2024-05-29 15:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 188 ms.
[2024-05-29 15:18:21] [INFO ] Time to serialize gal into /tmp/LTL3174141224465224072.gal : 20 ms
[2024-05-29 15:18:21] [INFO ] Time to serialize properties into /tmp/LTL18429466897944388632.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/LTL3174141224465224072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18429466897944388632.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 : !((X(("((i1.u2.p185==0)||(i0.u9.p830==1))")U(((!("((i1.u2.p185==0)||(i0.u9.p830==1))"))U(G(!("((i1.u2.p185==0)||(i0.u9.p830==1))"))))|...201
Formula 0 simplified : X(!"((i1.u2.p185==0)||(i0.u9.p830==1))" M F"((i1.u2.p185==0)||(i0.u9.p830==1))")
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-08b-LTLCardinality-02 finished in 1085799 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(G(p0)))'
Support contains 1 out of 1826 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1826/1826 places, 41842/41842 transitions.
Graph (trivial) has 1820 edges and 1826 vertex of which 155 / 1826 are part of one of the 27 SCC in 2 ms
Free SCC test removed 128 places
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1258 transitions
Trivial Post-agglo rules discarded 1258 transitions
Performed 1258 trivial Post agglomeration. Transition count delta: 1258
Iterating post reduction 0 with 1258 rules applied. Total rules applied 1259 place count 1697 transition count 40437
Reduce places removed 1258 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 1284 rules applied. Total rules applied 2543 place count 439 transition count 40411
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 2553 place count 430 transition count 40410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2554 place count 429 transition count 40410
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 95 Pre rules applied. Total rules applied 2554 place count 429 transition count 40315
Deduced a syphon composed of 95 places in 21 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 2744 place count 334 transition count 40315
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 2758 place count 320 transition count 40301
Iterating global reduction 4 with 14 rules applied. Total rules applied 2772 place count 320 transition count 40301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2772 place count 320 transition count 40300
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2774 place count 319 transition count 40300
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2778 place count 315 transition count 33736
Iterating global reduction 4 with 4 rules applied. Total rules applied 2782 place count 315 transition count 33736
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2785 place count 315 transition count 33733
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2786 place count 314 transition count 33732
Iterating global reduction 5 with 1 rules applied. Total rules applied 2787 place count 314 transition count 33732
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2788 place count 314 transition count 33731
Performed 72 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 72 places in 13 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 144 rules applied. Total rules applied 2932 place count 242 transition count 33656
Discarding 53 places :
Symmetric choice reduction at 6 with 53 rule applications. Total rules 2985 place count 189 transition count 1830
Iterating global reduction 6 with 53 rules applied. Total rules applied 3038 place count 189 transition count 1830
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 3061 place count 189 transition count 1807
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 3089 place count 161 transition count 1770
Iterating global reduction 7 with 28 rules applied. Total rules applied 3117 place count 161 transition count 1770
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 3145 place count 133 transition count 1733
Iterating global reduction 7 with 28 rules applied. Total rules applied 3173 place count 133 transition count 1733
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 3183 place count 133 transition count 1723
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 3209 place count 120 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3210 place count 119 transition count 1712
Iterating global reduction 8 with 1 rules applied. Total rules applied 3211 place count 119 transition count 1712
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3212 place count 119 transition count 1711
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 3221 place count 119 transition count 1702
Applied a total of 3221 rules in 9526 ms. Remains 119 /1826 variables (removed 1707) and now considering 1702/41842 (removed 40140) transitions.
[2024-05-29 15:18:45] [INFO ] Flow matrix only has 1692 transitions (discarded 10 similar events)
// Phase 1: matrix 1692 rows 119 cols
[2024-05-29 15:18:45] [INFO ] Computed 2 invariants in 26 ms
[2024-05-29 15:18:46] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-29 15:18:46] [INFO ] Flow matrix only has 1692 transitions (discarded 10 similar events)
[2024-05-29 15:18:46] [INFO ] Invariant cache hit.
[2024-05-29 15:18:46] [INFO ] State equation strengthened by 511 read => feed constraints.
[2024-05-29 15:18:49] [INFO ] Implicit Places using invariants and state equation in 3091 ms returned []
Implicit Place search using SMT with State Equation took 3672 ms to find 0 implicit places.
[2024-05-29 15:18:49] [INFO ] Redundant transitions in 32 ms returned []
Running 1685 sub problems to find dead transitions.
[2024-05-29 15:18:49] [INFO ] Flow matrix only has 1692 transitions (discarded 10 similar events)
[2024-05-29 15:18:49] [INFO ] Invariant cache hit.
[2024-05-29 15:18:49] [INFO ] State equation strengthened by 511 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
[2024-05-29 15:19:24] [INFO ] Deduced a trap composed of 29 places in 758 ms of which 5 ms to minimize.
[2024-05-29 15:19:25] [INFO ] Deduced a trap composed of 15 places in 661 ms of which 1 ms to minimize.
[2024-05-29 15:19:26] [INFO ] Deduced a trap composed of 17 places in 575 ms of which 0 ms to minimize.
[2024-05-29 15:19:26] [INFO ] Deduced a trap composed of 26 places in 611 ms of which 1 ms to minimize.
[2024-05-29 15:19:27] [INFO ] Deduced a trap composed of 20 places in 644 ms of which 1 ms to minimize.
[2024-05-29 15:19:28] [INFO ] Deduced a trap composed of 15 places in 599 ms of which 1 ms to minimize.
[2024-05-29 15:19:28] [INFO ] Deduced a trap composed of 14 places in 610 ms of which 1 ms to minimize.
[2024-05-29 15:19:29] [INFO ] Deduced a trap composed of 20 places in 632 ms of which 1 ms to minimize.
[2024-05-29 15:19:29] [INFO ] Deduced a trap composed of 20 places in 585 ms of which 1 ms to minimize.
[2024-05-29 15:19:30] [INFO ] Deduced a trap composed of 15 places in 656 ms of which 0 ms to minimize.
[2024-05-29 15:19:34] [INFO ] Deduced a trap composed of 15 places in 402 ms of which 1 ms to minimize.
[2024-05-29 15:19:35] [INFO ] Deduced a trap composed of 18 places in 418 ms of which 0 ms to minimize.
[2024-05-29 15:19:35] [INFO ] Deduced a trap composed of 14 places in 388 ms of which 0 ms to minimize.
[2024-05-29 15:19:36] [INFO ] Deduced a trap composed of 14 places in 422 ms of which 1 ms to minimize.
[2024-05-29 15:19:36] [INFO ] Deduced a trap composed of 21 places in 456 ms of which 0 ms to minimize.
[2024-05-29 15:19:36] [INFO ] Deduced a trap composed of 14 places in 396 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 119/1811 variables, and 18 constraints, problems are : Problem set: 0 solved, 1685 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/119 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 1685/1174 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
[2024-05-29 15:20:02] [INFO ] Deduced a trap composed of 20 places in 529 ms of which 1 ms to minimize.
[2024-05-29 15:20:03] [INFO ] Deduced a trap composed of 20 places in 556 ms of which 1 ms to minimize.
[2024-05-29 15:20:03] [INFO ] Deduced a trap composed of 20 places in 499 ms of which 1 ms to minimize.
[2024-05-29 15:20:04] [INFO ] Deduced a trap composed of 20 places in 629 ms of which 1 ms to minimize.
[2024-05-29 15:20:05] [INFO ] Deduced a trap composed of 24 places in 569 ms of which 1 ms to minimize.
[2024-05-29 15:20:05] [INFO ] Deduced a trap composed of 20 places in 599 ms of which 1 ms to minimize.
[2024-05-29 15:20:06] [INFO ] Deduced a trap composed of 23 places in 620 ms of which 1 ms to minimize.
[2024-05-29 15:20:06] [INFO ] Deduced a trap composed of 23 places in 583 ms of which 1 ms to minimize.
[2024-05-29 15:20:07] [INFO ] Deduced a trap composed of 23 places in 648 ms of which 0 ms to minimize.
[2024-05-29 15:20:08] [INFO ] Deduced a trap composed of 23 places in 593 ms of which 1 ms to minimize.
[2024-05-29 15:20:08] [INFO ] Deduced a trap composed of 21 places in 633 ms of which 3 ms to minimize.
[2024-05-29 15:20:09] [INFO ] Deduced a trap composed of 21 places in 569 ms of which 1 ms to minimize.
[2024-05-29 15:20:10] [INFO ] Deduced a trap composed of 21 places in 547 ms of which 0 ms to minimize.
[2024-05-29 15:20:10] [INFO ] Deduced a trap composed of 24 places in 539 ms of which 0 ms to minimize.
[2024-05-29 15:20:11] [INFO ] Deduced a trap composed of 21 places in 514 ms of which 1 ms to minimize.
[2024-05-29 15:20:11] [INFO ] Deduced a trap composed of 31 places in 539 ms of which 1 ms to minimize.
[2024-05-29 15:20:12] [INFO ] Deduced a trap composed of 26 places in 614 ms of which 1 ms to minimize.
[2024-05-29 15:20:12] [INFO ] Deduced a trap composed of 22 places in 589 ms of which 1 ms to minimize.
[2024-05-29 15:20:13] [INFO ] Deduced a trap composed of 27 places in 635 ms of which 1 ms to minimize.
[2024-05-29 15:20:14] [INFO ] Deduced a trap composed of 23 places in 586 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 119/1811 variables, and 38 constraints, problems are : Problem set: 0 solved, 1685 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/119 constraints, ReadFeed: 0/511 constraints, PredecessorRefiner: 511/1174 constraints, Known Traps: 36/36 constraints]
After SMT, in 85826ms problems are : Problem set: 0 solved, 1685 unsolved
Search for dead transitions found 0 dead transitions in 85842ms
Starting structural reductions in SI_LTL mode, iteration 1 : 119/1826 places, 1702/41842 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99086 ms. Remains : 119/1826 places, 1702/41842 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-08b-LTLCardinality-05
Product exploration explored 100000 steps with 6206 reset in 534 ms.
Product exploration explored 100000 steps with 6197 reset in 564 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 516 steps (28 resets) in 8 ms. (57 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1702/1702 transitions.
Applied a total of 0 rules in 153 ms. Remains 119 /119 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2024-05-29 15:20:17] [INFO ] Flow matrix only has 1692 transitions (discarded 10 similar events)
[2024-05-29 15:20:17] [INFO ] Invariant cache hit.
[2024-05-29 15:20:17] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-05-29 15:20:17] [INFO ] Flow matrix only has 1692 transitions (discarded 10 similar events)
[2024-05-29 15:20:17] [INFO ] Invariant cache hit.
[2024-05-29 15:20:18] [INFO ] State equation strengthened by 511 read => feed constraints.
[2024-05-29 15:20:20] [INFO ] Implicit Places using invariants and state equation in 3023 ms returned []
Implicit Place search using SMT with State Equation took 3601 ms to find 0 implicit places.
[2024-05-29 15:20:20] [INFO ] Redundant transitions in 37 ms returned []
Running 1685 sub problems to find dead transitions.
[2024-05-29 15:20:20] [INFO ] Flow matrix only has 1692 transitions (discarded 10 similar events)
[2024-05-29 15:20:20] [INFO ] Invariant cache hit.
[2024-05-29 15:20:21] [INFO ] State equation strengthened by 511 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
[2024-05-29 15:20:53] [INFO ] Deduced a trap composed of 29 places in 700 ms of which 1 ms to minimize.
[2024-05-29 15:20:53] [INFO ] Deduced a trap composed of 15 places in 709 ms of which 1 ms to minimize.
[2024-05-29 15:20:54] [INFO ] Deduced a trap composed of 17 places in 667 ms of which 1 ms to minimize.
[2024-05-29 15:20:55] [INFO ] Deduced a trap composed of 26 places in 649 ms of which 1 ms to minimize.
[2024-05-29 15:20:55] [INFO ] Deduced a trap composed of 20 places in 590 ms of which 1 ms to minimize.
[2024-05-29 15:20:56] [INFO ] Deduced a trap composed of 15 places in 636 ms of which 3 ms to minimize.
[2024-05-29 15:20:56] [INFO ] Deduced a trap composed of 14 places in 582 ms of which 1 ms to minimize.
[2024-05-29 15:20:57] [INFO ] Deduced a trap composed of 20 places in 581 ms of which 1 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 20 places in 621 ms of which 1 ms to minimize.
[2024-05-29 15:20:58] [INFO ] Deduced a trap composed of 15 places in 614 ms of which 1 ms to minimize.
[2024-05-29 15:21:03] [INFO ] Deduced a trap composed of 15 places in 465 ms of which 0 ms to minimize.
[2024-05-29 15:21:03] [INFO ] Deduced a trap composed of 18 places in 480 ms of which 1 ms to minimize.
[2024-05-29 15:21:03] [INFO ] Deduced a trap composed of 14 places in 402 ms of which 1 ms to minimize.
[2024-05-29 15:21:04] [INFO ] Deduced a trap composed of 14 places in 540 ms of which 0 ms to minimize.
[2024-05-29 15:21:05] [INFO ] Deduced a trap composed of 21 places in 490 ms of which 0 ms to minimize.
[2024-05-29 15:21:05] [INFO ] Deduced a trap composed of 14 places in 456 ms of which 1 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 20 places in 540 ms of which 0 ms to minimize.
[2024-05-29 15:21:13] [INFO ] Deduced a trap composed of 20 places in 544 ms of which 2 ms to minimize.
SMT process timed out in 53068ms, After SMT, problems are : Problem set: 0 solved, 1685 unsolved
Search for dead transitions found 0 dead transitions in 53084ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56890 ms. Remains : 119/119 places, 1702/1702 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 479 steps (27 resets) in 9 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6216 reset in 462 ms.
Product exploration explored 100000 steps with 6179 reset in 482 ms.
Built C files in :
/tmp/ltsmin11598251034878549176
[2024-05-29 15:21:15] [INFO ] Too many transitions (1702) to apply POR reductions. Disabling POR matrices.
[2024-05-29 15:21:15] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11598251034878549176
Running compilation step : cd /tmp/ltsmin11598251034878549176;'/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/ltsmin11598251034878549176;'/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/ltsmin11598251034878549176;'/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 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 1702/1702 transitions.
Applied a total of 0 rules in 132 ms. Remains 119 /119 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2024-05-29 15:21:18] [INFO ] Flow matrix only has 1692 transitions (discarded 10 similar events)
[2024-05-29 15:21:18] [INFO ] Invariant cache hit.
[2024-05-29 15:21:19] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-29 15:21:19] [INFO ] Flow matrix only has 1692 transitions (discarded 10 similar events)
[2024-05-29 15:21:19] [INFO ] Invariant cache hit.
[2024-05-29 15:21:19] [INFO ] State equation strengthened by 511 read => feed constraints.
[2024-05-29 15:21:22] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 3595 ms to find 0 implicit places.
[2024-05-29 15:21:22] [INFO ] Redundant transitions in 38 ms returned []
Running 1685 sub problems to find dead transitions.
[2024-05-29 15:21:22] [INFO ] Flow matrix only has 1692 transitions (discarded 10 similar events)
[2024-05-29 15:21:22] [INFO ] Invariant cache hit.
[2024-05-29 15:21:22] [INFO ] State equation strengthened by 511 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1685 unsolved
[2024-05-29 15:21:55] [INFO ] Deduced a trap composed of 29 places in 684 ms of which 1 ms to minimize.
[2024-05-29 15:21:56] [INFO ] Deduced a trap composed of 15 places in 602 ms of which 1 ms to minimize.
[2024-05-29 15:21:56] [INFO ] Deduced a trap composed of 17 places in 595 ms of which 1 ms to minimize.
[2024-05-29 15:21:57] [INFO ] Deduced a trap composed of 26 places in 594 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 20 places in 610 ms of which 1 ms to minimize.
[2024-05-29 15:21:58] [INFO ] Deduced a trap composed of 15 places in 633 ms of which 1 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 14 places in 617 ms of which 1 ms to minimize.
[2024-05-29 15:21:59] [INFO ] Deduced a trap composed of 20 places in 609 ms of which 1 ms to minimize.
[2024-05-29 15:22:00] [INFO ] Deduced a trap composed of 20 places in 605 ms of which 1 ms to minimize.
[2024-05-29 15:22:01] [INFO ] Deduced a trap composed of 15 places in 626 ms of which 1 ms to minimize.
[2024-05-29 15:22:05] [INFO ] Deduced a trap composed of 15 places in 441 ms of which 0 ms to minimize.
[2024-05-29 15:22:05] [INFO ] Deduced a trap composed of 18 places in 472 ms of which 0 ms to minimize.
[2024-05-29 15:22:06] [INFO ] Deduced a trap composed of 14 places in 429 ms of which 0 ms to minimize.
[2024-05-29 15:22:06] [INFO ] Deduced a trap composed of 14 places in 468 ms of which 1 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 21 places in 435 ms of which 1 ms to minimize.
[2024-05-29 15:22:07] [INFO ] Deduced a trap composed of 14 places in 376 ms of which 1 ms to minimize.
[2024-05-29 15:22:15] [INFO ] Deduced a trap composed of 20 places in 462 ms of which 0 ms to minimize.
[2024-05-29 15:22:15] [INFO ] Deduced a trap composed of 20 places in 498 ms of which 1 ms to minimize.
SMT process timed out in 53901ms, After SMT, problems are : Problem set: 0 solved, 1685 unsolved
Search for dead transitions found 0 dead transitions in 53916ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57689 ms. Remains : 119/119 places, 1702/1702 transitions.
Built C files in :
/tmp/ltsmin4304690276737956753
[2024-05-29 15:22:16] [INFO ] Too many transitions (1702) to apply POR reductions. Disabling POR matrices.
[2024-05-29 15:22:16] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4304690276737956753
Running compilation step : cd /tmp/ltsmin4304690276737956753;'/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/ltsmin4304690276737956753;'/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/ltsmin4304690276737956753;'/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 15:22:22] [INFO ] Flatten gal took : 344 ms
[2024-05-29 15:22:22] [INFO ] Flatten gal took : 170 ms
[2024-05-29 15:22:22] [INFO ] Time to serialize gal into /tmp/LTL12582361556052027153.gal : 22 ms
[2024-05-29 15:22:22] [INFO ] Time to serialize properties into /tmp/LTL5719330455609543794.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/LTL12582361556052027153.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11683486368531379390.hoa' '-atoms' '/tmp/LTL5719330455609543794.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/LTL5719330455609543794.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11683486368531379390.hoa
Detected timeout of ITS tools.
[2024-05-29 15:22:40] [INFO ] Flatten gal took : 331 ms
[2024-05-29 15:22:41] [INFO ] Flatten gal took : 161 ms
[2024-05-29 15:22:41] [INFO ] Time to serialize gal into /tmp/LTL13615259356332925333.gal : 21 ms
[2024-05-29 15:22:41] [INFO ] Time to serialize properties into /tmp/LTL16542970792997507369.ltl : 9 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/LTL13615259356332925333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16542970792997507369.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(G("(p1577==0)"))))
Formula 0 simplified : GF!"(p1577==0)"
Detected timeout of ITS tools.
[2024-05-29 15:22:56] [INFO ] Flatten gal took : 174 ms
[2024-05-29 15:22:56] [INFO ] Applying decomposition
[2024-05-29 15:22:56] [INFO ] Flatten gal took : 180 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/graph2797151603409208472.txt' '-o' '/tmp/graph2797151603409208472.bin' '-w' '/tmp/graph2797151603409208472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2797151603409208472.bin' '-l' '-1' '-v' '-w' '/tmp/graph2797151603409208472.weights' '-q' '0' '-e' '0.001'
[2024-05-29 15:22:57] [INFO ] Decomposing Gal with order
[2024-05-29 15:22:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 15:22:57] [INFO ] Removed a total of 13922 redundant transitions.
[2024-05-29 15:22:57] [INFO ] Flatten gal took : 262 ms
[2024-05-29 15:22:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 112 ms.
[2024-05-29 15:22:57] [INFO ] Time to serialize gal into /tmp/LTL10280668540295779279.gal : 26 ms
[2024-05-29 15:22:57] [INFO ] Time to serialize properties into /tmp/LTL2640007170289082437.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/LTL10280668540295779279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2640007170289082437.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(G("(i1.u18.p1577==0)"))))
Formula 0 simplified : GF!"(i1.u18.p1577==0)"
Detected timeout of ITS tools.
Treatment of property StigmergyCommit-PT-08b-LTLCardinality-05 finished in 276484 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((G((p0||X(p1)))||X(p2))))'
Support contains 3 out of 1826 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1826/1826 places, 41842/41842 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1819 transition count 41835
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1819 transition count 41835
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 1813 transition count 41829
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 1813 transition count 41829
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 1809 transition count 41825
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 1809 transition count 41825
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1809 transition count 41824
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 1806 transition count 41821
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 1806 transition count 41821
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 1803 transition count 41818
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 1803 transition count 41818
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 1800 transition count 41815
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 1800 transition count 41815
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 1797 transition count 41812
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 1797 transition count 41812
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 1794 transition count 41809
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 1794 transition count 41809
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 1794 transition count 41808
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 1792 transition count 41806
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 1792 transition count 41806
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 1790 transition count 41804
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 1790 transition count 41804
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1789 transition count 41803
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1789 transition count 41803
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 1788 transition count 41802
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 1788 transition count 41802
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 1787 transition count 41801
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 1787 transition count 41801
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1786 transition count 41800
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1786 transition count 41800
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 1785 transition count 41799
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 1785 transition count 41799
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 1784 transition count 41798
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 1784 transition count 41798
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 1783 transition count 41797
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 1783 transition count 41797
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 1782 transition count 41796
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 1782 transition count 41796
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 1781 transition count 41795
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 1781 transition count 41795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 1781 transition count 41794
Applied a total of 93 rules in 10473 ms. Remains 1781 /1826 variables (removed 45) and now considering 41794/41842 (removed 48) transitions.
// Phase 1: matrix 41794 rows 1781 cols
[2024-05-29 15:23:24] [INFO ] Computed 10 invariants in 911 ms
[2024-05-29 15:23:37] [INFO ] Implicit Places using invariants in 14159 ms returned []
Implicit Place search using SMT only with invariants took 14160 ms to find 0 implicit places.
Running 41793 sub problems to find dead transitions.
[2024-05-29 15:23:38] [INFO ] Invariant cache hit.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-08b"
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-08b, 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-171690531800195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-08b.tgz
mv StigmergyCommit-PT-08b 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 ;