About the Execution of ITS-Tools for StigmergyElection-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14258.939 | 675132.00 | 795566.00 | 1394.50 | FTTTFFTFTFFTTTFT | 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-171690532100345.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 StigmergyElection-PT-08a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100345
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 5.3M 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 StigmergyElection-PT-08a-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-08a-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717011958259
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 19:45:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:45:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:45:59] [INFO ] Load time of PNML (sax parser for PT used): 423 ms
[2024-05-29 19:45:59] [INFO ] Transformed 114 places.
[2024-05-29 19:45:59] [INFO ] Transformed 6882 transitions.
[2024-05-29 19:45:59] [INFO ] Found NUPN structural information;
[2024-05-29 19:45:59] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 590 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08a-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 664/664 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 109 transition count 659
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 109 transition count 659
Applied a total of 10 rules in 26 ms. Remains 109 /114 variables (removed 5) and now considering 659/664 (removed 5) transitions.
[2024-05-29 19:46:00] [INFO ] Flow matrix only has 640 transitions (discarded 19 similar events)
// Phase 1: matrix 640 rows 109 cols
[2024-05-29 19:46:00] [INFO ] Computed 4 invariants in 21 ms
[2024-05-29 19:46:00] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-29 19:46:00] [INFO ] Flow matrix only has 640 transitions (discarded 19 similar events)
[2024-05-29 19:46:00] [INFO ] Invariant cache hit.
[2024-05-29 19:46:00] [INFO ] State equation strengthened by 549 read => feed constraints.
[2024-05-29 19:46:01] [INFO ] Implicit Places using invariants and state equation in 706 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1067 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/114 places, 659/664 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 106 transition count 657
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 106 transition count 657
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 105 transition count 656
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 105 transition count 656
Applied a total of 6 rules in 13 ms. Remains 105 /108 variables (removed 3) and now considering 656/659 (removed 3) transitions.
[2024-05-29 19:46:01] [INFO ] Flow matrix only has 637 transitions (discarded 19 similar events)
// Phase 1: matrix 637 rows 105 cols
[2024-05-29 19:46:01] [INFO ] Computed 3 invariants in 5 ms
[2024-05-29 19:46:01] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-29 19:46:01] [INFO ] Flow matrix only has 637 transitions (discarded 19 similar events)
[2024-05-29 19:46:01] [INFO ] Invariant cache hit.
[2024-05-29 19:46:01] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:46:01] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/114 places, 656/664 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1520 ms. Remains : 105/114 places, 656/664 transitions.
Support contains 49 out of 105 places after structural reductions.
[2024-05-29 19:46:01] [INFO ] Flatten gal took : 103 ms
[2024-05-29 19:46:02] [INFO ] Flatten gal took : 68 ms
[2024-05-29 19:46:02] [INFO ] Input system was already deterministic with 656 transitions.
Support contains 48 out of 105 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (22 resets) in 3477 ms. (11 steps per ms) remains 1/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
[2024-05-29 19:46:03] [INFO ] Flow matrix only has 637 transitions (discarded 19 similar events)
[2024-05-29 19:46:03] [INFO ] Invariant cache hit.
[2024-05-29 19:46:03] [INFO ] State equation strengthened by 517 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/105 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 636/741 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/741 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/742 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/742 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 742/742 variables, and 625 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 517/517 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:46:03] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 6 ms to minimize.
[2024-05-29 19:46:03] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 2 ms to minimize.
[2024-05-29 19:46:03] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 1 ms to minimize.
[2024-05-29 19:46:04] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2024-05-29 19:46:04] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 19:46:04] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-29 19:46:04] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:46:04] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:46:04] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:46:04] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:46:04] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:46:04] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:46:04] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:46:05] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:46:06] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 91/742 variables, and 38 constraints, problems are : Problem set: 1 solved, 0 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/105 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 36/36 constraints]
After SMT, in 3574ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-29 19:46:06] [INFO ] Flatten gal took : 44 ms
[2024-05-29 19:46:06] [INFO ] Flatten gal took : 38 ms
[2024-05-29 19:46:06] [INFO ] Input system was already deterministic with 656 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 89 transition count 632
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 89 transition count 632
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 78 transition count 614
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 78 transition count 614
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 72 transition count 608
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 72 transition count 608
Applied a total of 66 rules in 14 ms. Remains 72 /105 variables (removed 33) and now considering 608/656 (removed 48) transitions.
[2024-05-29 19:46:06] [INFO ] Flow matrix only has 599 transitions (discarded 9 similar events)
// Phase 1: matrix 599 rows 72 cols
[2024-05-29 19:46:06] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:46:07] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-29 19:46:07] [INFO ] Flow matrix only has 599 transitions (discarded 9 similar events)
[2024-05-29 19:46:07] [INFO ] Invariant cache hit.
[2024-05-29 19:46:07] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:46:07] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 607 sub problems to find dead transitions.
[2024-05-29 19:46:07] [INFO ] Flow matrix only has 599 transitions (discarded 9 similar events)
[2024-05-29 19:46:07] [INFO ] Invariant cache hit.
[2024-05-29 19:46:07] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:46:16] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:46:17] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:46:18] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-05-29 19:46:18] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:46:18] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-29 19:46:18] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:46:18] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:46:18] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:46:18] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:46:18] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:46:18] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:46:18] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:46:19] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:46:20] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:46:21] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:46:22] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2024-05-29 19:46:23] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2024-05-29 19:46:24] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:46:24] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:46:24] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:46:24] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:46:24] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:46:24] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:46:25] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:46:25] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:46:25] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:46:25] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:46:25] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2024-05-29 19:46:26] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:46:26] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:46:26] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 13/79 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:46:28] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-29 19:46:28] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2024-05-29 19:46:28] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2024-05-29 19:46:28] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:46:28] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:46:28] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:46:28] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:46:30] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:46:30] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:46:30] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:46:30] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2024-05-29 19:46:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:46:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:46:30] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:46:32] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:46:32] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:46:32] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:46:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:46:36] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:46:37] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:46:38] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 9/110 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 13 (OVERLAPS) 598/670 variables, 72/182 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/670 variables, 516/698 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/671 variables, and 698 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 607 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 4 (OVERLAPS) 598/670 variables, 72/182 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/670 variables, 516/698 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/670 variables, 607/1305 constraints. Problems are: Problem set: 0 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/671 variables, and 1305 constraints, problems are : Problem set: 0 solved, 607 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 607/607 constraints, Known Traps: 109/109 constraints]
After SMT, in 66526ms problems are : Problem set: 0 solved, 607 unsolved
Search for dead transitions found 0 dead transitions in 66537ms
Starting structural reductions in LTL mode, iteration 1 : 72/105 places, 608/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67012 ms. Remains : 72/105 places, 608/656 transitions.
[2024-05-29 19:47:13] [INFO ] Flatten gal took : 30 ms
[2024-05-29 19:47:14] [INFO ] Flatten gal took : 31 ms
[2024-05-29 19:47:14] [INFO ] Input system was already deterministic with 608 transitions.
[2024-05-29 19:47:14] [INFO ] Flatten gal took : 30 ms
[2024-05-29 19:47:14] [INFO ] Flatten gal took : 29 ms
[2024-05-29 19:47:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality17523682441468553043.gal : 30 ms
[2024-05-29 19:47:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8889214520753499752.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17523682441468553043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8889214520753499752.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,438165,2.32598,64344,2,4672,5,73533,6,0,887,46351,0
Converting to forward existential form...Done !
original formula: EF((EX((((p94==0)&&(p11==1))||(p3==1))) * ((p37==0)||(p90==1))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * ((p37==0)||(p90==1)))) * (((p94==0)&&(p11==1))||(p3==1)))] != FALSE
(forward)formula 0,1,2.94825,64344,1,0,9,73533,9,2,4468,46351,3
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 88 transition count 631
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 88 transition count 631
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 48 place count 74 transition count 609
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 74 transition count 609
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 67 transition count 602
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 67 transition count 602
Applied a total of 76 rules in 12 ms. Remains 67 /105 variables (removed 38) and now considering 602/656 (removed 54) transitions.
[2024-05-29 19:47:17] [INFO ] Flow matrix only has 593 transitions (discarded 9 similar events)
// Phase 1: matrix 593 rows 67 cols
[2024-05-29 19:47:17] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:47:17] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-29 19:47:17] [INFO ] Flow matrix only has 593 transitions (discarded 9 similar events)
[2024-05-29 19:47:17] [INFO ] Invariant cache hit.
[2024-05-29 19:47:17] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:47:17] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:47:17] [INFO ] Flow matrix only has 593 transitions (discarded 9 similar events)
[2024-05-29 19:47:17] [INFO ] Invariant cache hit.
[2024-05-29 19:47:17] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:47:25] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:47:26] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:47:27] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:47:28] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:47:29] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:47:30] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:47:31] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2024-05-29 19:47:32] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:47:33] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:47:34] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:47:36] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:47:36] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:47:36] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:47:36] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:47:36] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:47:37] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:47:37] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:47:37] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:47:39] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:47:40] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:47:40] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:47:41] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:47:41] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2024-05-29 19:47:41] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:47:41] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:47:41] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 11 (OVERLAPS) 592/659 variables, 67/167 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/659 variables, 516/683 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 659/660 variables, and 683 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:47:55] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:47:55] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:47:56] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:47:56] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:47:56] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:47:58] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:48:00] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:48:02] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:48:02] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 7 (OVERLAPS) 592/659 variables, 67/176 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 516/692 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/660 variables, and 1293 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 108/108 constraints]
After SMT, in 66118ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 66125ms
Starting structural reductions in LTL mode, iteration 1 : 67/105 places, 602/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66533 ms. Remains : 67/105 places, 602/656 transitions.
[2024-05-29 19:48:23] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:48:23] [INFO ] Flatten gal took : 30 ms
[2024-05-29 19:48:23] [INFO ] Input system was already deterministic with 602 transitions.
[2024-05-29 19:48:23] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:48:23] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:48:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality305118657678903822.gal : 16 ms
[2024-05-29 19:48:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality5324230788751712442.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality305118657678903822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5324230788751712442.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,413586,2.31104,62584,2,3926,5,63512,6,0,861,39270,0
Converting to forward existential form...Done !
original formula: A(EX((AF((p67==1)) + EF(!(((p26==1)||(p63==0)))))) U !(AF(!(EX(((p46==1)||(p81==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(!(EG(!(!(EX(((p46==1)||(p81==1)))))))))))) * !(E(!(!(!(EG(!(!(EX(((p46==1)||(p81==1))))))))) ...281
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...404
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,14.3532,338348,1,0,876,593864,1234,193,21923,353643,1417
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 104 transition count 627
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 76 transition count 627
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 56 place count 76 transition count 611
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 88 place count 60 transition count 611
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 97 place count 51 transition count 595
Iterating global reduction 2 with 9 rules applied. Total rules applied 106 place count 51 transition count 595
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 113 place count 44 transition count 581
Iterating global reduction 2 with 7 rules applied. Total rules applied 120 place count 44 transition count 581
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 247 place count 44 transition count 454
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 249 place count 43 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 251 place count 42 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 368 transitions
Redundant transition composition rules discarded 368 transitions
Iterating global reduction 3 with 368 rules applied. Total rules applied 619 place count 42 transition count 84
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 635 place count 34 transition count 76
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 642 place count 27 transition count 69
Applied a total of 642 rules in 110 ms. Remains 27 /105 variables (removed 78) and now considering 69/656 (removed 587) transitions.
[2024-05-29 19:48:38] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
// Phase 1: matrix 60 rows 27 cols
[2024-05-29 19:48:38] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:48:38] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 19:48:38] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-05-29 19:48:38] [INFO ] Invariant cache hit.
[2024-05-29 19:48:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 19:48:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-29 19:48:38] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2024-05-29 19:48:38] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-05-29 19:48:38] [INFO ] Invariant cache hit.
[2024-05-29 19:48:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:48:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 59/86 variables, 27/67 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:48:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:48:40] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 1/87 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 0/87 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 94 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2387 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 19:48:41] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 59/86 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 1/87 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 0/87 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 132 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 66/66 constraints]
After SMT, in 3434ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 3435ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/105 places, 69/656 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3619 ms. Remains : 27/105 places, 69/656 transitions.
[2024-05-29 19:48:42] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:48:42] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:48:42] [INFO ] Input system was already deterministic with 69 transitions.
RANDOM walk for 121 steps (9 resets) in 5 ms. (20 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 19:48:42] [INFO ] Flatten gal took : 3 ms
[2024-05-29 19:48:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:48:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16121070297216045601.gal : 1 ms
[2024-05-29 19:48:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6069557080734687914.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16121070297216045601.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6069557080734687914.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 104 transition count 629
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 78 transition count 629
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 52 place count 78 transition count 613
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 84 place count 62 transition count 613
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 52 transition count 595
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 52 transition count 595
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 112 place count 44 transition count 579
Iterating global reduction 2 with 8 rules applied. Total rules applied 120 place count 44 transition count 579
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 375 place count 44 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 377 place count 43 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 232 transitions
Redundant transition composition rules discarded 232 transitions
Iterating global reduction 3 with 232 rules applied. Total rules applied 609 place count 43 transition count 91
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 625 place count 35 transition count 83
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 632 place count 28 transition count 76
Applied a total of 632 rules in 64 ms. Remains 28 /105 variables (removed 77) and now considering 76/656 (removed 580) transitions.
[2024-05-29 19:48:42] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
// Phase 1: matrix 68 rows 28 cols
[2024-05-29 19:48:42] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:48:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 19:48:42] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2024-05-29 19:48:42] [INFO ] Invariant cache hit.
[2024-05-29 19:48:42] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-29 19:48:42] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-29 19:48:42] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
[2024-05-29 19:48:42] [INFO ] Flow matrix only has 68 transitions (discarded 8 similar events)
[2024-05-29 19:48:42] [INFO ] Invariant cache hit.
[2024-05-29 19:48:42] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:48:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:48:44] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:48:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:48:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:48:44] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 67/95 variables, 28/83 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-29 19:48:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-29 19:48:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:48:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:48:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/95 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/95 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 13 (OVERLAPS) 1/96 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/96 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 15 (OVERLAPS) 0/96 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 111 constraints, problems are : Problem set: 0 solved, 75 unsolved in 3290 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-29 19:48:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-29 19:48:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:48:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:48:46] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 67/95 variables, 28/91 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 23/114 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 75/189 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (OVERLAPS) 1/96 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/96 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 13 (OVERLAPS) 0/96 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 190 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2669 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 62/62 constraints]
After SMT, in 6004ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 6005ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/105 places, 76/656 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6139 ms. Remains : 28/105 places, 76/656 transitions.
[2024-05-29 19:48:48] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:48:48] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:48:48] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-29 19:48:48] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:48:48] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:48:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality16009661254015047584.gal : 1 ms
[2024-05-29 19:48:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality12576674283658609502.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16009661254015047584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12576674283658609502.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,275,0.021969,4512,2,161,5,1679,6,0,180,1032,0
Converting to forward existential form...Done !
original formula: AG(AF(((p68==0)||(p79==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p68==0)||(p79==1))))] = FALSE
Hit Full ! (commute/partial/dont) 32/44/44
(forward)formula 0,0,0.042845,4828,1,0,7,3493,20,1,1874,2030,8
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 90 transition count 634
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 90 transition count 634
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 78 transition count 615
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 78 transition count 615
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 72 transition count 609
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 72 transition count 609
Applied a total of 66 rules in 9 ms. Remains 72 /105 variables (removed 33) and now considering 609/656 (removed 47) transitions.
[2024-05-29 19:48:48] [INFO ] Flow matrix only has 599 transitions (discarded 10 similar events)
// Phase 1: matrix 599 rows 72 cols
[2024-05-29 19:48:48] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:48:48] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-29 19:48:48] [INFO ] Flow matrix only has 599 transitions (discarded 10 similar events)
[2024-05-29 19:48:48] [INFO ] Invariant cache hit.
[2024-05-29 19:48:48] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:48:48] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 608 sub problems to find dead transitions.
[2024-05-29 19:48:48] [INFO ] Flow matrix only has 599 transitions (discarded 10 similar events)
[2024-05-29 19:48:48] [INFO ] Invariant cache hit.
[2024-05-29 19:48:48] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:48:56] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:48:57] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:48:58] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:48:59] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:49:00] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:49:01] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:49:01] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:49:01] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:49:01] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:49:01] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2024-05-29 19:49:02] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-05-29 19:49:03] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2024-05-29 19:49:04] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:49:05] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:49:06] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2024-05-29 19:49:06] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 19:49:06] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2024-05-29 19:49:06] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:49:07] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:49:09] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:49:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:49:10] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:49:10] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:49:10] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:49:10] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:49:10] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:49:11] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:49:12] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 19:49:12] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:49:14] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:49:14] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:49:14] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 5/93 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:49:15] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:49:15] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:49:15] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:49:15] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:49:16] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:49:17] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:49:17] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/72 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 13 (OVERLAPS) 598/670 variables, 72/172 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/670 variables, 516/688 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/671 variables, and 688 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:49:27] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:49:27] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 608 unsolved
[2024-05-29 19:49:30] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:49:30] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 6 (OVERLAPS) 598/670 variables, 72/176 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/670 variables, 516/692 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/671 variables, and 1300 constraints, problems are : Problem set: 0 solved, 608 unsolved in 32307 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 103/103 constraints]
After SMT, in 68252ms problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 68262ms
Starting structural reductions in LTL mode, iteration 1 : 72/105 places, 609/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68687 ms. Remains : 72/105 places, 609/656 transitions.
[2024-05-29 19:49:57] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:49:57] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:49:57] [INFO ] Input system was already deterministic with 609 transitions.
[2024-05-29 19:49:57] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:49:57] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:49:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17326095643639230387.gal : 5 ms
[2024-05-29 19:49:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality6654543069768002787.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17326095643639230387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6654543069768002787.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,450452,2.60349,74492,2,5314,5,88686,6,0,887,55666,0
Converting to forward existential form...Done !
original formula: EX((A((p21==1) U AF(!(((p1==0)||(p55==1))))) * EG((p3==0))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !((E(!(!(EG(!(!(((p1==0)||(p55==1))))))) U (!((p21==1)) * !(!(EG(!(!(((p1==0)||(p55==1))))))))...220
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...414
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,10.5483,250736,1,0,742,465570,1244,102,21307,286233,1247
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 93 transition count 638
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 93 transition count 638
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 87 transition count 627
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 87 transition count 627
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 82 transition count 622
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 82 transition count 622
Applied a total of 46 rules in 18 ms. Remains 82 /105 variables (removed 23) and now considering 622/656 (removed 34) transitions.
[2024-05-29 19:50:07] [INFO ] Flow matrix only has 611 transitions (discarded 11 similar events)
// Phase 1: matrix 611 rows 82 cols
[2024-05-29 19:50:07] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 19:50:07] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-29 19:50:08] [INFO ] Flow matrix only has 611 transitions (discarded 11 similar events)
[2024-05-29 19:50:08] [INFO ] Invariant cache hit.
[2024-05-29 19:50:08] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:50:08] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 621 sub problems to find dead transitions.
[2024-05-29 19:50:08] [INFO ] Flow matrix only has 611 transitions (discarded 11 similar events)
[2024-05-29 19:50:08] [INFO ] Invariant cache hit.
[2024-05-29 19:50:08] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-29 19:50:16] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2024-05-29 19:50:16] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:50:17] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 19:50:17] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2024-05-29 19:50:17] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-05-29 19:50:17] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-29 19:50:17] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:50:17] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2024-05-29 19:50:17] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:50:17] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-29 19:50:17] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-29 19:50:18] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2024-05-29 19:50:18] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 19:50:18] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 19:50:18] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2024-05-29 19:50:18] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:50:18] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2024-05-29 19:50:18] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:50:18] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2024-05-29 19:50:18] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-29 19:50:19] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 19:50:19] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2024-05-29 19:50:19] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:50:19] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2024-05-29 19:50:19] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:50:19] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:50:20] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:50:21] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:50:21] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:50:21] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-29 19:50:22] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-29 19:50:22] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:50:22] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 1 ms to minimize.
[2024-05-29 19:50:22] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:50:22] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:50:22] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:50:23] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:50:24] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:50:24] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-29 19:50:24] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:50:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:50:24] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:50:24] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:50:24] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:50:24] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2024-05-29 19:50:24] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:50:24] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:50:25] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-29 19:50:26] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-29 19:50:26] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:50:26] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:50:26] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:50:26] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:50:26] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:50:26] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:50:26] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:50:28] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:50:28] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:50:28] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:50:28] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-29 19:50:29] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2024-05-29 19:50:29] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:50:30] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:50:30] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:50:31] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:50:32] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:50:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-29 19:50:33] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 11 (OVERLAPS) 610/692 variables, 82/186 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/692 variables, 516/702 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 692/693 variables, and 702 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 103/103 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-29 19:50:47] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:50:47] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:50:48] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:50:48] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:50:50] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 621 unsolved
[2024-05-29 19:50:52] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:50:55] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 6 (OVERLAPS) 610/692 variables, 82/194 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/692 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 692/693 variables, and 1331 constraints, problems are : Problem set: 0 solved, 621 unsolved in 31302 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 111/111 constraints]
After SMT, in 67442ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 67452ms
Starting structural reductions in LTL mode, iteration 1 : 82/105 places, 622/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67921 ms. Remains : 82/105 places, 622/656 transitions.
[2024-05-29 19:51:15] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:51:15] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:51:15] [INFO ] Input system was already deterministic with 622 transitions.
[2024-05-29 19:51:15] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:51:15] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:51:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality6277242535493239093.gal : 6 ms
[2024-05-29 19:51:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality4443149620716301841.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6277242535493239093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4443149620716301841.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,460698,1.76101,55816,2,4328,5,82966,6,0,939,45306,0
Converting to forward existential form...Done !
original formula: EX(EG(E(((A(((p93==0)||(p29==1)) U ((p20==0)||(p56==1))) + (p80==0)) + (p37==1)) U EG(((p9==0)||(p71==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(((!((E(!(((p20==0)||(p56==1))) U (!(((p93==0)||(p29==1))) * !(((p20==0)||(p56==1))))) + EG(!(((...239
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t17, t19, t21, t22, t24, t26, t27, t29, t31, t32,...424
(forward)formula 0,1,8.6367,225432,1,0,766,375944,1273,120,23476,265302,1295
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 89 transition count 632
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 89 transition count 632
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 77 transition count 613
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 77 transition count 613
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 70 transition count 606
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 70 transition count 606
Applied a total of 70 rules in 19 ms. Remains 70 /105 variables (removed 35) and now considering 606/656 (removed 50) transitions.
[2024-05-29 19:51:24] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
// Phase 1: matrix 597 rows 70 cols
[2024-05-29 19:51:24] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 19:51:24] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 19:51:24] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2024-05-29 19:51:24] [INFO ] Invariant cache hit.
[2024-05-29 19:51:24] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:51:25] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-29 19:51:25] [INFO ] Flow matrix only has 597 transitions (discarded 9 similar events)
[2024-05-29 19:51:25] [INFO ] Invariant cache hit.
[2024-05-29 19:51:25] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:51:32] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:51:33] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-29 19:51:34] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:51:35] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:51:36] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:51:36] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:51:36] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 19:51:36] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:51:36] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:51:36] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:51:36] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:51:36] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:51:36] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:51:37] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:51:38] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:51:40] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:51:41] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:51:41] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:51:41] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2024-05-29 19:51:41] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2024-05-29 19:51:42] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:51:42] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:51:42] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:51:43] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2024-05-29 19:51:43] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-05-29 19:51:43] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:51:43] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:51:43] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:51:43] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-05-29 19:51:43] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:51:43] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:51:43] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:51:43] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:51:46] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:51:46] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:51:48] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:51:48] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:51:49] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:51:49] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:51:49] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:51:49] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:51:49] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:51:50] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:51:51] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:51:52] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:51:52] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:51:52] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:51:52] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:51:52] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:51:52] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:51:53] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:51:54] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 13 (OVERLAPS) 596/666 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/666 variables, 516/690 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/667 variables, and 690 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 103/103 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (OVERLAPS) 596/666 variables, 70/174 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 516/690 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 605/1295 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/667 variables, and 1295 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 103/103 constraints]
After SMT, in 65894ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 65903ms
Starting structural reductions in LTL mode, iteration 1 : 70/105 places, 606/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66345 ms. Remains : 70/105 places, 606/656 transitions.
[2024-05-29 19:52:31] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:52:31] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:52:31] [INFO ] Input system was already deterministic with 606 transitions.
[2024-05-29 19:52:31] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:52:31] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:52:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality7146480563440316034.gal : 8 ms
[2024-05-29 19:52:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14114104067828140472.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7146480563440316034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14114104067828140472.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,429972,2.17306,61284,2,3745,5,63800,6,0,877,39290,0
Converting to forward existential form...Done !
original formula: AX(EX(AF(AX(((p90==1)&&((p39==0)||(p51==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(!(!(EX(!(((p90==1)&&((p39==0)||(p51==1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t10, t11, t13, t15, t16, t18, t20, t21, t23, t25, t26, t28, t30, t31,...409
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.40702,145696,1,0,741,248293,1227,100,21958,168971,1239
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 88 transition count 631
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 88 transition count 631
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 47 place count 75 transition count 611
Iterating global reduction 0 with 13 rules applied. Total rules applied 60 place count 75 transition count 611
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 67 place count 68 transition count 604
Iterating global reduction 0 with 7 rules applied. Total rules applied 74 place count 68 transition count 604
Applied a total of 74 rules in 14 ms. Remains 68 /105 variables (removed 37) and now considering 604/656 (removed 52) transitions.
[2024-05-29 19:52:37] [INFO ] Flow matrix only has 595 transitions (discarded 9 similar events)
// Phase 1: matrix 595 rows 68 cols
[2024-05-29 19:52:37] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 19:52:37] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-29 19:52:37] [INFO ] Flow matrix only has 595 transitions (discarded 9 similar events)
[2024-05-29 19:52:37] [INFO ] Invariant cache hit.
[2024-05-29 19:52:37] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:52:38] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2024-05-29 19:52:38] [INFO ] Flow matrix only has 595 transitions (discarded 9 similar events)
[2024-05-29 19:52:38] [INFO ] Invariant cache hit.
[2024-05-29 19:52:38] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:52:45] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:52:46] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:52:47] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:52:48] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:52:49] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:52:49] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:52:49] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2024-05-29 19:52:49] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:52:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:52:50] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:52:50] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:52:50] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:52:50] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:52:50] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:52:50] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:52:51] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:52:52] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:52:52] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:52:53] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:52:54] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:52:54] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:52:54] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:52:54] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:52:54] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:52:54] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:52:54] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:52:55] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:52:55] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:52:55] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:52:55] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:52:56] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:52:56] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:52:56] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:52:56] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:52:56] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:52:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:52:56] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:52:57] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:52:58] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:52:59] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 9 (OVERLAPS) 594/662 variables, 68/150 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 516/666 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:53:08] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:53:08] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:53:08] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:53:08] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/663 variables, and 670 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:53:15] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:53:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:53:15] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:53:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:53:16] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:53:16] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:53:19] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 6 (OVERLAPS) 594/662 variables, 68/161 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 516/677 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 603/1280 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/663 variables, and 1280 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 92/92 constraints]
After SMT, in 65984ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 65992ms
Starting structural reductions in LTL mode, iteration 1 : 68/105 places, 604/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66400 ms. Remains : 68/105 places, 604/656 transitions.
[2024-05-29 19:53:44] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:53:44] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:53:44] [INFO ] Input system was already deterministic with 604 transitions.
[2024-05-29 19:53:44] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:53:44] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:53:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality7451729926403760384.gal : 6 ms
[2024-05-29 19:53:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15582520467445520991.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7451729926403760384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15582520467445520991.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,429970,2.19238,61276,2,3650,5,63130,6,0,867,38987,0
Converting to forward existential form...Done !
original formula: EG(AX(((p90==0)||(p68==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((p90==0)||(p68==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t8, t10, t11, t13, t15, t16, t18, t20, t21, t23, t25, t26, t28, t30, t31,...409
(forward)formula 0,1,14.4678,347624,1,0,839,433667,1221,177,22400,421350,1311
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 90 transition count 634
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 90 transition count 634
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 79 transition count 616
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 79 transition count 616
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 75 transition count 612
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 75 transition count 612
Applied a total of 60 rules in 12 ms. Remains 75 /105 variables (removed 30) and now considering 612/656 (removed 44) transitions.
[2024-05-29 19:53:58] [INFO ] Flow matrix only has 602 transitions (discarded 10 similar events)
// Phase 1: matrix 602 rows 75 cols
[2024-05-29 19:53:58] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:53:58] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 19:53:58] [INFO ] Flow matrix only has 602 transitions (discarded 10 similar events)
[2024-05-29 19:53:58] [INFO ] Invariant cache hit.
[2024-05-29 19:53:59] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:53:59] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 611 sub problems to find dead transitions.
[2024-05-29 19:53:59] [INFO ] Flow matrix only has 602 transitions (discarded 10 similar events)
[2024-05-29 19:53:59] [INFO ] Invariant cache hit.
[2024-05-29 19:53:59] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2024-05-29 19:54:07] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:54:07] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2024-05-29 19:54:07] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-05-29 19:54:07] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 19:54:07] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:54:08] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:54:09] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-29 19:54:09] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:54:09] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2024-05-29 19:54:09] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2024-05-29 19:54:09] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 0 ms to minimize.
[2024-05-29 19:54:09] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-29 19:54:09] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:54:09] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2024-05-29 19:54:16] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:54:16] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:54:16] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:54:16] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:54:16] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:54:16] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2024-05-29 19:54:16] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2024-05-29 19:54:16] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2024-05-29 19:54:21] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:54:21] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:54:21] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:54:21] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 4 ms to minimize.
[2024-05-29 19:54:21] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:54:21] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2024-05-29 19:54:23] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:54:23] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:54:23] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:54:23] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:54:23] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2024-05-29 19:54:23] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2024-05-29 19:54:25] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:54:25] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:54:25] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:54:25] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:54:25] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:54:25] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:54:25] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:54:25] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:54:25] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:54:25] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:54:27] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 19:54:27] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 611 unsolved
[2024-05-29 19:54:28] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:54:29] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:54:29] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 12 (OVERLAPS) 601/676 variables, 75/198 constraints. Problems are: Problem set: 0 solved, 611 unsolved
SMT process timed out in 35999ms, After SMT, problems are : Problem set: 0 solved, 611 unsolved
Search for dead transitions found 0 dead transitions in 36006ms
Starting structural reductions in LTL mode, iteration 1 : 75/105 places, 612/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36443 ms. Remains : 75/105 places, 612/656 transitions.
[2024-05-29 19:54:35] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:54:35] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:54:35] [INFO ] Input system was already deterministic with 612 transitions.
[2024-05-29 19:54:35] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:54:35] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:54:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality14561730759945626695.gal : 5 ms
[2024-05-29 19:54:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality15567255607909404130.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14561730759945626695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15567255607909404130.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,455829,2.38794,67648,2,4751,5,104317,6,0,902,56713,0
Converting to forward existential form...Done !
original formula: (A(EF((EF((((p85==1)||(p25==0))||(p38==1))) + AX(((p101==0)||(p7==1))))) U AF((p3!=0))) + AG((((p111==0)&&(p73==1))||(p95==0))))
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!(!(EG(!((p3!=0))))) U (!(E(TRUE U (E(TRUE U (((p85==1)||(p25==0))||(p38==1))) + !(EX(!(((...290
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t11, t12, t14, t16, t17, t18, t19, t21, t22, t24, t26, t27, t29, ...423
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,11.0142,253992,1,0,760,440256,1253,112,22762,288606,1269
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 90 transition count 634
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 90 transition count 634
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 78 transition count 615
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 78 transition count 615
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 71 transition count 608
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 71 transition count 608
Applied a total of 68 rules in 14 ms. Remains 71 /105 variables (removed 34) and now considering 608/656 (removed 48) transitions.
[2024-05-29 19:54:46] [INFO ] Flow matrix only has 598 transitions (discarded 10 similar events)
// Phase 1: matrix 598 rows 71 cols
[2024-05-29 19:54:46] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 19:54:46] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-29 19:54:46] [INFO ] Flow matrix only has 598 transitions (discarded 10 similar events)
[2024-05-29 19:54:46] [INFO ] Invariant cache hit.
[2024-05-29 19:54:46] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:54:46] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 607 sub problems to find dead transitions.
[2024-05-29 19:54:46] [INFO ] Flow matrix only has 598 transitions (discarded 10 similar events)
[2024-05-29 19:54:46] [INFO ] Invariant cache hit.
[2024-05-29 19:54:47] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:54:55] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 19:54:55] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 19:54:55] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2024-05-29 19:54:55] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 19:54:55] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:54:55] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-29 19:54:55] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-29 19:54:56] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:54:56] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:54:56] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 19:54:56] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:54:56] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:54:56] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 19:54:56] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-29 19:54:56] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:54:56] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:54:56] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:54:57] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:54:57] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-29 19:54:57] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:54:57] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:54:57] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:54:57] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:54:57] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2024-05-29 19:54:57] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-05-29 19:54:57] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:54:57] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:54:58] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:54:59] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:54:59] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:55:00] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2024-05-29 19:55:00] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:55:00] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:55:00] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 19:55:00] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:55:00] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 19:55:00] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-29 19:55:00] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:55:00] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:55:00] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:55:01] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:55:02] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:55:02] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:55:02] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:55:02] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:55:02] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:55:02] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:55:02] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:55:02] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2024-05-29 19:55:02] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:55:02] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:55:03] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:55:04] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2024-05-29 19:55:05] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:55:05] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:55:05] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:55:08] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:55:08] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:55:08] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:55:10] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:55:11] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 11/97 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:55:12] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:55:13] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:55:13] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:55:14] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:55:14] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:55:14] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:55:15] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:55:16] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:55:17] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:55:17] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:55:17] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:55:17] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 607 unsolved
[2024-05-29 19:55:19] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 607 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 607 unsolved
SMT process timed out in 36255ms, After SMT, problems are : Problem set: 0 solved, 607 unsolved
Search for dead transitions found 0 dead transitions in 36263ms
Starting structural reductions in LTL mode, iteration 1 : 71/105 places, 608/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36677 ms. Remains : 71/105 places, 608/656 transitions.
[2024-05-29 19:55:23] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:55:23] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:55:23] [INFO ] Input system was already deterministic with 608 transitions.
[2024-05-29 19:55:23] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:55:23] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:55:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality4243193588526679892.gal : 8 ms
[2024-05-29 19:55:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality9354227486535551112.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4243193588526679892.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9354227486535551112.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,446356,2.74836,73956,2,5007,5,81322,6,0,882,51676,0
Converting to forward existential form...Done !
original formula: EX(EG(E(EF(AX((p19==0))) U EF(((p12==0)||(p83==0))))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(E(TRUE U !(EX(!((p19==0))))) U E(TRUE U ((p12==0)||(p83==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...409
(forward)formula 0,1,11.3059,250704,1,0,738,398534,1232,102,22023,265352,1252
FORMULA StigmergyElection-PT-08a-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 104 transition count 629
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 78 transition count 629
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 52 place count 78 transition count 613
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 84 place count 62 transition count 613
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 93 place count 53 transition count 597
Iterating global reduction 2 with 9 rules applied. Total rules applied 102 place count 53 transition count 597
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 109 place count 46 transition count 583
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 46 transition count 583
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 243 place count 46 transition count 456
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 3 with 2 rules applied. Total rules applied 245 place count 45 transition count 455
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 3 with 2 rules applied. Total rules applied 247 place count 44 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 368 transitions
Redundant transition composition rules discarded 368 transitions
Iterating global reduction 3 with 368 rules applied. Total rules applied 615 place count 44 transition count 86
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 631 place count 36 transition count 78
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 638 place count 29 transition count 71
Applied a total of 638 rules in 75 ms. Remains 29 /105 variables (removed 76) and now considering 71/656 (removed 585) transitions.
[2024-05-29 19:55:34] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
// Phase 1: matrix 62 rows 29 cols
[2024-05-29 19:55:34] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 19:55:34] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 19:55:34] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2024-05-29 19:55:34] [INFO ] Invariant cache hit.
[2024-05-29 19:55:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 19:55:34] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-29 19:55:34] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-29 19:55:34] [INFO ] Flow matrix only has 62 transitions (discarded 9 similar events)
[2024-05-29 19:55:35] [INFO ] Invariant cache hit.
[2024-05-29 19:55:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 8/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:55:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 61/90 variables, 29/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:55:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 1/91 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/91 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 94 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2708 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 8/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:55:37] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 61/90 variables, 29/95 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 135 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1070 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 65/65 constraints]
After SMT, in 3787ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 3788ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/105 places, 71/656 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3944 ms. Remains : 29/105 places, 71/656 transitions.
[2024-05-29 19:55:38] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:55:38] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:55:38] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-29 19:55:38] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:55:38] [INFO ] Flatten gal took : 3 ms
[2024-05-29 19:55:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality13597174232560954551.gal : 2 ms
[2024-05-29 19:55:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality15665273733808827432.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13597174232560954551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15665273733808827432.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,530,0.027699,4320,2,170,5,1804,6,0,178,1066,0
Converting to forward existential form...Done !
original formula: EG(!(A(AF((p93==1)) U (p47==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((p47==1)) U (!(!(EG(!((p93==1))))) * !((p47==1)))) + EG(!((p47==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t22...280
(forward)formula 0,1,0.082667,5428,1,0,146,7572,165,68,2356,7740,183
FORMULA StigmergyElection-PT-08a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 95 transition count 641
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 95 transition count 641
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 86 transition count 627
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 86 transition count 627
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 82 transition count 623
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 82 transition count 623
Applied a total of 46 rules in 11 ms. Remains 82 /105 variables (removed 23) and now considering 623/656 (removed 33) transitions.
[2024-05-29 19:55:38] [INFO ] Flow matrix only has 610 transitions (discarded 13 similar events)
// Phase 1: matrix 610 rows 82 cols
[2024-05-29 19:55:38] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 19:55:39] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-29 19:55:39] [INFO ] Flow matrix only has 610 transitions (discarded 13 similar events)
[2024-05-29 19:55:39] [INFO ] Invariant cache hit.
[2024-05-29 19:55:39] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 19:55:39] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 622 sub problems to find dead transitions.
[2024-05-29 19:55:39] [INFO ] Flow matrix only has 610 transitions (discarded 13 similar events)
[2024-05-29 19:55:39] [INFO ] Invariant cache hit.
[2024-05-29 19:55:39] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:55:47] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:55:47] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 19:55:47] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:55:47] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-05-29 19:55:48] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-29 19:55:48] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2024-05-29 19:55:48] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 19:55:48] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-29 19:55:48] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2024-05-29 19:55:48] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2024-05-29 19:55:48] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:55:49] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 19:55:49] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:55:49] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:55:49] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:55:49] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 0 ms to minimize.
[2024-05-29 19:55:49] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:55:49] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:55:49] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:55:49] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:55:49] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:55:50] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2024-05-29 19:55:51] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 19:55:51] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:55:51] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-29 19:55:51] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:55:51] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2024-05-29 19:55:51] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:55:52] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-29 19:55:52] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:55:52] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:55:52] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:55:52] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:55:52] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:55:52] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:55:53] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:55:54] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:55:55] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:55:55] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:55:55] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:55:55] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2024-05-29 19:55:55] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:55:55] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:55:55] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:55:56] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:55:58] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:55:59] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 0 ms to minimize.
[2024-05-29 19:55:59] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:55:59] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:55:59] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:56:00] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:56:00] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:56:01] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:56:01] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 19:56:02] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:56:02] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:56:02] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:56:02] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:56:03] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:56:03] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:56:03] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:56:03] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:56:04] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:56:04] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:56:08] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:56:08] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:56:09] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2024-05-29 19:56:09] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:56:09] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:56:09] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:56:11] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/82 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 82/692 variables, and 121 constraints, problems are : Problem set: 0 solved, 622 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/82 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 622/622 constraints, Known Traps: 119/119 constraints]
Escalating to Integer solving :Problem set: 0 solved, 622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:56:19] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 5 (OVERLAPS) 609/691 variables, 82/204 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 516/720 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 622/1342 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 691/692 variables, and 1342 constraints, problems are : Problem set: 0 solved, 622 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 622/622 constraints, Known Traps: 120/120 constraints]
After SMT, in 65917ms problems are : Problem set: 0 solved, 622 unsolved
Search for dead transitions found 0 dead transitions in 65928ms
Starting structural reductions in LTL mode, iteration 1 : 82/105 places, 623/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66342 ms. Remains : 82/105 places, 623/656 transitions.
[2024-05-29 19:56:45] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:56:45] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:56:45] [INFO ] Input system was already deterministic with 623 transitions.
[2024-05-29 19:56:45] [INFO ] Flatten gal took : 25 ms
[2024-05-29 19:56:45] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:56:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality5781921199637427221.gal : 5 ms
[2024-05-29 19:56:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality9297920410590769334.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5781921199637427221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9297920410590769334.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,461975,2.22968,64008,2,5047,5,89809,6,0,936,48658,0
Converting to forward existential form...Done !
original formula: (EX(((p12==0) + A(EX(AX((p43==1))) U (!(((p78==0)||(p70==1))) + A(((p99==0)||(p56==1)) U (p51==1)))))) * EF((((p11==1)||(p37==1)) * EX(((...190
=> equivalent forward existential formula: [(EY((FwdU((Init * EX(((p12==0) + !((E(!((!(((p78==0)||(p70==1))) + !((E(!((p51==1)) U (!(((p99==0)||(p56==1))) ...536
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t16, t17, t18, t19, t21, t22, t24, t25, t27, t29, t30, t32,...419
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,23.0085,534220,1,0,889,1.15311e+06,1273,204,22789,701925,1447
FORMULA StigmergyElection-PT-08a-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 656/656 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 104 transition count 627
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 76 transition count 627
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 56 place count 76 transition count 612
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 86 place count 61 transition count 612
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 95 place count 52 transition count 596
Iterating global reduction 2 with 9 rules applied. Total rules applied 104 place count 52 transition count 596
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 111 place count 45 transition count 582
Iterating global reduction 2 with 7 rules applied. Total rules applied 118 place count 45 transition count 582
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 181 place count 45 transition count 519
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 3 with 2 rules applied. Total rules applied 183 place count 44 transition count 518
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 3 with 2 rules applied. Total rules applied 185 place count 43 transition count 517
Drop transitions (Redundant composition of simpler transitions.) removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 3 with 416 rules applied. Total rules applied 601 place count 43 transition count 101
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 617 place count 35 transition count 93
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 624 place count 28 transition count 86
Applied a total of 624 rules in 52 ms. Remains 28 /105 variables (removed 77) and now considering 86/656 (removed 570) transitions.
[2024-05-29 19:57:08] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
// Phase 1: matrix 77 rows 28 cols
[2024-05-29 19:57:08] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 19:57:08] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 19:57:08] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
[2024-05-29 19:57:08] [INFO ] Invariant cache hit.
[2024-05-29 19:57:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 19:57:08] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-29 19:57:08] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-29 19:57:08] [INFO ] Flow matrix only has 77 transitions (discarded 9 similar events)
[2024-05-29 19:57:08] [INFO ] Invariant cache hit.
[2024-05-29 19:57:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 8/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 19:57:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:57:08] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:57:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:57:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:57:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 76/104 variables, 28/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:57:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 1/105 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 19:57:11] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/105 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 0/105 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 94 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2966 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 8/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-29 19:57:12] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 76/104 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 38/132 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/105 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 133 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1295 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 65/65 constraints]
After SMT, in 4274ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 4275ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/105 places, 86/656 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4411 ms. Remains : 28/105 places, 86/656 transitions.
[2024-05-29 19:57:13] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:57:13] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:57:13] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-29 19:57:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 19:57:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 19:57:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality1699048898134656142.gal : 1 ms
[2024-05-29 19:57:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality9474992278701505043.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1699048898134656142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9474992278701505043.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,720,0.042998,4752,2,317,5,2645,6,0,189,2180,0
Converting to forward existential form...Done !
original formula: EG(AG(((p91==0)||(p19==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((p91==0)||(p19==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21...285
(forward)formula 0,0,0.147303,7708,1,0,165,12980,190,59,3068,12023,212
FORMULA StigmergyElection-PT-08a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-29 19:57:13] [INFO ] Flatten gal took : 26 ms
[2024-05-29 19:57:13] [INFO ] Flatten gal took : 26 ms
Total runtime 673934 ms.
BK_STOP 1717012633391
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="StigmergyElection-PT-08a"
export BK_EXAMINATION="CTLCardinality"
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 StigmergyElection-PT-08a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532100345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08a.tgz
mv StigmergyElection-PT-08a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;