About the Execution of ITS-Tools for JoinFreeModules-PT-0500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8653.936 | 3600000.00 | 6747309.00 | 7175.50 | FFFF???TFFTFFFFF | 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.r132-tall-165271820600204.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 JoinFreeModules-PT-0500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820600204
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 9.0K Apr 30 02:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 02:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 02:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 02:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 JoinFreeModules-PT-0500-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0500-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652753360750
Running Version 202205111006
[2022-05-17 02:09:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 02:09:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 02:09:22] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2022-05-17 02:09:22] [INFO ] Transformed 2501 places.
[2022-05-17 02:09:22] [INFO ] Transformed 4001 transitions.
[2022-05-17 02:09:22] [INFO ] Parsed PT model containing 2501 places and 4001 transitions in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 1 places and 0 transitions.
Support contains 36 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 275 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:09:22] [INFO ] Computed 500 place invariants in 39 ms
[2022-05-17 02:09:24] [INFO ] Dead Transitions using invariants and state equation in 1892 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:09:24] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:09:25] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:09:25] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:09:26] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:09:26] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2188 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:09:26] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:09:28] [INFO ] Dead Transitions using invariants and state equation in 1792 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Support contains 36 out of 2500 places after structural reductions.
[2022-05-17 02:09:29] [INFO ] Flatten gal took : 261 ms
[2022-05-17 02:09:29] [INFO ] Flatten gal took : 162 ms
[2022-05-17 02:09:29] [INFO ] Input system was already deterministic with 4001 transitions.
Support contains 35 out of 2500 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10030 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 34) seen :4
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:09:30] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:09:32] [INFO ] [Real]Absence check using 500 positive place invariants in 89 ms returned sat
[2022-05-17 02:09:34] [INFO ] After 3512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2022-05-17 02:09:35] [INFO ] [Nat]Absence check using 500 positive place invariants in 87 ms returned sat
[2022-05-17 02:09:50] [INFO ] After 13797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2022-05-17 02:09:50] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:09:59] [INFO ] After 8628ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :29
[2022-05-17 02:09:59] [INFO ] After 8629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-17 02:09:59] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Parikh walk visited 18 properties in 30018 ms.
Support contains 13 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 65 are kept as prefixes of interest. Removing 2435 places using SCC suffix rule.10 ms
Discarding 2435 places :
Also discarding 3896 output transitions
Drop transitions removed 3896 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 104
Applied a total of 2 rules in 28 ms. Remains 65 /2500 variables (removed 2435) and now considering 104/4001 (removed 3897) transitions.
// Phase 1: matrix 104 rows 65 cols
[2022-05-17 02:10:29] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-17 02:10:29] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/2500 places, 104/4001 transitions.
Incomplete random walk after 10412 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1156 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 65 cols
[2022-05-17 02:10:29] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-17 02:10:29] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 02:10:29] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:10:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 02:10:29] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:10:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-17 02:10:29] [INFO ] After 31ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:10:29] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-17 02:10:30] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2234 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=372 )
Parikh walk visited 1 properties in 5 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G(X(!(F(p0) U p1))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:30] [INFO ] Computed 500 place invariants in 19 ms
[2022-05-17 02:10:32] [INFO ] Dead Transitions using invariants and state equation in 1788 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:32] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:10:32] [INFO ] Implicit Places using invariants in 485 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:32] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:10:33] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:10:33] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:33] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:10:35] [INFO ] Dead Transitions using invariants and state equation in 1712 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, p1, p1]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s2395 5) (GEQ s2353 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2100 steps with 0 reset in 413 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-00 finished in 5530 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 227 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:36] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:10:37] [INFO ] Dead Transitions using invariants and state equation in 1723 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:37] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:10:38] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:38] [INFO ] Computed 500 place invariants in 18 ms
[2022-05-17 02:10:39] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:10:39] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 2033 ms to find 0 implicit places.
[2022-05-17 02:10:40] [INFO ] Redundant transitions in 268 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:40] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:10:41] [INFO ] Dead Transitions using invariants and state equation in 1729 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s383 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-01 finished in 6054 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(F(X(p0))))||p1)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 56 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:42] [INFO ] Computed 500 place invariants in 7 ms
[2022-05-17 02:10:43] [INFO ] Dead Transitions using invariants and state equation in 1695 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:43] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:10:44] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:44] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:10:45] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:10:45] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:45] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:10:47] [INFO ] Dead Transitions using invariants and state equation in 1804 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1602 1), p0:(LT s1123 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 34830 steps with 0 reset in 10003 ms.
Product exploration timeout after 33820 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10027 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:11:31] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:11:31] [INFO ] [Real]Absence check using 500 positive place invariants in 92 ms returned sat
[2022-05-17 02:11:33] [INFO ] After 1751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:11:33] [INFO ] [Nat]Absence check using 500 positive place invariants in 91 ms returned sat
[2022-05-17 02:11:56] [INFO ] After 22693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:11:56] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:11:56] [INFO ] After 630ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:11:57] [INFO ] After 855ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 663 ms.
[2022-05-17 02:11:57] [INFO ] After 24586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.6 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 14 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:11:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:11:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 54 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:00] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:12:01] [INFO ] Dead Transitions using invariants and state equation in 1669 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:01] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:12:02] [INFO ] Implicit Places using invariants in 389 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:02] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:12:03] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:12:03] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:04] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:12:05] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 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 p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10090 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:12:28] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:12:29] [INFO ] [Real]Absence check using 500 positive place invariants in 92 ms returned sat
[2022-05-17 02:12:30] [INFO ] After 1796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:12:30] [INFO ] [Nat]Absence check using 500 positive place invariants in 93 ms returned sat
[2022-05-17 02:12:54] [INFO ] After 23275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:12:54] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:12:54] [INFO ] After 673ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:12:55] [INFO ] After 879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 483 ms.
[2022-05-17 02:12:55] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2003 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.1 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 8 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:12:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:12:57] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 257 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=257 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration timeout after 38100 steps with 0 reset in 10002 ms.
Product exploration timeout after 36750 steps with 0 reset in 10002 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 251 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:18] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:13:20] [INFO ] Dead Transitions using invariants and state equation in 1675 ms found 0 transitions.
[2022-05-17 02:13:20] [INFO ] Redundant transitions in 219 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:20] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:13:22] [INFO ] Dead Transitions using invariants and state equation in 1724 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Product exploration timeout after 38780 steps with 0 reset in 10002 ms.
Product exploration timeout after 37480 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin3787033963862372956
[2022-05-17 02:13:42] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3787033963862372956
Running compilation step : cd /tmp/ltsmin3787033963862372956;'/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/ltsmin3787033963862372956;'/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/ltsmin3787033963862372956;'/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 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 65 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:45] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:13:47] [INFO ] Dead Transitions using invariants and state equation in 1974 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:47] [INFO ] Computed 500 place invariants in 7 ms
[2022-05-17 02:13:47] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:47] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:13:49] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:13:49] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:13:49] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:13:51] [INFO ] Dead Transitions using invariants and state equation in 1883 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin14354255266493239382
[2022-05-17 02:13:51] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14354255266493239382
Running compilation step : cd /tmp/ltsmin14354255266493239382;'/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/ltsmin14354255266493239382;'/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/ltsmin14354255266493239382;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 02:13:54] [INFO ] Flatten gal took : 200 ms
[2022-05-17 02:13:54] [INFO ] Flatten gal took : 225 ms
[2022-05-17 02:13:55] [INFO ] Time to serialize gal into /tmp/LTL13631981093159800138.gal : 64 ms
[2022-05-17 02:13:55] [INFO ] Time to serialize properties into /tmp/LTL17232676755464284382.ltl : 7 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/LTL13631981093159800138.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17232676755464284382.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/LTL1363198...268
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F(X("(p1124<3)")))))||("(p1603>=1)"))))
Formula 0 simplified : !G("(p1603>=1)" | FXFX"(p1124<3)")
Detected timeout of ITS tools.
[2022-05-17 02:14:10] [INFO ] Flatten gal took : 95 ms
[2022-05-17 02:14:10] [INFO ] Applying decomposition
[2022-05-17 02:14:10] [INFO ] Flatten gal took : 95 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/graph12250746086181553496.txt' '-o' '/tmp/graph12250746086181553496.bin' '-w' '/tmp/graph12250746086181553496.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12250746086181553496.bin' '-l' '-1' '-v' '-w' '/tmp/graph12250746086181553496.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:14:10] [INFO ] Decomposing Gal with order
[2022-05-17 02:14:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:14:11] [INFO ] Flatten gal took : 183 ms
[2022-05-17 02:14:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 90 ms.
[2022-05-17 02:14:11] [INFO ] Time to serialize gal into /tmp/LTL14654010589553807110.gal : 29 ms
[2022-05-17 02:14:11] [INFO ] Time to serialize properties into /tmp/LTL14489101122078621239.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/LTL14654010589553807110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14489101122078621239.ltl' '-c' '-stutter-deadlock'
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/LTL1465401...247
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F(X("(u224.p1124<3)")))))||("(u320.p1603>=1)"))))
Formula 0 simplified : !G("(u320.p1603>=1)" | FXFX"(u224.p1124<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13038175712420018953
[2022-05-17 02:14:26] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13038175712420018953
Running compilation step : cd /tmp/ltsmin13038175712420018953;'/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/ltsmin13038175712420018953;'/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/ltsmin13038175712420018953;'/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 JoinFreeModules-PT-0500-LTLFireability-02 finished in 227276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U G(p1)) U G((!F(p0)&&p2))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 164 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:14:29] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:14:31] [INFO ] Dead Transitions using invariants and state equation in 2061 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:14:31] [INFO ] Computed 500 place invariants in 7 ms
[2022-05-17 02:14:31] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:14:31] [INFO ] Computed 500 place invariants in 7 ms
[2022-05-17 02:14:33] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:14:33] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
[2022-05-17 02:14:33] [INFO ] Redundant transitions in 128 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:14:33] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:14:35] [INFO ] Dead Transitions using invariants and state equation in 1814 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) p0), p1, (AND p1 (NOT p0) p2)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(OR p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 p1) (AND (NOT p2) p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(GEQ s1700 3), p2:(AND (GEQ s578 3) (GEQ s283 3)), p1:(GEQ s283 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-03 finished in 6476 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(F(G(p0)))||G(p0))) U p0)))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 175 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:14:35] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:14:37] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:14:37] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:14:38] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:14:38] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:14:39] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:14:39] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2022-05-17 02:14:39] [INFO ] Redundant transitions in 123 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:14:39] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:14:41] [INFO ] Dead Transitions using invariants and state equation in 1735 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s937 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 38490 steps with 0 reset in 10001 ms.
Product exploration timeout after 36990 steps with 0 reset in 10003 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 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10079 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Probabilistic random walk after 85349 steps, saw 85213 distinct states, run finished after 3030 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:15:27] [INFO ] Computed 500 place invariants in 7 ms
[2022-05-17 02:15:27] [INFO ] [Real]Absence check using 500 positive place invariants in 84 ms returned sat
[2022-05-17 02:15:27] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:15:28] [INFO ] [Nat]Absence check using 500 positive place invariants in 91 ms returned sat
[2022-05-17 02:15:52] [INFO ] After 25007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.1 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 8 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:15:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:15:52] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 178 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:15:53] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:15:54] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:15:54] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:15:55] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:15:55] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:15:56] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:15:56] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2022-05-17 02:15:57] [INFO ] Redundant transitions in 129 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:15:57] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:15:58] [INFO ] Dead Transitions using invariants and state equation in 1677 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 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 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 5264 steps, including 1 resets, run visited all 1 properties in 118 ms. (steps per millisecond=44 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration timeout after 38650 steps with 0 reset in 10003 ms.
Product exploration timeout after 36860 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin13392815323442798840
[2022-05-17 02:16:41] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 02:16:41] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13392815323442798840
Running compilation step : cd /tmp/ltsmin13392815323442798840;'/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/ltsmin13392815323442798840;'/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/ltsmin13392815323442798840;'/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 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 172 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:16:44] [INFO ] Computed 500 place invariants in 7 ms
[2022-05-17 02:16:46] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:16:46] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:16:46] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:16:46] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:16:48] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:16:48] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
[2022-05-17 02:16:48] [INFO ] Redundant transitions in 124 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:16:48] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:16:50] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin2478710565122864472
[2022-05-17 02:16:50] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 02:16:50] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2478710565122864472
Running compilation step : cd /tmp/ltsmin2478710565122864472;'/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/ltsmin2478710565122864472;'/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/ltsmin2478710565122864472;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 02:16:53] [INFO ] Flatten gal took : 122 ms
[2022-05-17 02:16:53] [INFO ] Flatten gal took : 93 ms
[2022-05-17 02:16:53] [INFO ] Time to serialize gal into /tmp/LTL11941671413236782408.gal : 21 ms
[2022-05-17 02:16:53] [INFO ] Time to serialize properties into /tmp/LTL15577230342072124848.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/LTL11941671413236782408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15577230342072124848.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/LTL1194167...268
Read 1 LTL properties
Checking formula 0 : !((G((G((X(F(G("(p938>=2)"))))||(G("(p938>=2)"))))U("(p938>=2)"))))
Formula 0 simplified : !G(G(G"(p938>=2)" | XFG"(p938>=2)") U "(p938>=2)")
Detected timeout of ITS tools.
[2022-05-17 02:17:08] [INFO ] Flatten gal took : 80 ms
[2022-05-17 02:17:08] [INFO ] Applying decomposition
[2022-05-17 02:17:08] [INFO ] Flatten gal took : 81 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/graph15987785593934831239.txt' '-o' '/tmp/graph15987785593934831239.bin' '-w' '/tmp/graph15987785593934831239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15987785593934831239.bin' '-l' '-1' '-v' '-w' '/tmp/graph15987785593934831239.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:17:08] [INFO ] Decomposing Gal with order
[2022-05-17 02:17:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:17:09] [INFO ] Flatten gal took : 87 ms
[2022-05-17 02:17:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 49 ms.
[2022-05-17 02:17:09] [INFO ] Time to serialize gal into /tmp/LTL5022774768403605763.gal : 11 ms
[2022-05-17 02:17:09] [INFO ] Time to serialize properties into /tmp/LTL15151423413619457369.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/LTL5022774768403605763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15151423413619457369.ltl' '-c' '-stutter-deadlock'
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/LTL5022774...246
Read 1 LTL properties
Checking formula 0 : !((G((G((X(F(G("(u187.p938>=2)"))))||(G("(u187.p938>=2)"))))U("(u187.p938>=2)"))))
Formula 0 simplified : !G(G(G"(u187.p938>=2)" | XFG"(u187.p938>=2)") U "(u187.p938>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13001874646997958014
[2022-05-17 02:17:24] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13001874646997958014
Running compilation step : cd /tmp/ltsmin13001874646997958014;'/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/ltsmin13001874646997958014;'/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/ltsmin13001874646997958014;'/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 JoinFreeModules-PT-0500-LTLFireability-04 finished in 171548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(p1))))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 57 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:17:27] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:17:29] [INFO ] Dead Transitions using invariants and state equation in 1857 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:17:29] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:17:29] [INFO ] Implicit Places using invariants in 360 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:17:29] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:17:31] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:17:31] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:17:31] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:17:33] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s888 3), p0:(GEQ s1162 1)], 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][false, false, false, false]]
Product exploration timeout after 38300 steps with 0 reset in 10002 ms.
Product exploration timeout after 37080 steps with 0 reset in 10003 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 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10282 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=50 ) properties (out of 2) seen :1
Finished Best-First random walk after 3003 steps, including 0 resets, run visited all 1 properties in 67 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 58 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:18:16] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:18:18] [INFO ] Dead Transitions using invariants and state equation in 1731 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:18:18] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:18:18] [INFO ] Implicit Places using invariants in 361 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:18:18] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:18:20] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:18:20] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:18:20] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:18:21] [INFO ] Dead Transitions using invariants and state equation in 1754 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 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 p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10028 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:18:45] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:18:45] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2022-05-17 02:18:46] [INFO ] After 1781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:18:47] [INFO ] [Nat]Absence check using 500 positive place invariants in 91 ms returned sat
[2022-05-17 02:19:10] [INFO ] After 22869ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:19:10] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:19:10] [INFO ] After 654ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:19:10] [INFO ] After 882ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 144 ms.
[2022-05-17 02:19:11] [INFO ] After 24270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.1 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 8 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:19:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:19:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 38460 steps with 0 reset in 10003 ms.
Product exploration timeout after 37520 steps with 0 reset in 10001 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 137 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:19:33] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:19:35] [INFO ] Dead Transitions using invariants and state equation in 1749 ms found 0 transitions.
[2022-05-17 02:19:35] [INFO ] Redundant transitions in 122 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:19:35] [INFO ] Computed 500 place invariants in 18 ms
[2022-05-17 02:19:37] [INFO ] Dead Transitions using invariants and state equation in 1662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Product exploration timeout after 38310 steps with 0 reset in 10002 ms.
Product exploration timeout after 36950 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin1739685834380046942
[2022-05-17 02:19:57] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1739685834380046942
Running compilation step : cd /tmp/ltsmin1739685834380046942;'/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/ltsmin1739685834380046942;'/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/ltsmin1739685834380046942;'/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 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:20:00] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:20:02] [INFO ] Dead Transitions using invariants and state equation in 1668 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:20:02] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:20:02] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:20:02] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:20:04] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:20:04] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:20:04] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:20:05] [INFO ] Dead Transitions using invariants and state equation in 1677 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin14926986645994688492
[2022-05-17 02:20:05] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14926986645994688492
Running compilation step : cd /tmp/ltsmin14926986645994688492;'/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/ltsmin14926986645994688492;'/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/ltsmin14926986645994688492;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 02:20:09] [INFO ] Flatten gal took : 102 ms
[2022-05-17 02:20:09] [INFO ] Flatten gal took : 79 ms
[2022-05-17 02:20:09] [INFO ] Time to serialize gal into /tmp/LTL14711772579078861854.gal : 38 ms
[2022-05-17 02:20:09] [INFO ] Time to serialize properties into /tmp/LTL3994285945277728103.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/LTL14711772579078861854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3994285945277728103.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/LTL1471177...267
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p1163>=1)")||(X(G("(p889<3)")))))))
Formula 0 simplified : !XG("(p1163>=1)" | XG"(p889<3)")
Detected timeout of ITS tools.
[2022-05-17 02:20:24] [INFO ] Flatten gal took : 74 ms
[2022-05-17 02:20:24] [INFO ] Applying decomposition
[2022-05-17 02:20:24] [INFO ] Flatten gal took : 78 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/graph17299991831344303540.txt' '-o' '/tmp/graph17299991831344303540.bin' '-w' '/tmp/graph17299991831344303540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17299991831344303540.bin' '-l' '-1' '-v' '-w' '/tmp/graph17299991831344303540.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:20:24] [INFO ] Decomposing Gal with order
[2022-05-17 02:20:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:20:24] [INFO ] Flatten gal took : 83 ms
[2022-05-17 02:20:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-17 02:20:24] [INFO ] Time to serialize gal into /tmp/LTL619616049465525336.gal : 10 ms
[2022-05-17 02:20:24] [INFO ] Time to serialize properties into /tmp/LTL5436494882558523634.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/LTL619616049465525336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5436494882558523634.ltl' '-c' '-stutter-deadlock'
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/LTL6196160...244
Read 1 LTL properties
Checking formula 0 : !((X(G(("(u232.p1163>=1)")||(X(G("(u177.p889<3)")))))))
Formula 0 simplified : !XG("(u232.p1163>=1)" | XG"(u177.p889<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13958483622668313023
[2022-05-17 02:20:39] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13958483622668313023
Running compilation step : cd /tmp/ltsmin13958483622668313023;'/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/ltsmin13958483622668313023;'/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/ltsmin13958483622668313023;'/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 JoinFreeModules-PT-0500-LTLFireability-05 finished in 195646 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X((X(X(p3))&&p2))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 55 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:20:43] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:20:44] [INFO ] Dead Transitions using invariants and state equation in 1800 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:20:44] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:20:45] [INFO ] Implicit Places using invariants in 348 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:20:45] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:20:46] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:20:46] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:20:46] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:20:48] [INFO ] Dead Transitions using invariants and state equation in 1771 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 462 ms :[(NOT p3), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 10}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 11}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=10 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=11 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 11}]], initial=2, aps=[p3:(LT s1379 5), p0:(GEQ s1017 1), p1:(LT s1477 2), p2:(AND (GEQ s1017 1) (GEQ s1477 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 8237 ms.
Product exploration explored 100000 steps with 25000 reset in 8927 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 p3 p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 521 ms. Reduced automaton from 12 states, 20 edges and 4 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true]
Incomplete random walk after 10364 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Probabilistic random walk after 62251 steps, saw 62156 distinct states, run finished after 3008 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:21:33] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:21:34] [INFO ] [Real]Absence check using 500 positive place invariants in 88 ms returned sat
[2022-05-17 02:21:35] [INFO ] After 1943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 02:21:35] [INFO ] [Nat]Absence check using 500 positive place invariants in 90 ms returned sat
[2022-05-17 02:21:53] [INFO ] After 17371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 02:21:53] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:21:56] [INFO ] After 3148ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-17 02:21:57] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2022-05-17 02:21:57] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2022-05-17 02:21:57] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2022-05-17 02:21:58] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
[2022-05-17 02:21:58] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2022-05-17 02:21:58] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2022-05-17 02:21:58] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2022-05-17 02:21:59] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2022-05-17 02:21:59] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2022-05-17 02:21:59] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 0 ms to minimize.
[2022-05-17 02:21:59] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2022-05-17 02:21:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2812 ms
[2022-05-17 02:21:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2812 ms
[2022-05-17 02:22:00] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2022-05-17 02:22:00] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 266 ms
[2022-05-17 02:22:00] [INFO ] After 6983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 02:22:00] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 10000 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 15 are kept as prefixes of interest. Removing 2485 places using SCC suffix rule.1 ms
Discarding 2485 places :
Also discarding 3976 output transitions
Drop transitions removed 3976 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 24
Applied a total of 2 rules in 5 ms. Remains 15 /2500 variables (removed 2485) and now considering 24/4001 (removed 3977) transitions.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 02:22:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 02:22:10] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/2500 places, 24/4001 transitions.
Finished random walk after 1253 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=1253 )
Knowledge obtained : [(AND p3 p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F p1), (F (AND (NOT p3) p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 568 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 57 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:22:11] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:22:13] [INFO ] Dead Transitions using invariants and state equation in 1763 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:22:13] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:22:13] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:22:13] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:22:15] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:22:15] [INFO ] Implicit Places using invariants and state equation in 1755 ms returned []
Implicit Place search using SMT with State Equation took 2114 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:22:15] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:22:17] [INFO ] Dead Transitions using invariants and state equation in 1763 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 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 p3 p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10028 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Probabilistic random walk after 58230 steps, saw 58141 distinct states, run finished after 3032 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:22:46] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:22:47] [INFO ] [Real]Absence check using 500 positive place invariants in 92 ms returned sat
[2022-05-17 02:22:48] [INFO ] After 1952ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 02:22:49] [INFO ] [Nat]Absence check using 500 positive place invariants in 90 ms returned sat
[2022-05-17 02:23:02] [INFO ] After 13324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 02:23:02] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:23:13] [INFO ] After 11012ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-17 02:23:13] [INFO ] After 11012ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 02:23:13] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 10000 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 15 are kept as prefixes of interest. Removing 2485 places using SCC suffix rule.1 ms
Discarding 2485 places :
Also discarding 3976 output transitions
Drop transitions removed 3976 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 24
Applied a total of 2 rules in 4 ms. Remains 15 /2500 variables (removed 2485) and now considering 24/4001 (removed 3977) transitions.
// Phase 1: matrix 24 rows 15 cols
[2022-05-17 02:23:23] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 02:23:23] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/2500 places, 24/4001 transitions.
Finished random walk after 1421 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=1421 )
Knowledge obtained : [(AND p3 p0 (NOT p1)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1) (NOT p3))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1) (NOT p3)))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 7 states, 9 edges and 3 AP to 7 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 25000 reset in 8449 ms.
Product exploration explored 100000 steps with 25000 reset in 9027 ms.
Applying partial POR strategy [false, false, false, true, false, true, false]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), true, (AND (NOT p1) (NOT p3))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 150 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:23:42] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:23:44] [INFO ] Dead Transitions using invariants and state equation in 1722 ms found 0 transitions.
[2022-05-17 02:23:44] [INFO ] Redundant transitions in 122 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:23:44] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:23:46] [INFO ] Dead Transitions using invariants and state equation in 1720 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Product exploration explored 100000 steps with 25000 reset in 8331 ms.
Product exploration explored 100000 steps with 25000 reset in 9023 ms.
Built C files in :
/tmp/ltsmin8091790373648415713
[2022-05-17 02:24:03] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8091790373648415713
Running compilation step : cd /tmp/ltsmin8091790373648415713;'/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/ltsmin8091790373648415713;'/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/ltsmin8091790373648415713;'/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 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:24:06] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:24:08] [INFO ] Dead Transitions using invariants and state equation in 1718 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:24:08] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:24:08] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:24:08] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:24:10] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:24:10] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2069 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:24:10] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:24:12] [INFO ] Dead Transitions using invariants and state equation in 1713 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin1934229819711516165
[2022-05-17 02:24:12] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1934229819711516165
Running compilation step : cd /tmp/ltsmin1934229819711516165;'/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/ltsmin1934229819711516165;'/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/ltsmin1934229819711516165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 02:24:15] [INFO ] Flatten gal took : 75 ms
[2022-05-17 02:24:15] [INFO ] Flatten gal took : 75 ms
[2022-05-17 02:24:15] [INFO ] Time to serialize gal into /tmp/LTL15085085145863902832.gal : 9 ms
[2022-05-17 02:24:15] [INFO ] Time to serialize properties into /tmp/LTL5232590280636919258.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/LTL15085085145863902832.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5232590280636919258.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/LTL1508508...267
Read 1 LTL properties
Checking formula 0 : !(((("(p1018>=1)")U(X("(p1478<2)")))||(X(((X(X("(p1380<5)")))&&("(p1018>=1)"))&&("(p1478>=2)")))))
Formula 0 simplified : !(("(p1018>=1)" U X"(p1478<2)") | X("(p1018>=1)" & "(p1478>=2)" & XX"(p1380<5)"))
Detected timeout of ITS tools.
[2022-05-17 02:24:30] [INFO ] Flatten gal took : 81 ms
[2022-05-17 02:24:30] [INFO ] Applying decomposition
[2022-05-17 02:24:30] [INFO ] Flatten gal took : 81 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/graph11014244250310830247.txt' '-o' '/tmp/graph11014244250310830247.bin' '-w' '/tmp/graph11014244250310830247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11014244250310830247.bin' '-l' '-1' '-v' '-w' '/tmp/graph11014244250310830247.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:24:30] [INFO ] Decomposing Gal with order
[2022-05-17 02:24:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:24:31] [INFO ] Flatten gal took : 83 ms
[2022-05-17 02:24:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-17 02:24:31] [INFO ] Time to serialize gal into /tmp/LTL8840728274758693760.gal : 10 ms
[2022-05-17 02:24:31] [INFO ] Time to serialize properties into /tmp/LTL5750098558961139710.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/LTL8840728274758693760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5750098558961139710.ltl' '-c' '-stutter-deadlock'
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/LTL8840728...245
Read 1 LTL properties
Checking formula 0 : !(((("(u203.p1018>=1)")U(X("(u295.p1478<2)")))||(X(((X(X("(u275.p1380<5)")))&&("(u203.p1018>=1)"))&&("(u295.p1478>=2)")))))
Formula 0 simplified : !(("(u203.p1018>=1)" U X"(u295.p1478<2)") | X("(u203.p1018>=1)" & "(u295.p1478>=2)" & XX"(u275.p1380<5)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6306167459712622228
[2022-05-17 02:24:46] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6306167459712622228
Running compilation step : cd /tmp/ltsmin6306167459712622228;'/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/ltsmin6306167459712622228;'/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/ltsmin6306167459712622228;'/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 JoinFreeModules-PT-0500-LTLFireability-06 finished in 246312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(X(F(G(F(p1))))&&X(!p0)&&p1))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:24:49] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:24:51] [INFO ] Dead Transitions using invariants and state equation in 1856 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:24:51] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:24:51] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:24:51] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:24:53] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:24:53] [INFO ] Implicit Places using invariants and state equation in 1676 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:24:53] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:24:55] [INFO ] Dead Transitions using invariants and state equation in 1787 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s80 3), p0:(LT s2018 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7414 ms.
Product exploration explored 100000 steps with 50000 reset in 7879 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-0500-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0500-LTLFireability-07 finished in 43415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 145 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:25:32] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:25:34] [INFO ] Dead Transitions using invariants and state equation in 1723 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:25:34] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:25:34] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:25:34] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:25:36] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:25:36] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2022-05-17 02:25:36] [INFO ] Redundant transitions in 123 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:25:36] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:25:38] [INFO ] Dead Transitions using invariants and state equation in 1696 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(LT s1122 2), p0:(AND (GEQ s811 2) (GEQ s1223 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-09 finished in 5781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G(p1))))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 55 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:25:38] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:25:40] [INFO ] Dead Transitions using invariants and state equation in 1696 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:25:40] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:25:40] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:25:40] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:25:42] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:25:42] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:25:42] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:25:43] [INFO ] Dead Transitions using invariants and state equation in 1673 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LT s1880 3), p1:(GEQ s760 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7380 ms.
Product exploration explored 100000 steps with 50000 reset in 7855 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-0500-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0500-LTLFireability-10 finished in 42915 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U X(p0))||(X(!p0)&&p0)))))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:21] [INFO ] Computed 500 place invariants in 16 ms
[2022-05-17 02:26:23] [INFO ] Dead Transitions using invariants and state equation in 1711 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:23] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:26:23] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:23] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:26:25] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:26:25] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:25] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:26:26] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s978 4)], 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][false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-11 finished in 5542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 144 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:27] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:26:28] [INFO ] Dead Transitions using invariants and state equation in 1717 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:28] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:26:29] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:29] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:26:30] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:26:30] [INFO ] Implicit Places using invariants and state equation in 1626 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
[2022-05-17 02:26:30] [INFO ] Redundant transitions in 130 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:30] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:26:32] [INFO ] Dead Transitions using invariants and state equation in 1691 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2043 3) (GEQ s1287 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-12 finished in 5725 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(G(X(p0)))) U p0) U p1))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:32] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:26:34] [INFO ] Dead Transitions using invariants and state equation in 1705 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:34] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:26:34] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:34] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:26:36] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:26:36] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:36] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:26:38] [INFO ] Dead Transitions using invariants and state equation in 1672 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s1464 5), p0:(GEQ s482 1)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-13 finished in 5633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((!(X(p0) U p0)&&p1))||X(!(p2 U p3))))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 143 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:38] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:26:40] [INFO ] Dead Transitions using invariants and state equation in 1673 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:40] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:26:40] [INFO ] Implicit Places using invariants in 349 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:40] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:26:42] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:26:42] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2022-05-17 02:26:42] [INFO ] Redundant transitions in 130 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:42] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:26:43] [INFO ] Dead Transitions using invariants and state equation in 1695 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (AND (NOT p1) p3) (AND p0 p3)), (OR (AND (NOT p1) p3) (AND p0 p3))]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p3), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 p0 (NOT p3)) (AND p2 (NOT p1) (NOT p3))), acceptance={1} source=1 dest: 1}, { cond=(OR (AND p0 p3) (AND (NOT p1) p3)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p3:(GEQ s522 1), p2:(GEQ s1182 2), p0:(GEQ s113 3), p1:(LT s1444 5)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 38450 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 3798 steps with 0 reset with depth 3799 and stack size 3798 in 619 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-14 finished in 16369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F((F(X(p0))&&G(p1)))))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 144 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:54] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:26:56] [INFO ] Dead Transitions using invariants and state equation in 1708 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:56] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:26:56] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:56] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:26:58] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:26:58] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
[2022-05-17 02:26:58] [INFO ] Redundant transitions in 129 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:26:58] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:27:00] [INFO ] Dead Transitions using invariants and state equation in 1661 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1353 3), p1:(GEQ s1866 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0500-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0500-LTLFireability-15 finished in 5781 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(F(X(p0))))||p1)))'
Found a CL insensitive property : JoinFreeModules-PT-0500-LTLFireability-02
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 143 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:27:00] [INFO ] Computed 500 place invariants in 9 ms
[2022-05-17 02:27:02] [INFO ] Dead Transitions using invariants and state equation in 1675 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:27:02] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:27:02] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:27:02] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:27:04] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:27:04] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:27:04] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:27:06] [INFO ] Dead Transitions using invariants and state equation in 1686 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1602 1), p0:(LT s1123 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 38560 steps with 0 reset in 10001 ms.
Product exploration timeout after 37630 steps with 0 reset in 10003 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10278 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:27:48] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:27:49] [INFO ] [Real]Absence check using 500 positive place invariants in 89 ms returned sat
[2022-05-17 02:27:50] [INFO ] After 1772ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:27:51] [INFO ] [Nat]Absence check using 500 positive place invariants in 89 ms returned sat
[2022-05-17 02:28:14] [INFO ] After 23694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:28:14] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:28:15] [INFO ] After 685ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:28:15] [INFO ] After 903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-17 02:28:15] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2001 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.1 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 4 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:28:17] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:28:17] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:28:18] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:28:19] [INFO ] Dead Transitions using invariants and state equation in 1707 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:28:19] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:28:20] [INFO ] Implicit Places using invariants in 393 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:28:20] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:28:21] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:28:21] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:28:21] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:28:23] [INFO ] Dead Transitions using invariants and state equation in 1688 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 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 p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10035 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:28:46] [INFO ] Computed 500 place invariants in 16 ms
[2022-05-17 02:28:46] [INFO ] [Real]Absence check using 500 positive place invariants in 90 ms returned sat
[2022-05-17 02:28:48] [INFO ] After 1780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:28:48] [INFO ] [Nat]Absence check using 500 positive place invariants in 90 ms returned sat
[2022-05-17 02:29:11] [INFO ] After 22909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:29:11] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:29:12] [INFO ] After 656ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:29:12] [INFO ] After 872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 683 ms.
[2022-05-17 02:29:13] [INFO ] After 24839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.1 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 3 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:29:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:29:15] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration timeout after 38260 steps with 0 reset in 10001 ms.
Product exploration timeout after 36660 steps with 0 reset in 10003 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 142 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:29:35] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:29:37] [INFO ] Dead Transitions using invariants and state equation in 1708 ms found 0 transitions.
[2022-05-17 02:29:37] [INFO ] Redundant transitions in 124 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:29:37] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:29:39] [INFO ] Dead Transitions using invariants and state equation in 1745 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Product exploration timeout after 38400 steps with 0 reset in 10003 ms.
Product exploration timeout after 37040 steps with 0 reset in 10002 ms.
Built C files in :
/tmp/ltsmin17619775614250864906
[2022-05-17 02:29:59] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17619775614250864906
Running compilation step : cd /tmp/ltsmin17619775614250864906;'/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/ltsmin17619775614250864906;'/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/ltsmin17619775614250864906;'/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 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 59 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:30:02] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:30:04] [INFO ] Dead Transitions using invariants and state equation in 1796 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:30:04] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:30:04] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:30:04] [INFO ] Computed 500 place invariants in 8 ms
[2022-05-17 02:30:06] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:30:06] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 1972 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:30:06] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:30:08] [INFO ] Dead Transitions using invariants and state equation in 1807 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin14483004390711930351
[2022-05-17 02:30:08] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14483004390711930351
Running compilation step : cd /tmp/ltsmin14483004390711930351;'/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/ltsmin14483004390711930351;'/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/ltsmin14483004390711930351;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 02:30:11] [INFO ] Flatten gal took : 76 ms
[2022-05-17 02:30:11] [INFO ] Flatten gal took : 76 ms
[2022-05-17 02:30:11] [INFO ] Time to serialize gal into /tmp/LTL16215511242000698847.gal : 7 ms
[2022-05-17 02:30:11] [INFO ] Time to serialize properties into /tmp/LTL15735747310036862588.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/LTL16215511242000698847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15735747310036862588.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/LTL1621551...268
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F(X("(p1124<3)")))))||("(p1603>=1)"))))
Formula 0 simplified : !G("(p1603>=1)" | FXFX"(p1124<3)")
Detected timeout of ITS tools.
[2022-05-17 02:30:26] [INFO ] Flatten gal took : 76 ms
[2022-05-17 02:30:26] [INFO ] Applying decomposition
[2022-05-17 02:30:26] [INFO ] Flatten gal took : 77 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/graph17020047736357937118.txt' '-o' '/tmp/graph17020047736357937118.bin' '-w' '/tmp/graph17020047736357937118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17020047736357937118.bin' '-l' '-1' '-v' '-w' '/tmp/graph17020047736357937118.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:30:26] [INFO ] Decomposing Gal with order
[2022-05-17 02:30:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:30:26] [INFO ] Flatten gal took : 81 ms
[2022-05-17 02:30:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-17 02:30:27] [INFO ] Time to serialize gal into /tmp/LTL6865773714647542703.gal : 9 ms
[2022-05-17 02:30:27] [INFO ] Time to serialize properties into /tmp/LTL14255098770602195109.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/LTL6865773714647542703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14255098770602195109.ltl' '-c' '-stutter-deadlock'
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/LTL6865773...246
Read 1 LTL properties
Checking formula 0 : !((G((F(X(F(X("(u224.p1124<3)")))))||("(u320.p1603>=1)"))))
Formula 0 simplified : !G("(u320.p1603>=1)" | FXFX"(u224.p1124<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4730310841445367540
[2022-05-17 02:30:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4730310841445367540
Running compilation step : cd /tmp/ltsmin4730310841445367540;'/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/ltsmin4730310841445367540;'/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/ltsmin4730310841445367540;'/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 JoinFreeModules-PT-0500-LTLFireability-02 finished in 224595 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((X(F(G(p0)))||G(p0))) U p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G(p1))))))'
Found a SL insensitive property : JoinFreeModules-PT-0500-LTLFireability-05
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 134 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:30:45] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:30:47] [INFO ] Dead Transitions using invariants and state equation in 1789 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:30:47] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:30:47] [INFO ] Implicit Places using invariants in 344 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:30:47] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:30:49] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:30:49] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2000 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:30:49] [INFO ] Computed 500 place invariants in 5 ms
[2022-05-17 02:30:51] [INFO ] Dead Transitions using invariants and state equation in 1819 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Running random walk in product with property : JoinFreeModules-PT-0500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s888 3), p0:(GEQ s1162 1)], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 38800 steps with 0 reset in 10002 ms.
Product exploration timeout after 37040 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10114 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:31:34] [INFO ] Computed 500 place invariants in 14 ms
[2022-05-17 02:31:34] [INFO ] [Real]Absence check using 500 positive place invariants in 91 ms returned sat
[2022-05-17 02:31:35] [INFO ] After 1768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:31:36] [INFO ] [Nat]Absence check using 500 positive place invariants in 90 ms returned sat
[2022-05-17 02:31:59] [INFO ] After 23304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:31:59] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:32:00] [INFO ] After 694ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:32:00] [INFO ] After 914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 144 ms.
[2022-05-17 02:32:00] [INFO ] After 24730ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2002 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.1 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 3 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:32:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:32:02] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 55 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:32:02] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:32:04] [INFO ] Dead Transitions using invariants and state equation in 1736 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:32:04] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:32:05] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:32:05] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:32:06] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:32:06] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:32:06] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:32:08] [INFO ] Dead Transitions using invariants and state equation in 1715 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 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 p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10028 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:32:31] [INFO ] Computed 500 place invariants in 15 ms
[2022-05-17 02:32:31] [INFO ] [Real]Absence check using 500 positive place invariants in 90 ms returned sat
[2022-05-17 02:32:33] [INFO ] After 1771ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 02:32:33] [INFO ] [Nat]Absence check using 500 positive place invariants in 91 ms returned sat
[2022-05-17 02:32:56] [INFO ] After 22715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 02:32:56] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:32:56] [INFO ] After 665ms SMT Verify possible using 500 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 02:32:57] [INFO ] After 877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 143 ms.
[2022-05-17 02:32:57] [INFO ] After 24115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2001 ms.
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 5 are kept as prefixes of interest. Removing 2495 places using SCC suffix rule.1 ms
Discarding 2495 places :
Also discarding 3992 output transitions
Drop transitions removed 3992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 5 ms. Remains 5 /2500 variables (removed 2495) and now considering 8/4001 (removed 3993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:32:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:32:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/2500 places, 8/4001 transitions.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 38800 steps with 0 reset in 10002 ms.
Product exploration timeout after 37110 steps with 0 reset in 10003 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 141 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:33:20] [INFO ] Computed 500 place invariants in 10 ms
[2022-05-17 02:33:21] [INFO ] Dead Transitions using invariants and state equation in 1683 ms found 0 transitions.
[2022-05-17 02:33:21] [INFO ] Redundant transitions in 122 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:33:21] [INFO ] Computed 500 place invariants in 13 ms
[2022-05-17 02:33:23] [INFO ] Dead Transitions using invariants and state equation in 1704 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Product exploration timeout after 38560 steps with 0 reset in 10001 ms.
Product exploration timeout after 37100 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin3332947175915794348
[2022-05-17 02:33:43] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3332947175915794348
Running compilation step : cd /tmp/ltsmin3332947175915794348;'/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/ltsmin3332947175915794348;'/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/ltsmin3332947175915794348;'/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 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Applied a total of 0 rules in 53 ms. Remains 2500 /2500 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:33:46] [INFO ] Computed 500 place invariants in 12 ms
[2022-05-17 02:33:48] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:33:48] [INFO ] Computed 500 place invariants in 6 ms
[2022-05-17 02:33:48] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:33:48] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:33:50] [INFO ] State equation strengthened by 500 read => feed constraints.
[2022-05-17 02:33:50] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 1996 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:33:50] [INFO ] Computed 500 place invariants in 11 ms
[2022-05-17 02:33:52] [INFO ] Dead Transitions using invariants and state equation in 1797 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 4001/4001 transitions.
Built C files in :
/tmp/ltsmin12924835548697659352
[2022-05-17 02:33:52] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12924835548697659352
Running compilation step : cd /tmp/ltsmin12924835548697659352;'/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/ltsmin12924835548697659352;'/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/ltsmin12924835548697659352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 02:33:55] [INFO ] Flatten gal took : 78 ms
[2022-05-17 02:33:55] [INFO ] Flatten gal took : 88 ms
[2022-05-17 02:33:55] [INFO ] Time to serialize gal into /tmp/LTL1567067442231539557.gal : 7 ms
[2022-05-17 02:33:55] [INFO ] Time to serialize properties into /tmp/LTL16258956145212237318.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/LTL1567067442231539557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16258956145212237318.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/LTL1567067...267
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p1163>=1)")||(X(G("(p889<3)")))))))
Formula 0 simplified : !XG("(p1163>=1)" | XG"(p889<3)")
Detected timeout of ITS tools.
[2022-05-17 02:34:10] [INFO ] Flatten gal took : 87 ms
[2022-05-17 02:34:10] [INFO ] Applying decomposition
[2022-05-17 02:34:10] [INFO ] Flatten gal took : 85 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/graph1770528664486873065.txt' '-o' '/tmp/graph1770528664486873065.bin' '-w' '/tmp/graph1770528664486873065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1770528664486873065.bin' '-l' '-1' '-v' '-w' '/tmp/graph1770528664486873065.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:34:10] [INFO ] Decomposing Gal with order
[2022-05-17 02:34:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:34:11] [INFO ] Flatten gal took : 82 ms
[2022-05-17 02:34:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-05-17 02:34:11] [INFO ] Time to serialize gal into /tmp/LTL7567148916365837085.gal : 9 ms
[2022-05-17 02:34:11] [INFO ] Time to serialize properties into /tmp/LTL12812242071554002092.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/LTL7567148916365837085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12812242071554002092.ltl' '-c' '-stutter-deadlock'
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/LTL7567148...246
Read 1 LTL properties
Checking formula 0 : !((X(G(("(u232.p1163>=1)")||(X(G("(u177.p889<3)")))))))
Formula 0 simplified : !XG("(u232.p1163>=1)" | XG"(u177.p889<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10328270876579958821
[2022-05-17 02:34:26] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10328270876579958821
Running compilation step : cd /tmp/ltsmin10328270876579958821;'/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/ltsmin10328270876579958821;'/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/ltsmin10328270876579958821;'/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 JoinFreeModules-PT-0500-LTLFireability-05 finished in 224090 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||X((X(X(p3))&&p2))))'
[2022-05-17 02:34:29] [INFO ] Flatten gal took : 76 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7463434573172235083
[2022-05-17 02:34:29] [INFO ] Too many transitions (4001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 02:34:29] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7463434573172235083
Running compilation step : cd /tmp/ltsmin7463434573172235083;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 02:34:29] [INFO ] Applying decomposition
[2022-05-17 02:34:29] [INFO ] Flatten gal took : 77 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/graph7704954778481292696.txt' '-o' '/tmp/graph7704954778481292696.bin' '-w' '/tmp/graph7704954778481292696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7704954778481292696.bin' '-l' '-1' '-v' '-w' '/tmp/graph7704954778481292696.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:34:29] [INFO ] Decomposing Gal with order
[2022-05-17 02:34:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:34:30] [INFO ] Flatten gal took : 83 ms
[2022-05-17 02:34:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-05-17 02:34:30] [INFO ] Time to serialize gal into /tmp/LTLFireability9523381670593765634.gal : 10 ms
[2022-05-17 02:34:30] [INFO ] Time to serialize properties into /tmp/LTLFireability2860085772262702888.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/LTLFireability9523381670593765634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2860085772262702888.ltl' '-c' '-stutter-deadlock'
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/LTLFireabi...267
Read 4 LTL properties
Checking formula 0 : !((G((F(X(F(X("(u224.p1124<3)")))))||("(u320.p1603>=1)"))))
Formula 0 simplified : !G("(u320.p1603>=1)" | FXFX"(u224.p1124<3)")
Compilation finished in 9893 ms.
Running link step : cd /tmp/ltsmin7463434573172235083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin7463434573172235083;'/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' '[]((<>(X(<>(X((LTLAPp0==true)))))||(LTLAPp1==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions u0.t1, u0.t2, u0.t3, u0.t4, u0.t8, u1.t9, u1.t10, u1.t11, u1.t12, u1.t16, u2.t17, u2.t18, u2....28923
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7463434573172235083;'/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' '[]((<>(X(<>(X((LTLAPp0==true)))))||(LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7463434573172235083;'/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' '[](([]((X(<>([]((LTLAPp2==true))))||[]((LTLAPp2==true)))) U (LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.062: LTL layer: formula: [](([]((X(<>([]((LTLAPp2==true))))||[]((LTLAPp2==true)))) U (LTLAPp2==true)))
pins2lts-mc-linux64( 3/ 8), 0.063: "[](([]((X(<>([]((LTLAPp2==true))))||[]((LTLAPp2==true)))) U (LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.071: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.710: There are 4011 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.710: State length is 2501, there are 4005 groups
pins2lts-mc-linux64( 0/ 8), 0.710: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.710: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.710: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.710: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 3.092: [Blue] ~120 levels ~960 states ~966064 transitions
pins2lts-mc-linux64( 2/ 8), 4.045: [Blue] ~240 levels ~1920 states ~1936584 transitions
pins2lts-mc-linux64( 4/ 8), 5.916: [Blue] ~480 levels ~3840 states ~3867856 transitions
pins2lts-mc-linux64( 0/ 8), 10.106: [Blue] ~960 levels ~7680 states ~7708128 transitions
pins2lts-mc-linux64( 4/ 8), 18.305: [Blue] ~1920 levels ~15360 states ~15470672 transitions
pins2lts-mc-linux64( 1/ 8), 34.385: [Blue] ~3840 levels ~30720 states ~30960016 transitions
pins2lts-mc-linux64( 1/ 8), 52.492: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 67.946:
pins2lts-mc-linux64( 0/ 8), 67.946: Explored 43742 states 44044962 transitions, fanout: 1006.926
pins2lts-mc-linux64( 0/ 8), 67.946: Total exploration time 67.210 sec (54.940 sec minimum, 61.595 sec on average)
pins2lts-mc-linux64( 0/ 8), 67.946: States per second: 651, Transitions per second: 655333
pins2lts-mc-linux64( 0/ 8), 67.946:
pins2lts-mc-linux64( 0/ 8), 67.946: State space has 44017311 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 67.946: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 67.946: blue states: 43742 (0.10%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 67.946: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 67.946: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 67.946:
pins2lts-mc-linux64( 0/ 8), 67.946: Total memory used for local state coloring: 0.7MB
pins2lts-mc-linux64( 0/ 8), 67.946:
pins2lts-mc-linux64( 0/ 8), 67.946: Queue width: 8B, total height: 43742, memory: 0.33MB
pins2lts-mc-linux64( 0/ 8), 67.946: Tree memory: 591.8MB, 14.1 B/state, compr.: 0.1%
pins2lts-mc-linux64( 0/ 8), 67.946: Tree fill ratio (roots/leafs): 32.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 67.946: Stored 4216 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 67.946: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 67.946: Est. total memory use: 592.2MB (~1024.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7463434573172235083;'/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' '[](([]((X(<>([]((LTLAPp2==true))))||[]((LTLAPp2==true)))) U (LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7463434573172235083;'/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' '[](([]((X(<>([]((LTLAPp2==true))))||[]((LTLAPp2==true)))) U (LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
94721 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,947.481,5243028,1,0,2.38879e+06,5.91372e+06,5090,1.00955e+06,2698,5.73061e+06,5095
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0500-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G((G((X(F(G("(u187.p938>=2)"))))||(G("(u187.p938>=2)"))))U("(u187.p938>=2)"))))
Formula 1 simplified : !G(G(G"(u187.p938>=2)" | XFG"(u187.p938>=2)") U "(u187.p938>=2)")
Detected timeout of ITS tools.
[2022-05-17 03:02:52] [INFO ] Flatten gal took : 78 ms
[2022-05-17 03:02:52] [INFO ] Time to serialize gal into /tmp/LTLFireability1587909574359395483.gal : 7 ms
[2022-05-17 03:02:52] [INFO ] Time to serialize properties into /tmp/LTLFireability10528551889914262683.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/LTLFireability1587909574359395483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10528551889914262683.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/LTLFireabi...289
Read 3 LTL properties
Checking formula 0 : !((G((G((X(F(G("(p938>=2)"))))||(G("(p938>=2)"))))U("(p938>=2)"))))
Formula 0 simplified : !G(G(G"(p938>=2)" | XFG"(p938>=2)") U "(p938>=2)")
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="JoinFreeModules-PT-0500"
export BK_EXAMINATION="LTLFireability"
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 JoinFreeModules-PT-0500, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820600204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0500.tgz
mv JoinFreeModules-PT-0500 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;