About the Execution of ITS-Tools for Philosophers-COL-000500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5519.123 | 2343666.00 | 4365392.00 | 10410.40 | TFFFTFTTFFTFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016400227.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-COL-000500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016400227
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 5.5K Apr 29 12:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 29 12:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 11:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 11:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 31K May 10 09:34 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 Philosophers-COL-000500-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000500-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652805466969
Running Version 202205111006
[2022-05-17 16:37:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 16:37:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:37:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 16:37:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 16:37:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 559 ms
[2022-05-17 16:37:48] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA Philosophers-COL-000500-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 16:37:48] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2022-05-17 16:37:48] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-COL-000500-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10042 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=313 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 16:37:49] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-17 16:37:49] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 16:37:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 16:37:49] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA Philosophers-COL-000500-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 16:37:49] [INFO ] Flatten gal took : 13 ms
[2022-05-17 16:37:49] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 500) 500) 500)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 16:37:49] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions 8000 arcs in 39 ms.
[2022-05-17 16:37:49] [INFO ] Unfolded 9 HLPN properties in 3 ms.
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 28 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:37:49] [INFO ] Computed 1000 place invariants in 34 ms
[2022-05-17 16:37:50] [INFO ] Implicit Places using invariants in 575 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:37:50] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 16:37:51] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:37:51] [INFO ] Computed 1000 place invariants in 19 ms
[2022-05-17 16:37:54] [INFO ] Dead Transitions using invariants and state equation in 2731 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2022-05-17 16:37:54] [INFO ] Flatten gal took : 182 ms
[2022-05-17 16:37:54] [INFO ] Flatten gal took : 164 ms
[2022-05-17 16:37:55] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1933 ms. (steps per millisecond=5 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 722 ms. (steps per millisecond=13 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:38:00] [INFO ] Computed 1000 place invariants in 15 ms
[2022-05-17 16:38:01] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 16:38:02] [INFO ] [Nat]Absence check using 1000 positive place invariants in 180 ms returned sat
[2022-05-17 16:38:03] [INFO ] After 1313ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-05-17 16:38:04] [INFO ] After 2025ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 359 ms.
[2022-05-17 16:38:05] [INFO ] After 3487ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 4 properties in 81 ms. (steps per millisecond=6 )
Parikh walk visited 4 properties in 88 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 124 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:38:05] [INFO ] Computed 1000 place invariants in 16 ms
[2022-05-17 16:38:06] [INFO ] Implicit Places using invariants in 901 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:38:06] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 16:38:08] [INFO ] Implicit Places using invariants and state equation in 2306 ms returned []
Implicit Place search using SMT with State Equation took 3209 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:38:08] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 16:38:11] [INFO ] Dead Transitions using invariants and state equation in 2940 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s1500 s1501 s1502 s1503 s1504 s1505 s1506 s1507 s1508 s1509 s1510 s1511 s1512 s1513 s1514 s1515 s1516 s1517 s1518 s1519 s1520 s1521 s1522 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 98760 steps with 49380 reset in 10001 ms.
Product exploration timeout after 96640 steps with 48320 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-COL-000500-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000500-LTLCardinality-00 finished in 41842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))&&F(p1)))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 76 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:38:47] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 16:38:48] [INFO ] Implicit Places using invariants in 966 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:38:48] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 16:38:50] [INFO ] Implicit Places using invariants and state equation in 2253 ms returned []
Implicit Place search using SMT with State Equation took 3222 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:38:50] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 16:38:53] [INFO ] Dead Transitions using invariants and state equation in 2667 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 (ADD s1500 s1501 s1502 s1503 s1504 s1505 s1506 s1507 s1508 s1509 s1510 s1511 s1512 s1513 s1514 s1515 s1516 s1517 s1518 s1519 s1520 s1521 s1522 s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 83270 steps with 18357 reset in 10002 ms.
Product exploration timeout after 80870 steps with 17945 reset in 10006 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:40:04] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 16:40:19] [INFO ] [Real]Absence check using 1000 positive place invariants in 9644 ms returned unknown
Could not prove EG (NOT p1)
Support contains 500 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 500
Deduced a syphon composed of 500 places in 0 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2000 transition count 2000
Applied a total of 1000 rules in 266 ms. Remains 2000 /2500 variables (removed 500) and now considering 2000/2500 (removed 500) transitions.
// Phase 1: matrix 2000 rows 2000 cols
[2022-05-17 16:40:19] [INFO ] Computed 1000 place invariants in 2 ms
[2022-05-17 16:40:20] [INFO ] Implicit Places using invariants in 902 ms returned []
// Phase 1: matrix 2000 rows 2000 cols
[2022-05-17 16:40:20] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:40:23] [INFO ] Implicit Places using invariants and state equation in 2568 ms returned []
Implicit Place search using SMT with State Equation took 3476 ms to find 0 implicit places.
[2022-05-17 16:40:23] [INFO ] Redundant transitions in 101 ms returned []
// Phase 1: matrix 2000 rows 2000 cols
[2022-05-17 16:40:23] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:40:24] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2000/2500 places, 2000/2500 transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/2500 places, 2000/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
// Phase 1: matrix 2000 rows 2000 cols
[2022-05-17 16:40:49] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 16:41:03] [INFO ] [Real]Absence check using 1000 positive place invariants in 9976 ms returned sat
[2022-05-17 16:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:41:04] [INFO ] [Real]Absence check using state equation in 726 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration timeout after 80100 steps with 11294 reset in 10001 ms.
Stack based approach found an accepted trace after 262 steps with 39 reset with depth 2 and stack size 2 in 34 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-01 finished in 147415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(G((p0||F(X(F(p1))))))))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 42 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:14] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:41:15] [INFO ] Implicit Places using invariants in 407 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:15] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 16:41:16] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
[2022-05-17 16:41:16] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:16] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 16:41:18] [INFO ] Dead Transitions using invariants and state equation in 2555 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 95030 steps with 45 reset in 10001 ms.
Stack based approach found an accepted trace after 18329 steps with 11 reset with depth 11878 and stack size 4932 in 2262 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-02 finished in 16769 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 15 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:31] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 16:41:31] [INFO ] Implicit Places using invariants in 616 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:31] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:41:33] [INFO ] Implicit Places using invariants and state equation in 1671 ms returned []
Implicit Place search using SMT with State Equation took 2289 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:33] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:41:36] [INFO ] Dead Transitions using invariants and state equation in 2547 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-03 finished in 4964 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(X(X(p0)))&&p1))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 17 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:36] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:41:37] [INFO ] Implicit Places using invariants in 706 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:37] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:41:38] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 2528 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:38] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:41:41] [INFO ] Dead Transitions using invariants and state equation in 2640 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LEQ (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 5652 ms.
Stack based approach found an accepted trace after 10064 steps with 0 reset with depth 10065 and stack size 10065 in 704 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-05 finished in 11709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 61 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:48] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:41:49] [INFO ] Implicit Places using invariants in 921 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:49] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:41:51] [INFO ] Implicit Places using invariants and state equation in 2150 ms returned []
Implicit Place search using SMT with State Equation took 3072 ms to find 0 implicit places.
[2022-05-17 16:41:51] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:41:51] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:41:53] [INFO ] Dead Transitions using invariants and state equation in 2617 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s102...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 60560 steps with 259 reset in 10001 ms.
Product exploration timeout after 58770 steps with 223 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 718 steps, including 0 resets, run visited all 2 properties in 86 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:42:53] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 16:43:08] [INFO ] [Real]Absence check using 1000 positive place invariants in 1293 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 48 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:43:08] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 16:43:09] [INFO ] Implicit Places using invariants in 927 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:43:09] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:43:11] [INFO ] Implicit Places using invariants and state equation in 2106 ms returned []
Implicit Place search using SMT with State Equation took 3034 ms to find 0 implicit places.
[2022-05-17 16:43:11] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:43:11] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 16:43:14] [INFO ] Dead Transitions using invariants and state equation in 2689 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 758 steps, including 0 resets, run visited all 2 properties in 93 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:43:54] [INFO ] Computed 1000 place invariants in 6 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:518)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 16:44:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 76440 steps with 313 reset in 10002 ms.
Product exploration timeout after 74500 steps with 294 reset in 10002 ms.
Built C files in :
/tmp/ltsmin5722295906127743136
[2022-05-17 16:44:29] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:44:29] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5722295906127743136
Running compilation step : cd /tmp/ltsmin5722295906127743136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5722295906127743136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5722295906127743136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 45 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:44:32] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:44:33] [INFO ] Implicit Places using invariants in 1028 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:44:33] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:44:36] [INFO ] Implicit Places using invariants and state equation in 2268 ms returned []
Implicit Place search using SMT with State Equation took 3297 ms to find 0 implicit places.
[2022-05-17 16:44:36] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:44:36] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 16:44:38] [INFO ] Dead Transitions using invariants and state equation in 2641 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin15716412795913126823
[2022-05-17 16:44:38] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:44:38] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15716412795913126823
Running compilation step : cd /tmp/ltsmin15716412795913126823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15716412795913126823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15716412795913126823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 16:44:42] [INFO ] Flatten gal took : 192 ms
[2022-05-17 16:44:42] [INFO ] Flatten gal took : 188 ms
[2022-05-17 16:44:42] [INFO ] Time to serialize gal into /tmp/LTL15225644175021153752.gal : 33 ms
[2022-05-17 16:44:42] [INFO ] Time to serialize properties into /tmp/LTL3367971024008256205.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15225644175021153752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3367971024008256205.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1522564...267
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((((Catch1_0+Catch1_1)+(Catch1_2+Catch1_3))+((Catch1_4+Catch1_5)+(Catch1_6+Catch1_7)))+(((Catch1_8+Catch1_9)+(Catch1_10+C...18714
Formula 0 simplified : !F("((((((((((Catch1_0+Catch1_1)+(Catch1_2+Catch1_3))+((Catch1_4+Catch1_5)+(Catch1_6+Catch1_7)))+(((Catch1_8+Catch1_9)+(Catch1_10+Ca...18705
Detected timeout of ITS tools.
[2022-05-17 16:44:57] [INFO ] Flatten gal took : 96 ms
[2022-05-17 16:44:57] [INFO ] Applying decomposition
[2022-05-17 16:44:57] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9350576568736353134.txt' '-o' '/tmp/graph9350576568736353134.bin' '-w' '/tmp/graph9350576568736353134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9350576568736353134.bin' '-l' '-1' '-v' '-w' '/tmp/graph9350576568736353134.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:44:59] [INFO ] Decomposing Gal with order
[2022-05-17 16:44:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:45:01] [INFO ] Removed a total of 956 redundant transitions.
[2022-05-17 16:45:02] [INFO ] Flatten gal took : 2005 ms
[2022-05-17 16:45:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 49 ms.
[2022-05-17 16:45:04] [INFO ] Time to serialize gal into /tmp/LTL2791221334932998730.gal : 67 ms
[2022-05-17 16:45:04] [INFO ] Time to serialize properties into /tmp/LTL2674429152379478593.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2791221334932998730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2674429152379478593.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2791221...266
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((((gu211.Catch1_0+gu211.Catch1_1)+(gu211.Catch1_2+gu211.Catch1_3))+((gu211.Catch1_4+gu211.Catch1_5)+(gu211.Catch1_6+gu21...26714
Formula 0 simplified : !F("((((((((((gu211.Catch1_0+gu211.Catch1_1)+(gu211.Catch1_2+gu211.Catch1_3))+((gu211.Catch1_4+gu211.Catch1_5)+(gu211.Catch1_6+gu211...26705
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12835986786589722637
[2022-05-17 16:45:19] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12835986786589722637
Running compilation step : cd /tmp/ltsmin12835986786589722637;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12835986786589722637;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12835986786589722637;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-COL-000500-LTLCardinality-08 finished in 214069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(p1)&&(X(p2)||p1))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 14 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:45:22] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:45:22] [INFO ] Implicit Places using invariants in 751 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:45:22] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:45:24] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2648 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:45:24] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 16:45:27] [INFO ] Dead Transitions using invariants and state equation in 2601 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(LEQ 3 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 4082 ms.
Product exploration explored 100000 steps with 12 reset in 4274 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 493 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 852 ms. (steps per millisecond=11 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1011 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:48:09] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 16:48:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 172 ms returned sat
[2022-05-17 16:48:10] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 16:48:10] [INFO ] [Nat]Absence check using 1000 positive place invariants in 175 ms returned sat
[2022-05-17 16:48:14] [INFO ] After 2614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 16:48:15] [INFO ] After 3893ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1141 ms.
[2022-05-17 16:48:16] [INFO ] After 6108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 498 steps, including 0 resets, run visited all 1 properties in 39 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 149 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 597 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:48:17] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:48:32] [INFO ] [Real]Absence check using 1000 positive place invariants in 3622 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 18 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:48:32] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 16:48:33] [INFO ] Implicit Places using invariants in 630 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:48:33] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:48:35] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:48:35] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 16:48:37] [INFO ] Dead Transitions using invariants and state equation in 2648 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 432 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=11 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1005 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:52:42] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 16:52:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 177 ms returned sat
[2022-05-17 16:52:43] [INFO ] After 588ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 16:52:43] [INFO ] [Nat]Absence check using 1000 positive place invariants in 191 ms returned sat
[2022-05-17 16:52:46] [INFO ] After 2642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 16:52:48] [INFO ] After 3898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1148 ms.
[2022-05-17 16:52:49] [INFO ] After 6113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 498 steps, including 0 resets, run visited all 1 properties in 41 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 156 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 503 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:52:50] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 16:53:05] [INFO ] [Real]Absence check using 1000 positive place invariants in 3359 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 15 reset in 4218 ms.
Product exploration explored 100000 steps with 7 reset in 4379 ms.
Built C files in :
/tmp/ltsmin14155873521308238807
[2022-05-17 16:53:14] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14155873521308238807
Running compilation step : cd /tmp/ltsmin14155873521308238807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14155873521308238807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14155873521308238807;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 8 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:53:17] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:53:17] [INFO ] Implicit Places using invariants in 713 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:53:17] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:53:19] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 2473 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:53:19] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:53:22] [INFO ] Dead Transitions using invariants and state equation in 2708 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin11745084306013577193
[2022-05-17 16:53:22] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11745084306013577193
Running compilation step : cd /tmp/ltsmin11745084306013577193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11745084306013577193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11745084306013577193;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 16:53:25] [INFO ] Flatten gal took : 77 ms
[2022-05-17 16:53:25] [INFO ] Flatten gal took : 88 ms
[2022-05-17 16:53:25] [INFO ] Time to serialize gal into /tmp/LTL3716777408432904244.gal : 8 ms
[2022-05-17 16:53:25] [INFO ] Time to serialize properties into /tmp/LTL212475063071690118.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3716777408432904244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL212475063071690118.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3716777...265
Read 1 LTL properties
Checking formula 0 : !((F(((G("((((((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9)+(Fork_10+Fork_11))+((Fork_12+...46686
Formula 0 simplified : !F(G"((((((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9)+(Fork_10+Fork_11))+((Fork_12+For...46671
Detected timeout of ITS tools.
[2022-05-17 16:53:40] [INFO ] Flatten gal took : 74 ms
[2022-05-17 16:53:40] [INFO ] Applying decomposition
[2022-05-17 16:53:40] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18160092107872198896.txt' '-o' '/tmp/graph18160092107872198896.bin' '-w' '/tmp/graph18160092107872198896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18160092107872198896.bin' '-l' '-1' '-v' '-w' '/tmp/graph18160092107872198896.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:53:44] [INFO ] Decomposing Gal with order
[2022-05-17 16:53:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:53:48] [INFO ] Removed a total of 1500 redundant transitions.
[2022-05-17 16:53:48] [INFO ] Flatten gal took : 3940 ms
[2022-05-17 16:53:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2022-05-17 16:53:49] [INFO ] Time to serialize gal into /tmp/LTL6637782895310571159.gal : 16 ms
[2022-05-17 16:53:49] [INFO ] Time to serialize properties into /tmp/LTL11691417136047558137.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6637782895310571159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11691417136047558137.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6637782...267
Read 1 LTL properties
Checking formula 0 : !((F(((G("((((((((((gu1.Fork_0+gu1.Fork_1)+(gu1.Fork_2+gu1.Fork_3))+((gu1.Fork_4+gu1.Fork_5)+(gu1.Fork_6+gu1.Fork_7)))+(((gu1.Fork_8+g...74686
Formula 0 simplified : !F(G"((((((((((gu1.Fork_0+gu1.Fork_1)+(gu1.Fork_2+gu1.Fork_3))+((gu1.Fork_4+gu1.Fork_5)+(gu1.Fork_6+gu1.Fork_7)))+(((gu1.Fork_8+gu1....74671
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11204633578547857872
[2022-05-17 16:54:04] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11204633578547857872
Running compilation step : cd /tmp/ltsmin11204633578547857872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11204633578547857872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11204633578547857872;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-COL-000500-LTLCardinality-09 finished in 525531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 176 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:07] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:54:08] [INFO ] Implicit Places using invariants in 1118 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:08] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 16:54:11] [INFO ] Implicit Places using invariants and state equation in 2439 ms returned []
Implicit Place search using SMT with State Equation took 3559 ms to find 0 implicit places.
[2022-05-17 16:54:11] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:11] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:54:14] [INFO ] Dead Transitions using invariants and state equation in 2577 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5 reset in 3112 ms.
Stack based approach found an accepted trace after 4193 steps with 0 reset with depth 4194 and stack size 4194 in 204 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-12 finished in 9793 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 50 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:17] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 16:54:18] [INFO ] Implicit Places using invariants in 904 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:18] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:54:20] [INFO ] Implicit Places using invariants and state equation in 2097 ms returned []
Implicit Place search using SMT with State Equation took 3002 ms to find 0 implicit places.
[2022-05-17 16:54:20] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:54:20] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:54:23] [INFO ] Dead Transitions using invariants and state equation in 2666 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 75440 steps with 166 reset in 10001 ms.
Product exploration timeout after 73580 steps with 161 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 454 steps, including 0 resets, run visited all 1 properties in 63 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:55:25] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:55:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 2146 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 45 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:55:40] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 16:55:41] [INFO ] Implicit Places using invariants in 850 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:55:41] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:55:43] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 2954 ms to find 0 implicit places.
[2022-05-17 16:55:43] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:55:43] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 16:55:46] [INFO ] Dead Transitions using invariants and state equation in 2686 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 473 steps, including 0 resets, run visited all 1 properties in 63 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:56:29] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 16:56:44] [INFO ] [Real]Absence check using 1000 positive place invariants in 1958 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration timeout after 75730 steps with 165 reset in 10001 ms.
Stack based approach found an accepted trace after 6554 steps with 13 reset with depth 464 and stack size 464 in 881 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000500-LTLCardinality-15 finished in 157632 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(p1)&&(X(p2)||p1))))'
Found a CL insensitive property : Philosophers-COL-000500-LTLCardinality-09
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 25 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:56:55] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 16:56:56] [INFO ] Implicit Places using invariants in 627 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:56:56] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 16:56:57] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 2331 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:56:57] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 16:57:00] [INFO ] Dead Transitions using invariants and state equation in 2702 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Running random walk in product with property : Philosophers-COL-000500-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(LEQ 3 (ADD s500 s501 s502 s503 s504 s505 s506 s507 s508 s509 s510 s511 s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 14 reset in 4185 ms.
Product exploration explored 100000 steps with 14 reset in 4354 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 469 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1027 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 16:59:55] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 16:59:56] [INFO ] [Real]Absence check using 1000 positive place invariants in 176 ms returned sat
[2022-05-17 16:59:56] [INFO ] After 581ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 16:59:57] [INFO ] [Nat]Absence check using 1000 positive place invariants in 192 ms returned sat
[2022-05-17 17:00:00] [INFO ] After 2632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 17:00:01] [INFO ] After 3901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1174 ms.
[2022-05-17 17:00:03] [INFO ] After 6153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 498 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 153 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 466 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 17:00:04] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 17:00:19] [INFO ] [Real]Absence check using 1000 positive place invariants in 3351 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 14 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 17:00:19] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 17:00:19] [INFO ] Implicit Places using invariants in 648 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 17:00:19] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 17:00:21] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 17:00:21] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 17:00:24] [INFO ] Dead Transitions using invariants and state equation in 2729 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 512 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 922 ms. (steps per millisecond=10 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1053 ms. (steps per millisecond=9 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 17:04:43] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 17:04:44] [INFO ] [Real]Absence check using 1000 positive place invariants in 178 ms returned sat
[2022-05-17 17:04:44] [INFO ] After 596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 17:04:45] [INFO ] [Nat]Absence check using 1000 positive place invariants in 187 ms returned sat
[2022-05-17 17:04:48] [INFO ] After 2665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 17:04:49] [INFO ] After 3943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1140 ms.
[2022-05-17 17:04:50] [INFO ] After 6214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 498 steps, including 0 resets, run visited all 1 properties in 39 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 152 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 11 factoid took 546 ms. Reduced automaton from 4 states, 13 edges and 3 AP to 4 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 17:04:51] [INFO ] Computed 1000 place invariants in 9 ms
[2022-05-17 17:05:06] [INFO ] [Real]Absence check using 1000 positive place invariants in 3459 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 9 reset in 4277 ms.
Product exploration explored 100000 steps with 12 reset in 4503 ms.
Built C files in :
/tmp/ltsmin912082848633917421
[2022-05-17 17:05:16] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin912082848633917421
Running compilation step : cd /tmp/ltsmin912082848633917421;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin912082848633917421;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin912082848633917421;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 17 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 17:05:19] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 17:05:19] [INFO ] Implicit Places using invariants in 639 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 17:05:19] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 17:05:21] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2382 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 17:05:21] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 17:05:24] [INFO ] Dead Transitions using invariants and state equation in 2663 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin6013604060931112074
[2022-05-17 17:05:24] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6013604060931112074
Running compilation step : cd /tmp/ltsmin6013604060931112074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6013604060931112074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6013604060931112074;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 17:05:27] [INFO ] Flatten gal took : 67 ms
[2022-05-17 17:05:27] [INFO ] Flatten gal took : 67 ms
[2022-05-17 17:05:27] [INFO ] Time to serialize gal into /tmp/LTL10513302703185665835.gal : 8 ms
[2022-05-17 17:05:27] [INFO ] Time to serialize properties into /tmp/LTL12588116300475261224.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10513302703185665835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12588116300475261224.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1051330...268
Read 1 LTL properties
Checking formula 0 : !((F(((G("((((((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9)+(Fork_10+Fork_11))+((Fork_12+...46686
Formula 0 simplified : !F(G"((((((((((Fork_0+Fork_1)+(Fork_2+Fork_3))+((Fork_4+Fork_5)+(Fork_6+Fork_7)))+(((Fork_8+Fork_9)+(Fork_10+Fork_11))+((Fork_12+For...46671
Detected timeout of ITS tools.
[2022-05-17 17:05:42] [INFO ] Flatten gal took : 67 ms
[2022-05-17 17:05:42] [INFO ] Applying decomposition
[2022-05-17 17:05:42] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14146181767761834754.txt' '-o' '/tmp/graph14146181767761834754.bin' '-w' '/tmp/graph14146181767761834754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14146181767761834754.bin' '-l' '-1' '-v' '-w' '/tmp/graph14146181767761834754.weights' '-q' '0' '-e' '0.001'
[2022-05-17 17:05:45] [INFO ] Decomposing Gal with order
[2022-05-17 17:05:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 17:05:49] [INFO ] Removed a total of 1500 redundant transitions.
[2022-05-17 17:05:49] [INFO ] Flatten gal took : 3846 ms
[2022-05-17 17:05:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-17 17:05:50] [INFO ] Time to serialize gal into /tmp/LTL17788631120966945503.gal : 14 ms
[2022-05-17 17:05:50] [INFO ] Time to serialize properties into /tmp/LTL17885702668092577377.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17788631120966945503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17885702668092577377.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1778863...268
Read 1 LTL properties
Checking formula 0 : !((F(((G("((((((((((gu1.Fork_0+gu1.Fork_1)+(gu1.Fork_2+gu1.Fork_3))+((gu1.Fork_4+gu1.Fork_5)+(gu1.Fork_6+gu1.Fork_7)))+(((gu1.Fork_8+g...74686
Formula 0 simplified : !F(G"((((((((((gu1.Fork_0+gu1.Fork_1)+(gu1.Fork_2+gu1.Fork_3))+((gu1.Fork_4+gu1.Fork_5)+(gu1.Fork_6+gu1.Fork_7)))+(((gu1.Fork_8+gu1....74671
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7000777563241393939
[2022-05-17 17:06:05] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7000777563241393939
Running compilation step : cd /tmp/ltsmin7000777563241393939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7000777563241393939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7000777563241393939;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Philosophers-COL-000500-LTLCardinality-09 finished in 553044 ms.
[2022-05-17 17:06:08] [INFO ] Flatten gal took : 67 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3569113648743412
[2022-05-17 17:06:08] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2022-05-17 17:06:08] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3569113648743412
Running compilation step : cd /tmp/ltsmin3569113648743412;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 17:06:08] [INFO ] Applying decomposition
[2022-05-17 17:06:08] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6873637868024766135.txt' '-o' '/tmp/graph6873637868024766135.bin' '-w' '/tmp/graph6873637868024766135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6873637868024766135.bin' '-l' '-1' '-v' '-w' '/tmp/graph6873637868024766135.weights' '-q' '0' '-e' '0.001'
[2022-05-17 17:06:13] [INFO ] Decomposing Gal with order
[2022-05-17 17:06:13] [INFO ] Rewriting arrays to variables to allow decomposition.
Compilation finished in 6208 ms.
Running link step : cd /tmp/ltsmin3569113648743412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin3569113648743412;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
[2022-05-17 17:06:20] [INFO ] Removed a total of 2500 redundant transitions.
[2022-05-17 17:06:20] [INFO ] Flatten gal took : 6854 ms
[2022-05-17 17:06:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 42 ms.
[2022-05-17 17:06:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality16125450837282262437.gal : 36 ms
[2022-05-17 17:06:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality9946910973532012666.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16125450837282262437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9946910973532012666.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !((F(("((((((((((gu2.Catch1_0+gu2.Catch1_1)+(gu2.Catch1_2+gu2.Catch1_3))+((gu2.Catch1_4+gu2.Catch1_5)+(gu2.Catch1_6+gu2.Catch1_7)))+((...26714
Formula 0 simplified : !F("((((((((((gu2.Catch1_0+gu2.Catch1_1)+(gu2.Catch1_2+gu2.Catch1_3))+((gu2.Catch1_4+gu2.Catch1_5)+(gu2.Catch1_6+gu2.Catch1_7)))+(((...26705
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
LTSmin run took 631117 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin3569113648743412;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp2==true))&&X((LTLAPp3==true))&&(X((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
LTSmin run took 4670 ms.
FORMULA Philosophers-COL-000500-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2342388 ms.
BK_STOP 1652807810635
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="Philosophers-COL-000500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000500, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-165277016400227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000500.tgz
mv Philosophers-COL-000500 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;