About the Execution of ITS-Tools for PolyORBNT-COL-S10J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.319 | 3600000.00 | 13070046.00 | 12244.70 | FTFFFFFTTFF?F?TF | 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-165277017200795.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 PolyORBNT-COL-S10J60, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017200795
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 6.9K Apr 30 04:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 04:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 30 03:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 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 94K 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 PolyORBNT-COL-S10J60-LTLCardinality-00
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-01
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-02
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-03
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-04
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-05
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-06
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-07
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-08
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-09
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S10J60-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652950509586
Running Version 202205111006
[2022-05-19 08:55:10] [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-19 08:55:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 08:55:10] [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-19 08:55:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-19 08:55:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 647 ms
[2022-05-19 08:55:11] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 08:55:11] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2022-05-19 08:55:11] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10002 steps, including 571 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 18) seen :9
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1008 steps, including 21 resets, run finished after 19 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
// Phase 1: matrix 38 rows 48 cols
[2022-05-19 08:55:12] [INFO ] Computed 13 place invariants in 9 ms
[2022-05-19 08:55:12] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-19 08:55:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-19 08:55:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-19 08:55:12] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2022-05-19 08:55:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:55:12] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :1
[2022-05-19 08:55:12] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-19 08:55:12] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 22 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2022-05-19 08:55:12] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-19 08:55:12] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10000 steps, including 735 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 414 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 321 steps, run visited all 1 properties in 20 ms. (steps per millisecond=16 )
Probabilistic random walk after 321 steps, saw 141 distinct states, run finished after 20 ms. (steps per millisecond=16 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 08:55:12] [INFO ] Flatten gal took : 24 ms
[2022-05-19 08:55:12] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-19 08:55:13] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 264 ms.
[2022-05-19 08:55:13] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 29 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 778 out of 1234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Applied a total of 10 rules in 93 ms. Remains 1224 /1234 variables (removed 10) and now considering 2810/2810 (removed 0) transitions.
[2022-05-19 08:55:13] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1224 cols
[2022-05-19 08:55:13] [INFO ] Computed 142 place invariants in 205 ms
[2022-05-19 08:55:15] [INFO ] Dead Transitions using invariants and state equation in 2154 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2022-05-19 08:55:15] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 08:55:15] [INFO ] Computed 142 place invariants in 96 ms
[2022-05-19 08:55:16] [INFO ] Implicit Places using invariants in 812 ms returned []
[2022-05-19 08:55:16] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 08:55:16] [INFO ] Computed 142 place invariants in 78 ms
[2022-05-19 08:55:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:55:20] [INFO ] Implicit Places using invariants and state equation in 4258 ms returned []
Implicit Place search using SMT with State Equation took 5072 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1224/1234 places, 2195/2810 transitions.
Applied a total of 0 rules in 31 ms. Remains 1224 /1224 variables (removed 0) and now considering 2195/2195 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1224/1234 places, 2195/2810 transitions.
Support contains 778 out of 1224 places after structural reductions.
[2022-05-19 08:55:20] [INFO ] Flatten gal took : 220 ms
[2022-05-19 08:55:21] [INFO ] Flatten gal took : 158 ms
[2022-05-19 08:55:21] [INFO ] Input system was already deterministic with 2195 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-05-19 08:55:22] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 08:55:22] [INFO ] Computed 142 place invariants in 48 ms
[2022-05-19 08:55:22] [INFO ] [Real]Absence check using 136 positive place invariants in 42 ms returned sat
[2022-05-19 08:55:22] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 25 ms returned sat
[2022-05-19 08:55:22] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-19 08:55:23] [INFO ] [Nat]Absence check using 136 positive place invariants in 43 ms returned sat
[2022-05-19 08:55:23] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 25 ms returned sat
[2022-05-19 08:55:36] [INFO ] After 13373ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2022-05-19 08:55:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:55:47] [INFO ] After 11106ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2022-05-19 08:55:47] [INFO ] After 11110ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-19 08:55:47] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 696 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2129
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 1093 transition count 2064
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 1092 transition count 2063
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 1092 transition count 2063
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 1090 transition count 2061
Applied a total of 268 rules in 276 ms. Remains 1090 /1224 variables (removed 134) and now considering 2061/2195 (removed 134) transitions.
[2022-05-19 08:55:48] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:55:48] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 08:55:49] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1224 places, 2061/2195 transitions.
Incomplete random walk after 10000 steps, including 719 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 08:55:49] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:55:49] [INFO ] Computed 142 place invariants in 73 ms
[2022-05-19 08:55:49] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:55:49] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2022-05-19 08:55:49] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2022-05-19 08:55:51] [INFO ] After 2193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:55:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:55:54] [INFO ] After 2350ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 08:55:54] [INFO ] After 2740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 267 ms.
[2022-05-19 08:55:54] [INFO ] After 5405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 87 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 10000 steps, including 716 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 269222 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269222 steps, saw 44346 distinct states, run finished after 3002 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 08:55:58] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:55:58] [INFO ] Computed 142 place invariants in 45 ms
[2022-05-19 08:55:58] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:55:58] [INFO ] [Nat]Absence check using 135 positive place invariants in 31 ms returned sat
[2022-05-19 08:55:58] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2022-05-19 08:56:00] [INFO ] After 2176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:56:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:56:03] [INFO ] After 2356ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 08:56:03] [INFO ] After 2740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 240 ms.
[2022-05-19 08:56:03] [INFO ] After 5372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 69 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 63 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2022-05-19 08:56:03] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:56:03] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 08:56:04] [INFO ] Implicit Places using invariants in 879 ms returned []
[2022-05-19 08:56:04] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:56:04] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 08:56:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:56:13] [INFO ] Implicit Places using invariants and state equation in 9140 ms returned []
Implicit Place search using SMT with State Equation took 10026 ms to find 0 implicit places.
[2022-05-19 08:56:14] [INFO ] Redundant transitions in 118 ms returned []
[2022-05-19 08:56:14] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:56:14] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 08:56:15] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Applied a total of 13 rules in 173 ms. Remains 1088 /1090 variables (removed 2) and now considering 2050/2061 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2050 rows 1088 cols
[2022-05-19 08:56:15] [INFO ] Computed 142 place invariants in 55 ms
[2022-05-19 08:56:15] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:56:15] [INFO ] [Nat]Absence check using 135 positive place invariants in 34 ms returned sat
[2022-05-19 08:56:15] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 32 ms returned sat
[2022-05-19 08:56:17] [INFO ] After 1932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:56:26] [INFO ] After 10967ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 08:56:26] [INFO ] After 11173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((!F(p0) U X(p1)))'
Support contains 4 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 81 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 08:56:27] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:56:27] [INFO ] Computed 142 place invariants in 52 ms
[2022-05-19 08:56:28] [INFO ] Dead Transitions using invariants and state equation in 1713 ms found 0 transitions.
[2022-05-19 08:56:28] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:56:28] [INFO ] Computed 142 place invariants in 46 ms
[2022-05-19 08:56:29] [INFO ] Implicit Places using invariants in 986 ms returned []
[2022-05-19 08:56:29] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:56:29] [INFO ] Computed 142 place invariants in 53 ms
[2022-05-19 08:56:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:56:35] [INFO ] Implicit Places using invariants and state equation in 5997 ms returned []
Implicit Place search using SMT with State Equation took 6984 ms to find 0 implicit places.
[2022-05-19 08:56:35] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:56:35] [INFO ] Computed 142 place invariants in 61 ms
[2022-05-19 08:56:37] [INFO ] Dead Transitions using invariants and state equation in 1636 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s314 s378), p1:(LEQ s188 s1017)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-00 finished in 10782 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(X(X(p0))))||X(p0))))'
Support contains 71 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 82 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 08:56:37] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:56:37] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 08:56:39] [INFO ] Dead Transitions using invariants and state equation in 1743 ms found 0 transitions.
[2022-05-19 08:56:39] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:56:39] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 08:56:40] [INFO ] Implicit Places using invariants in 973 ms returned []
[2022-05-19 08:56:40] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:56:40] [INFO ] Computed 142 place invariants in 38 ms
[2022-05-19 08:56:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:56:49] [INFO ] Implicit Places using invariants and state equation in 9423 ms returned []
Implicit Place search using SMT with State Equation took 10403 ms to find 0 implicit places.
[2022-05-19 08:56:49] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:56:50] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 08:56:51] [INFO ] Dead Transitions using invariants and state equation in 1644 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 428 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ (ADD s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s...], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 54842 steps with 3070 reset in 653 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-03 finished in 14988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!G(F(p0)) U p1))))'
Support contains 612 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Applied a total of 0 rules in 14 ms. Remains 1224 /1224 variables (removed 0) and now considering 2195/2195 (removed 0) transitions.
[2022-05-19 08:56:52] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 08:56:52] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 08:56:54] [INFO ] Dead Transitions using invariants and state equation in 1659 ms found 0 transitions.
[2022-05-19 08:56:54] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 08:56:54] [INFO ] Computed 142 place invariants in 46 ms
[2022-05-19 08:56:55] [INFO ] Implicit Places using invariants in 707 ms returned []
[2022-05-19 08:56:55] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 08:56:55] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 08:56:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:57:02] [INFO ] Implicit Places using invariants and state equation in 7035 ms returned []
Implicit Place search using SMT with State Equation took 7745 ms to find 0 implicit places.
[2022-05-19 08:57:02] [INFO ] Flow matrix only has 2186 transitions (discarded 9 similar events)
// Phase 1: matrix 2186 rows 1224 cols
[2022-05-19 08:57:02] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 08:57:03] [INFO ] Dead Transitions using invariants and state equation in 1603 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1224/1224 places, 2195/2195 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s1222 s1092), p0:(LEQ 2 (ADD s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s41...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 7314 steps with 409 reset in 208 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-06 finished in 11419 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 69 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 08:57:04] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:57:04] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 08:57:05] [INFO ] Dead Transitions using invariants and state equation in 1627 ms found 0 transitions.
[2022-05-19 08:57:05] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:57:05] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 08:57:07] [INFO ] Implicit Places using invariants in 1145 ms returned []
[2022-05-19 08:57:07] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:57:07] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 08:57:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:57:16] [INFO ] Implicit Places using invariants and state equation in 9079 ms returned []
Implicit Place search using SMT with State Equation took 10228 ms to find 0 implicit places.
[2022-05-19 08:57:16] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:57:16] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 08:57:17] [INFO ] Dead Transitions using invariants and state equation in 1622 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-07 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: 1}]], initial=2, aps=[p0:(LEQ s383 s314)], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1027 ms.
Product exploration explored 100000 steps with 33333 reset in 1042 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-07 finished in 15915 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(true U p0))'
Support contains 1 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2129
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 1093 transition count 2064
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 1092 transition count 2063
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 1092 transition count 2063
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 1090 transition count 2061
Applied a total of 268 rules in 240 ms. Remains 1090 /1224 variables (removed 134) and now considering 2061/2195 (removed 134) transitions.
[2022-05-19 08:57:20] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:57:20] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 08:57:21] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
[2022-05-19 08:57:21] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:57:21] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 08:57:22] [INFO ] Implicit Places using invariants in 890 ms returned []
[2022-05-19 08:57:22] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:57:22] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 08:57:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:57:31] [INFO ] Implicit Places using invariants and state equation in 9161 ms returned []
Implicit Place search using SMT with State Equation took 10054 ms to find 0 implicit places.
[2022-05-19 08:57:31] [INFO ] Redundant transitions in 85 ms returned []
[2022-05-19 08:57:31] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:57:31] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 08:57:32] [INFO ] Dead Transitions using invariants and state equation in 1174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1090/1224 places, 2061/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1224 places, 2061/2195 transitions.
Stuttering acceptance computed with spot in 47 ms :[true, p0]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 s1011)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 750 steps with 60 reset in 11 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-10 finished in 12753 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2129
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 1093 transition count 2064
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 1091 transition count 2062
Applied a total of 266 rules in 168 ms. Remains 1091 /1224 variables (removed 133) and now considering 2062/2195 (removed 133) transitions.
[2022-05-19 08:57:33] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:57:33] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 08:57:34] [INFO ] Dead Transitions using invariants and state equation in 1131 ms found 0 transitions.
[2022-05-19 08:57:34] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:57:34] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 08:57:35] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2022-05-19 08:57:35] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:57:35] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 08:57:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:57:42] [INFO ] Implicit Places using invariants and state equation in 6932 ms returned []
Implicit Place search using SMT with State Equation took 7994 ms to find 0 implicit places.
[2022-05-19 08:57:42] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-19 08:57:42] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:57:42] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 08:57:43] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1091/1224 places, 2062/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1224 places, 2062/2195 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-11 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:(LEQ (ADD s999 s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008) s1087)], 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 8595 reset in 1179 ms.
Product exploration explored 100000 steps with 8558 reset in 1254 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 69 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=23 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 310 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 11 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 49 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-19 08:57:46] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:57:46] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 08:57:47] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
[2022-05-19 08:57:47] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:57:47] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 08:57:48] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2022-05-19 08:57:48] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:57:48] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 08:57:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:57:55] [INFO ] Implicit Places using invariants and state equation in 6891 ms returned []
Implicit Place search using SMT with State Equation took 7942 ms to find 0 implicit places.
[2022-05-19 08:57:55] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-19 08:57:55] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:57:55] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 08:57:56] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 490 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8622 reset in 1187 ms.
Product exploration explored 100000 steps with 8635 reset in 1206 ms.
Built C files in :
/tmp/ltsmin17597300915220266683
[2022-05-19 08:58:00] [INFO ] Too many transitions (2062) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:58:00] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17597300915220266683
Running compilation step : cd /tmp/ltsmin17597300915220266683;'/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/ltsmin17597300915220266683;'/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/ltsmin17597300915220266683;'/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 11 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 49 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2022-05-19 08:58:04] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:58:04] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 08:58:05] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
[2022-05-19 08:58:05] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:58:05] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 08:58:06] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2022-05-19 08:58:06] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:58:06] [INFO ] Computed 142 place invariants in 47 ms
[2022-05-19 08:58:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:58:14] [INFO ] Implicit Places using invariants and state equation in 7866 ms returned []
Implicit Place search using SMT with State Equation took 8912 ms to find 0 implicit places.
[2022-05-19 08:58:14] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-19 08:58:14] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2022-05-19 08:58:14] [INFO ] Computed 142 place invariants in 38 ms
[2022-05-19 08:58:15] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1091/1091 places, 2062/2062 transitions.
Built C files in :
/tmp/ltsmin13165665177804732396
[2022-05-19 08:58:15] [INFO ] Too many transitions (2062) to apply POR reductions. Disabling POR matrices.
[2022-05-19 08:58:15] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13165665177804732396
Running compilation step : cd /tmp/ltsmin13165665177804732396;'/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/ltsmin13165665177804732396;'/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/ltsmin13165665177804732396;'/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-19 08:58:18] [INFO ] Flatten gal took : 113 ms
[2022-05-19 08:58:18] [INFO ] Flatten gal took : 123 ms
[2022-05-19 08:58:19] [INFO ] Time to serialize gal into /tmp/LTL12531035992697296475.gal : 23 ms
[2022-05-19 08:58:19] [INFO ] Time to serialize properties into /tmp/LTL12018022056385672703.ltl : 0 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/LTL12531035992697296475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12018022056385672703.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/LTL1253103...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((place_482_0+place_482_1)+(place_482_2+place_482_3))+((place_482_4+place_482_5)+(place_482_6+place_482_7)))+(place_482_8+p...191
Formula 0 simplified : !GF"(((((place_482_0+place_482_1)+(place_482_2+place_482_3))+((place_482_4+place_482_5)+(place_482_6+place_482_7)))+(place_482_8+pla...185
Detected timeout of ITS tools.
[2022-05-19 08:58:34] [INFO ] Flatten gal took : 103 ms
[2022-05-19 08:58:34] [INFO ] Applying decomposition
[2022-05-19 08:58:34] [INFO ] Flatten gal took : 98 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/graph15409521332174479661.txt' '-o' '/tmp/graph15409521332174479661.bin' '-w' '/tmp/graph15409521332174479661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15409521332174479661.bin' '-l' '-1' '-v' '-w' '/tmp/graph15409521332174479661.weights' '-q' '0' '-e' '0.001'
[2022-05-19 08:58:34] [INFO ] Decomposing Gal with order
[2022-05-19 08:58:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 08:58:35] [INFO ] Removed a total of 2012 redundant transitions.
[2022-05-19 08:58:35] [INFO ] Flatten gal took : 679 ms
[2022-05-19 08:58:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2631 labels/synchronizations in 170 ms.
[2022-05-19 08:58:36] [INFO ] Time to serialize gal into /tmp/LTL2480350032381238485.gal : 26 ms
[2022-05-19 08:58:36] [INFO ] Time to serialize properties into /tmp/LTL11419946555171742802.ltl : 0 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/LTL2480350032381238485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11419946555171742802.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/LTL2480350...267
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((gu22.place_482_0+gu22.place_482_1)+(gu22.place_482_2+gu22.place_482_3))+((gu22.place_482_4+gu22.place_482_5)+(gu22.place_...246
Formula 0 simplified : !GF"(((((gu22.place_482_0+gu22.place_482_1)+(gu22.place_482_2+gu22.place_482_3))+((gu22.place_482_4+gu22.place_482_5)+(gu22.place_48...240
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6228812134706669462
[2022-05-19 08:58:51] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6228812134706669462
Running compilation step : cd /tmp/ltsmin6228812134706669462;'/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/ltsmin6228812134706669462;'/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/ltsmin6228812134706669462;'/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 PolyORBNT-COL-S10J60-LTLCardinality-11 finished in 81348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0)||p1)&&p2)))'
Support contains 623 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2129
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 1093 transition count 2064
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 1092 transition count 2063
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 1092 transition count 2063
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 1090 transition count 2061
Applied a total of 268 rules in 100 ms. Remains 1090 /1224 variables (removed 134) and now considering 2061/2195 (removed 134) transitions.
[2022-05-19 08:58:54] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:58:54] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 08:58:55] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
[2022-05-19 08:58:55] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:58:55] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 08:58:56] [INFO ] Implicit Places using invariants in 657 ms returned []
[2022-05-19 08:58:56] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:58:56] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 08:58:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:59:02] [INFO ] Implicit Places using invariants and state equation in 6307 ms returned []
Implicit Place search using SMT with State Equation took 6968 ms to find 0 implicit places.
[2022-05-19 08:59:02] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-19 08:59:02] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:59:02] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 08:59:03] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1090/1224 places, 2061/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1224 places, 2061/2195 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(OR (LEQ 2 (ADD s378 s379 s380 s381 s382 s383 s384 s385 s386 s387)) (LEQ s186 s313)), p1:(AND (GT 2 (ADD s378 s379 s380 s381 s382 s383 s384 s385 s386 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-12 finished in 9590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(F(G(!(X(p0)&&p1))))||G(p2))))'
Support contains 64 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 55 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 08:59:03] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:03] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 08:59:05] [INFO ] Dead Transitions using invariants and state equation in 1707 ms found 0 transitions.
[2022-05-19 08:59:05] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:05] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 08:59:06] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2022-05-19 08:59:06] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:06] [INFO ] Computed 142 place invariants in 58 ms
[2022-05-19 08:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:59:13] [INFO ] Implicit Places using invariants and state equation in 6625 ms returned []
Implicit Place search using SMT with State Equation took 7662 ms to find 0 implicit places.
[2022-05-19 08:59:13] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:13] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 08:59:14] [INFO ] Dead Transitions using invariants and state equation in 1661 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p2) p0 p1), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0), (AND (NOT p2) p0 p1)]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 p0), acceptance={0} source=0 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=0 dest: 4}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={1} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={1} source=4 dest: 0}, { cond=(AND p1 p2 p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s378 s186), p0:(LEQ 1 (ADD s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5599 reset in 804 ms.
Product exploration explored 100000 steps with 5605 reset in 796 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1093 ms. Reduced automaton from 5 states, 18 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 159326 steps, run timeout after 3004 ms. (steps per millisecond=53 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 159326 steps, saw 48055 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :2
Running SMT prover for 2 properties.
[2022-05-19 08:59:21] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:21] [INFO ] Computed 142 place invariants in 45 ms
[2022-05-19 08:59:21] [INFO ] [Real]Absence check using 136 positive place invariants in 40 ms returned sat
[2022-05-19 08:59:21] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 26 ms returned sat
[2022-05-19 08:59:22] [INFO ] After 908ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2022-05-19 08:59:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:59:22] [INFO ] After 160ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :1 sat :1
[2022-05-19 08:59:23] [INFO ] After 276ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-19 08:59:23] [INFO ] After 1536ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1223 transition count 2130
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 130 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 260 place count 1093 transition count 2064
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 266 place count 1090 transition count 2061
Applied a total of 266 rules in 105 ms. Remains 1090 /1223 variables (removed 133) and now considering 2061/2194 (removed 133) transitions.
[2022-05-19 08:59:23] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:59:23] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 08:59:24] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1223 places, 2061/2194 transitions.
Finished random walk after 131 steps, including 7 resets, run visited all 1 properties in 2 ms. (steps per millisecond=65 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2))]
Knowledge based reduction with 27 factoid took 1453 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 142 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 139 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Support contains 64 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 28 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2022-05-19 08:59:26] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:26] [INFO ] Computed 142 place invariants in 45 ms
[2022-05-19 08:59:27] [INFO ] Dead Transitions using invariants and state equation in 1588 ms found 0 transitions.
[2022-05-19 08:59:27] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:27] [INFO ] Computed 142 place invariants in 37 ms
[2022-05-19 08:59:28] [INFO ] Implicit Places using invariants in 987 ms returned []
[2022-05-19 08:59:28] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:28] [INFO ] Computed 142 place invariants in 39 ms
[2022-05-19 08:59:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:59:36] [INFO ] Implicit Places using invariants and state equation in 7479 ms returned []
Implicit Place search using SMT with State Equation took 8468 ms to find 0 implicit places.
[2022-05-19 08:59:36] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:36] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 08:59:37] [INFO ] Dead Transitions using invariants and state equation in 1624 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1223 places, 2194/2194 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 p1) p2 (NOT p0)), (X p2), true, (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 154 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 189885 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 189885 steps, saw 57063 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :2
Running SMT prover for 1 properties.
[2022-05-19 08:59:41] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:41] [INFO ] Computed 142 place invariants in 45 ms
[2022-05-19 08:59:41] [INFO ] [Real]Absence check using 136 positive place invariants in 40 ms returned sat
[2022-05-19 08:59:41] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 29 ms returned sat
[2022-05-19 08:59:41] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 08:59:42] [INFO ] [Nat]Absence check using 136 positive place invariants in 41 ms returned sat
[2022-05-19 08:59:42] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 29 ms returned sat
[2022-05-19 08:59:43] [INFO ] After 946ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 08:59:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 08:59:43] [INFO ] After 71ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 08:59:43] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-05-19 08:59:43] [INFO ] After 1434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1223 transition count 2130
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 130 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 260 place count 1093 transition count 2064
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 266 place count 1090 transition count 2061
Applied a total of 266 rules in 118 ms. Remains 1090 /1223 variables (removed 133) and now considering 2061/2194 (removed 133) transitions.
[2022-05-19 08:59:43] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 08:59:43] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 08:59:44] [INFO ] Dead Transitions using invariants and state equation in 1182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1223 places, 2061/2194 transitions.
Finished random walk after 468 steps, including 31 resets, run visited all 1 properties in 6 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), true, (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 1350 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 127 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 150 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 355 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Product exploration explored 100000 steps with 5597 reset in 737 ms.
Product exploration explored 100000 steps with 5600 reset in 779 ms.
Built C files in :
/tmp/ltsmin17699136011890761848
[2022-05-19 08:59:48] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17699136011890761848
Running compilation step : cd /tmp/ltsmin17699136011890761848;'/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/ltsmin17699136011890761848;'/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/ltsmin17699136011890761848;'/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 64 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 30 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2022-05-19 08:59:51] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:51] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 08:59:53] [INFO ] Dead Transitions using invariants and state equation in 1693 ms found 0 transitions.
[2022-05-19 08:59:53] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:53] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 08:59:54] [INFO ] Implicit Places using invariants in 961 ms returned []
[2022-05-19 08:59:54] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 08:59:54] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 08:59:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:00:01] [INFO ] Implicit Places using invariants and state equation in 7356 ms returned []
Implicit Place search using SMT with State Equation took 8320 ms to find 0 implicit places.
[2022-05-19 09:00:01] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:00:01] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:00:03] [INFO ] Dead Transitions using invariants and state equation in 1650 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1223 places, 2194/2194 transitions.
Built C files in :
/tmp/ltsmin11289382627455866394
[2022-05-19 09:00:03] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11289382627455866394
Running compilation step : cd /tmp/ltsmin11289382627455866394;'/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/ltsmin11289382627455866394;'/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/ltsmin11289382627455866394;'/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-19 09:00:06] [INFO ] Flatten gal took : 102 ms
[2022-05-19 09:00:06] [INFO ] Flatten gal took : 100 ms
[2022-05-19 09:00:06] [INFO ] Time to serialize gal into /tmp/LTL14847802778041683979.gal : 12 ms
[2022-05-19 09:00:06] [INFO ] Time to serialize properties into /tmp/LTL4769533559382666181.ltl : 1 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/LTL14847802778041683979.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4769533559382666181.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/LTL1484780...267
Read 1 LTL properties
Checking formula 0 : !((("(((((((f2_0+f2_1)+(f2_2+f2_3))+((f2_4+f2_5)+(f2_6+f2_7)))+(((f2_8+f2_9)+(f2_10+f2_11))+((f2_12+f2_13)+(f2_14+f2_15))))+((((f2_16+...1065
Formula 0 simplified : !("(((((((f2_0+f2_1)+(f2_2+f2_3))+((f2_4+f2_5)+(f2_6+f2_7)))+(((f2_8+f2_9)+(f2_10+f2_11))+((f2_12+f2_13)+(f2_14+f2_15))))+((((f2_16+...1049
Detected timeout of ITS tools.
[2022-05-19 09:00:21] [INFO ] Flatten gal took : 107 ms
[2022-05-19 09:00:21] [INFO ] Applying decomposition
[2022-05-19 09:00:21] [INFO ] Flatten gal took : 103 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/graph9361069022893291230.txt' '-o' '/tmp/graph9361069022893291230.bin' '-w' '/tmp/graph9361069022893291230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9361069022893291230.bin' '-l' '-1' '-v' '-w' '/tmp/graph9361069022893291230.weights' '-q' '0' '-e' '0.001'
[2022-05-19 09:00:21] [INFO ] Decomposing Gal with order
[2022-05-19 09:00:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:00:22] [INFO ] Removed a total of 2691 redundant transitions.
[2022-05-19 09:00:22] [INFO ] Flatten gal took : 301 ms
[2022-05-19 09:00:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 334 labels/synchronizations in 34 ms.
[2022-05-19 09:00:22] [INFO ] Time to serialize gal into /tmp/LTL3088390238808050363.gal : 13 ms
[2022-05-19 09:00:22] [INFO ] Time to serialize properties into /tmp/LTL14985572832422988329.ltl : 1 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/LTL3088390238808050363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14985572832422988329.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/LTL3088390...267
Read 1 LTL properties
Checking formula 0 : !((("(((((((gu29.f2_0+gu29.f2_1)+(gu29.f2_2+gu29.f2_3))+((gu29.f2_4+gu29.f2_5)+(gu29.f2_6+gu29.f2_7)))+(((gu29.f2_8+gu29.f2_9)+(gu29.f...1726
Formula 0 simplified : !("(((((((gu29.f2_0+gu29.f2_1)+(gu29.f2_2+gu29.f2_3))+((gu29.f2_4+gu29.f2_5)+(gu29.f2_6+gu29.f2_7)))+(((gu29.f2_8+gu29.f2_9)+(gu29.f...1710
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6036118762496074051
[2022-05-19 09:00:37] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6036118762496074051
Running compilation step : cd /tmp/ltsmin6036118762496074051;'/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/ltsmin6036118762496074051;'/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/ltsmin6036118762496074051;'/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 PolyORBNT-COL-S10J60-LTLCardinality-13 finished in 97065 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !X(!G(p1))))'
Support contains 65 out of 1224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1223 transition count 2194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1223 transition count 2194
Applied a total of 2 rules in 55 ms. Remains 1223 /1224 variables (removed 1) and now considering 2194/2195 (removed 1) transitions.
[2022-05-19 09:00:40] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:00:40] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 09:00:42] [INFO ] Dead Transitions using invariants and state equation in 1655 ms found 0 transitions.
[2022-05-19 09:00:42] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:00:42] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:00:43] [INFO ] Implicit Places using invariants in 928 ms returned []
[2022-05-19 09:00:43] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:00:43] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:00:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:00:48] [INFO ] Implicit Places using invariants and state equation in 5013 ms returned []
Implicit Place search using SMT with State Equation took 5942 ms to find 0 implicit places.
[2022-05-19 09:00:48] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:00:48] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:00:50] [INFO ] Dead Transitions using invariants and state equation in 1655 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1223/1224 places, 2194/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1224 places, 2194/2195 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (LEQ 1 s1221) (LEQ (ADD s1096 s1097 s1098 s1099 s1100 s1101 s1102 s1103 s1104 s1105 s1106 s1107 s1108 s1109 s1110 s1111 s1112 s1113 s1114 s111...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5603 reset in 927 ms.
Product exploration explored 100000 steps with 5605 reset in 968 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 p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 307 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 561 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188438 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188438 steps, saw 56647 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 09:00:55] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:00:55] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:00:55] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 09:00:56] [INFO ] [Nat]Absence check using 136 positive place invariants in 41 ms returned sat
[2022-05-19 09:00:56] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 24 ms returned sat
[2022-05-19 09:00:58] [INFO ] After 1931ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 09:00:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:01:00] [INFO ] After 2308ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 09:01:03] [INFO ] Deduced a trap composed of 24 places in 660 ms of which 2 ms to minimize.
[2022-05-19 09:01:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1201 ms
[2022-05-19 09:01:03] [INFO ] After 5739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1510 ms.
[2022-05-19 09:01:05] [INFO ] After 9409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1223 transition count 2191
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1220 transition count 2191
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 6 place count 1220 transition count 2126
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 136 place count 1155 transition count 2126
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 1152 transition count 2123
Applied a total of 142 rules in 104 ms. Remains 1152 /1223 variables (removed 71) and now considering 2123/2194 (removed 71) transitions.
[2022-05-19 09:01:05] [INFO ] Flow matrix only has 2114 transitions (discarded 9 similar events)
// Phase 1: matrix 2114 rows 1152 cols
[2022-05-19 09:01:05] [INFO ] Computed 142 place invariants in 47 ms
[2022-05-19 09:01:06] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1152/1223 places, 2123/2194 transitions.
Finished random walk after 41 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 375 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (NOT p1)]
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Applied a total of 0 rules in 31 ms. Remains 1223 /1223 variables (removed 0) and now considering 2194/2194 (removed 0) transitions.
[2022-05-19 09:01:07] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:01:07] [INFO ] Computed 142 place invariants in 44 ms
[2022-05-19 09:01:09] [INFO ] Dead Transitions using invariants and state equation in 1744 ms found 0 transitions.
[2022-05-19 09:01:09] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:01:09] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:01:10] [INFO ] Implicit Places using invariants in 992 ms returned []
[2022-05-19 09:01:10] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:01:10] [INFO ] Computed 142 place invariants in 43 ms
[2022-05-19 09:01:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:01:14] [INFO ] Implicit Places using invariants and state equation in 4528 ms returned []
Implicit Place search using SMT with State Equation took 5522 ms to find 0 implicit places.
[2022-05-19 09:01:14] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:01:14] [INFO ] Computed 142 place invariants in 40 ms
[2022-05-19 09:01:16] [INFO ] Dead Transitions using invariants and state equation in 1715 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1223/1223 places, 2194/2194 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 : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 558 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188477 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188477 steps, saw 56658 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 09:01:19] [INFO ] Flow matrix only has 2185 transitions (discarded 9 similar events)
// Phase 1: matrix 2185 rows 1223 cols
[2022-05-19 09:01:19] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 09:01:20] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 09:01:20] [INFO ] [Nat]Absence check using 136 positive place invariants in 45 ms returned sat
[2022-05-19 09:01:20] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 32 ms returned sat
[2022-05-19 09:01:22] [INFO ] After 2029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 09:01:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:01:24] [INFO ] After 2439ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 09:01:27] [INFO ] Deduced a trap composed of 24 places in 595 ms of which 5 ms to minimize.
[2022-05-19 09:01:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1127 ms
[2022-05-19 09:01:28] [INFO ] After 5874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1516 ms.
[2022-05-19 09:01:29] [INFO ] After 9665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 65 out of 1223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1223/1223 places, 2194/2194 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1223 transition count 2191
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1220 transition count 2191
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 6 place count 1220 transition count 2126
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 136 place count 1155 transition count 2126
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 1152 transition count 2123
Applied a total of 142 rules in 102 ms. Remains 1152 /1223 variables (removed 71) and now considering 2123/2194 (removed 71) transitions.
[2022-05-19 09:01:29] [INFO ] Flow matrix only has 2114 transitions (discarded 9 similar events)
// Phase 1: matrix 2114 rows 1152 cols
[2022-05-19 09:01:29] [INFO ] Computed 142 place invariants in 52 ms
[2022-05-19 09:01:31] [INFO ] Dead Transitions using invariants and state equation in 1431 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1152/1223 places, 2123/2194 transitions.
Finished random walk after 63 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 46693 steps with 2613 reset in 422 ms.
FORMULA PolyORBNT-COL-S10J60-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J60-LTLCardinality-15 finished in 51239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(F(G(!(X(p0)&&p1))))||G(p2))))'
Found a SL insensitive property : PolyORBNT-COL-S10J60-LTLCardinality-13
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p2) p0 p1), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0), (AND (NOT p2) p0 p1)]
Support contains 64 out of 1224 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1224/1224 places, 2195/2195 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1224 transition count 2130
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 1159 transition count 2129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 1158 transition count 2129
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 132 place count 1158 transition count 2064
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 262 place count 1093 transition count 2064
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 263 place count 1092 transition count 2063
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 1092 transition count 2063
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 268 place count 1090 transition count 2061
Applied a total of 268 rules in 128 ms. Remains 1090 /1224 variables (removed 134) and now considering 2061/2195 (removed 134) transitions.
[2022-05-19 09:01:32] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:01:32] [INFO ] Computed 142 place invariants in 42 ms
[2022-05-19 09:01:33] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
[2022-05-19 09:01:33] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:01:33] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 09:01:34] [INFO ] Implicit Places using invariants in 846 ms returned []
[2022-05-19 09:01:34] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:01:34] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:01:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:01:41] [INFO ] Implicit Places using invariants and state equation in 7094 ms returned []
Implicit Place search using SMT with State Equation took 7947 ms to find 0 implicit places.
[2022-05-19 09:01:41] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:01:41] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:01:42] [INFO ] Dead Transitions using invariants and state equation in 1098 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1090/1224 places, 2061/2195 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1224 places, 2061/2195 transitions.
Running random walk in product with property : PolyORBNT-COL-S10J60-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 p0), acceptance={0} source=0 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=0 dest: 4}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={1} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={1} source=4 dest: 0}, { cond=(AND p1 p2 p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s375 s186), p0:(LEQ 1 (ADD s189 s190 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7373 reset in 1125 ms.
Product exploration explored 100000 steps with 7380 reset in 1135 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1111 ms. Reduced automaton from 5 states, 18 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 717 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-19 09:01:46] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:01:46] [INFO ] Computed 142 place invariants in 41 ms
[2022-05-19 09:01:46] [INFO ] [Real]Absence check using 135 positive place invariants in 29 ms returned sat
[2022-05-19 09:01:46] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2022-05-19 09:01:47] [INFO ] After 819ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 p0))), (X (AND p2 (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p2), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2))]
Knowledge based reduction with 27 factoid took 1242 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 145 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Support contains 64 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 28 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2022-05-19 09:01:48] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:01:48] [INFO ] Computed 142 place invariants in 38 ms
[2022-05-19 09:01:49] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
[2022-05-19 09:01:49] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:01:50] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 09:01:50] [INFO ] Implicit Places using invariants in 853 ms returned []
[2022-05-19 09:01:50] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:01:50] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:01:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:01:58] [INFO ] Implicit Places using invariants and state equation in 7654 ms returned []
Implicit Place search using SMT with State Equation took 8510 ms to find 0 implicit places.
[2022-05-19 09:01:58] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:01:58] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:01:59] [INFO ] Dead Transitions using invariants and state equation in 1091 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 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 p1) p2 (NOT p0)), (X p2), true, (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 146 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Finished random walk after 321 steps, including 23 resets, run visited all 3 properties in 6 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), true, (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 127 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p2) p0), (AND p1 p0), (AND p1 (NOT p2) p0), (AND p1 p0)]
Product exploration explored 100000 steps with 7407 reset in 1094 ms.
Product exploration explored 100000 steps with 7345 reset in 1121 ms.
Built C files in :
/tmp/ltsmin11688504608396596765
[2022-05-19 09:02:02] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11688504608396596765
Running compilation step : cd /tmp/ltsmin11688504608396596765;'/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/ltsmin11688504608396596765;'/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/ltsmin11688504608396596765;'/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 64 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 22 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2022-05-19 09:02:05] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:02:06] [INFO ] Computed 142 place invariants in 34 ms
[2022-05-19 09:02:07] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
[2022-05-19 09:02:07] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:02:07] [INFO ] Computed 142 place invariants in 53 ms
[2022-05-19 09:02:07] [INFO ] Implicit Places using invariants in 881 ms returned []
[2022-05-19 09:02:07] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:02:08] [INFO ] Computed 142 place invariants in 35 ms
[2022-05-19 09:02:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 09:02:14] [INFO ] Implicit Places using invariants and state equation in 6488 ms returned []
Implicit Place search using SMT with State Equation took 7373 ms to find 0 implicit places.
[2022-05-19 09:02:14] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2022-05-19 09:02:14] [INFO ] Computed 142 place invariants in 36 ms
[2022-05-19 09:02:15] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1090/1090 places, 2061/2061 transitions.
Built C files in :
/tmp/ltsmin4323485473875872168
[2022-05-19 09:02:15] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4323485473875872168
Running compilation step : cd /tmp/ltsmin4323485473875872168;'/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/ltsmin4323485473875872168;'/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/ltsmin4323485473875872168;'/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-19 09:02:18] [INFO ] Flatten gal took : 91 ms
[2022-05-19 09:02:18] [INFO ] Flatten gal took : 111 ms
[2022-05-19 09:02:18] [INFO ] Time to serialize gal into /tmp/LTL9906172299770050932.gal : 8 ms
[2022-05-19 09:02:18] [INFO ] Time to serialize properties into /tmp/LTL9883919216089911198.ltl : 1 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/LTL9906172299770050932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9883919216089911198.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/LTL9906172...266
Read 1 LTL properties
Checking formula 0 : !((("(((((((f2_0+f2_1)+(f2_2+f2_3))+((f2_4+f2_5)+(f2_6+f2_7)))+(((f2_8+f2_9)+(f2_10+f2_11))+((f2_12+f2_13)+(f2_14+f2_15))))+((((f2_16+...1065
Formula 0 simplified : !("(((((((f2_0+f2_1)+(f2_2+f2_3))+((f2_4+f2_5)+(f2_6+f2_7)))+(((f2_8+f2_9)+(f2_10+f2_11))+((f2_12+f2_13)+(f2_14+f2_15))))+((((f2_16+...1049
Detected timeout of ITS tools.
[2022-05-19 09:02:34] [INFO ] Flatten gal took : 88 ms
[2022-05-19 09:02:34] [INFO ] Applying decomposition
[2022-05-19 09:02:34] [INFO ] Flatten gal took : 88 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/graph13770454636421662498.txt' '-o' '/tmp/graph13770454636421662498.bin' '-w' '/tmp/graph13770454636421662498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13770454636421662498.bin' '-l' '-1' '-v' '-w' '/tmp/graph13770454636421662498.weights' '-q' '0' '-e' '0.001'
[2022-05-19 09:02:34] [INFO ] Decomposing Gal with order
[2022-05-19 09:02:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:02:34] [INFO ] Removed a total of 2159 redundant transitions.
[2022-05-19 09:02:34] [INFO ] Flatten gal took : 201 ms
[2022-05-19 09:02:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 29 ms.
[2022-05-19 09:02:34] [INFO ] Time to serialize gal into /tmp/LTL14427463161159560881.gal : 11 ms
[2022-05-19 09:02:34] [INFO ] Time to serialize properties into /tmp/LTL12295596260574770552.ltl : 0 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/LTL14427463161159560881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12295596260574770552.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/LTL1442746...268
Read 1 LTL properties
Checking formula 0 : !((("(((((((gu2.f2_0+gu2.f2_1)+(gu2.f2_2+gu2.f2_3))+((gu2.f2_4+gu2.f2_5)+(gu2.f2_6+gu2.f2_7)))+(((gu2.f2_8+gu2.f2_9)+(gu2.f2_10+gu2.f2...1590
Formula 0 simplified : !("(((((((gu2.f2_0+gu2.f2_1)+(gu2.f2_2+gu2.f2_3))+((gu2.f2_4+gu2.f2_5)+(gu2.f2_6+gu2.f2_7)))+(((gu2.f2_8+gu2.f2_9)+(gu2.f2_10+gu2.f2...1574
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9599029676219895443
[2022-05-19 09:02:49] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9599029676219895443
Running compilation step : cd /tmp/ltsmin9599029676219895443;'/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/ltsmin9599029676219895443;'/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/ltsmin9599029676219895443;'/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 PolyORBNT-COL-S10J60-LTLCardinality-13 finished in 80835 ms.
[2022-05-19 09:02:53] [INFO ] Flatten gal took : 93 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13182727220823384858
[2022-05-19 09:02:53] [INFO ] Too many transitions (2195) to apply POR reductions. Disabling POR matrices.
[2022-05-19 09:02:53] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13182727220823384858
Running compilation step : cd /tmp/ltsmin13182727220823384858;'/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-19 09:02:53] [INFO ] Applying decomposition
[2022-05-19 09:02:53] [INFO ] Flatten gal took : 107 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/graph942192079630162866.txt' '-o' '/tmp/graph942192079630162866.bin' '-w' '/tmp/graph942192079630162866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph942192079630162866.bin' '-l' '-1' '-v' '-w' '/tmp/graph942192079630162866.weights' '-q' '0' '-e' '0.001'
[2022-05-19 09:02:53] [INFO ] Decomposing Gal with order
[2022-05-19 09:02:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:02:54] [INFO ] Removed a total of 2246 redundant transitions.
[2022-05-19 09:02:54] [INFO ] Flatten gal took : 502 ms
[2022-05-19 09:02:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 12 ms.
[2022-05-19 09:02:54] [INFO ] Time to serialize gal into /tmp/LTLCardinality6092224744522606662.gal : 56 ms
[2022-05-19 09:02:54] [INFO ] Time to serialize properties into /tmp/LTLCardinality16125510644952871459.ltl : 23 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/LTLCardinality6092224744522606662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16125510644952871459.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 : !((G(F("(((((gi2.gi12.gu65.place_482_0+gi2.gi12.gu65.place_482_1)+(gi2.gi12.gu65.place_482_2+gi2.gi12.gu65.place_482_3))+((gi2.gi12.gu...345
Formula 0 simplified : !GF"(((((gi2.gi12.gu65.place_482_0+gi2.gi12.gu65.place_482_1)+(gi2.gi12.gu65.place_482_2+gi2.gi12.gu65.place_482_3))+((gi2.gi12.gu65...339
Compilation finished in 4960 ms.
Running link step : cd /tmp/ltsmin13182727220823384858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13182727220823384858;'/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)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 09:25:30] [INFO ] Applying decomposition
[2022-05-19 09:25:30] [INFO ] Flatten gal took : 332 ms
[2022-05-19 09:25:30] [INFO ] Decomposing Gal with order
[2022-05-19 09:25:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 09:25:31] [INFO ] Removed a total of 9596 redundant transitions.
[2022-05-19 09:25:31] [INFO ] Flatten gal took : 537 ms
[2022-05-19 09:25:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 82 ms.
[2022-05-19 09:25:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality7904239928958620506.gal : 31 ms
[2022-05-19 09:25:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality15382963405026680948.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/LTLCardinality7904239928958620506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15382963405026680948.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 : !((G(F("(((((gThreadsSources0.place_482_0+gThreadsSources1.place_482_1)+(gThreadsSources2.place_482_2+gThreadsSources3.place_482_3))+(...377
Formula 0 simplified : !GF"(((((gThreadsSources0.place_482_0+gThreadsSources1.place_482_1)+(gThreadsSources2.place_482_2+gThreadsSources3.place_482_3))+((g...371
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin13182727220823384858;'/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)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13182727220823384858;'/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' '((LTLAPp1==true) U (X(<>([](!(X((LTLAPp1==true))&&(LTLAPp2==true)))))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 09:48:07] [INFO ] Flatten gal took : 296 ms
[2022-05-19 09:48:07] [INFO ] Input system was already deterministic with 2195 transitions.
[2022-05-19 09:48:07] [INFO ] Transformed 1224 places.
[2022-05-19 09:48:07] [INFO ] Transformed 2195 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 09:48:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality17968922438212431187.gal : 23 ms
[2022-05-19 09:48:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality5149661800187281216.ltl : 1 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/LTLCardinality17968922438212431187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5149661800187281216.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((((place_482_0+place_482_1)+(place_482_2+place_482_3))+((place_482_4+place_482_5)+(place_482_6+place_482_7)))+(place_482_8+p...191
Formula 0 simplified : !GF"(((((place_482_0+place_482_1)+(place_482_2+place_482_3))+((place_482_4+place_482_5)+(place_482_6+place_482_7)))+(place_482_8+pla...185
BK_TIME_CONFINEMENT_REACHED
--------------------
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="PolyORBNT-COL-S10J60"
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 PolyORBNT-COL-S10J60, 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-165277017200795"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 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 ;