About the Execution of 2023-gold for Philosophers-PT-000500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1129.016 | 322176.00 | 376000.00 | 1847.50 | FFTFFFFFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422500332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Philosophers-PT-000500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422500332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 444K Apr 13 10:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 13 10:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 325K Apr 13 09:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 13 09:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 225K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 865K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 186K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 885K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 746K Apr 13 11:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 11:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 778K Apr 13 10:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.9M Apr 13 10:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 132K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717003549771
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000500
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 17:25:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 17:25:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:25:53] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2024-05-29 17:25:53] [INFO ] Transformed 2500 places.
[2024-05-29 17:25:53] [INFO ] Transformed 2500 transitions.
[2024-05-29 17:25:53] [INFO ] Found NUPN structural information;
[2024-05-29 17:25:53] [INFO ] Parsed PT model containing 2500 places and 2500 transitions and 8000 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 239 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-PT-000500-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-000500-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 42 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2024-05-29 17:25:53] [INFO ] Computed 1000 invariants in 50 ms
[2024-05-29 17:25:55] [INFO ] Implicit Places using invariants in 1319 ms returned []
[2024-05-29 17:25:55] [INFO ] Invariant cache hit.
[2024-05-29 17:25:55] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
[2024-05-29 17:25:55] [INFO ] Invariant cache hit.
[2024-05-29 17:25:58] [INFO ] Dead Transitions using invariants and state equation in 2686 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4780 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2024-05-29 17:25:59] [INFO ] Flatten gal took : 293 ms
[2024-05-29 17:25:59] [INFO ] Flatten gal took : 184 ms
[2024-05-29 17:26:00] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2114 ms. (steps per millisecond=4 ) properties (out of 26) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 547 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 17:26:05] [INFO ] Invariant cache hit.
[2024-05-29 17:26:06] [INFO ] After 884ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 17:26:08] [INFO ] [Nat]Absence check using 1000 positive place invariants in 329 ms returned sat
[2024-05-29 17:26:12] [INFO ] After 2961ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-29 17:26:13] [INFO ] After 4413ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 684 ms.
[2024-05-29 17:26:14] [INFO ] After 7459ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 4 properties in 152 ms. (steps per millisecond=3 )
Parikh walk visited 3 properties in 158 ms.
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Free-agglomeration rule (complex) applied 500 times.
Iterating global reduction 0 with 500 rules applied. Total rules applied 500 place count 2500 transition count 2000
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 1000 place count 2000 transition count 2000
Applied a total of 1000 rules in 759 ms. Remains 2000 /2500 variables (removed 500) and now considering 2000/2500 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 760 ms. Remains : 2000/2500 places, 2000/2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 57708 steps, run timeout after 3004 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57708 steps, saw 57413 distinct states, run finished after 3006 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2000 rows 2000 cols
[2024-05-29 17:26:19] [INFO ] Computed 1000 invariants in 13 ms
[2024-05-29 17:26:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 297 ms returned sat
[2024-05-29 17:26:20] [INFO ] After 1253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:26:21] [INFO ] [Nat]Absence check using 1000 positive place invariants in 423 ms returned sat
[2024-05-29 17:26:24] [INFO ] After 1853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:26:24] [INFO ] After 2032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-29 17:26:24] [INFO ] After 3400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 500 steps, including 0 resets, run visited all 1 properties in 46 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 47 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(X(F(p1))))))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 50 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2024-05-29 17:26:25] [INFO ] Computed 1000 invariants in 11 ms
[2024-05-29 17:26:25] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-29 17:26:25] [INFO ] Invariant cache hit.
[2024-05-29 17:26:27] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
[2024-05-29 17:26:27] [INFO ] Invariant cache hit.
[2024-05-29 17:26:30] [INFO ] Dead Transitions using invariants and state equation in 3562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5931 ms. Remains : 2500/2500 places, 2500/2500 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 515 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GT 1 (ADD s957 s958 s959 s960 s961 s962 s963 s964 s965 s966 s967 s968 s969 s970 s971 s972 s975 s977 s978 s979 s980 s1021 s1022 s1023 s1024 s1025 s1026...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 8636 ms.
Stack based approach found an accepted trace after 6043 steps with 0 reset with depth 6044 and stack size 3901 in 669 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-00 finished in 15871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1)))&&X(p2)))'
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 9 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:26:40] [INFO ] Invariant cache hit.
[2024-05-29 17:26:41] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-05-29 17:26:41] [INFO ] Invariant cache hit.
[2024-05-29 17:26:42] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2024-05-29 17:26:42] [INFO ] Invariant cache hit.
[2024-05-29 17:26:45] [INFO ] Dead Transitions using invariants and state equation in 3507 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4809 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), true]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT (ADD s1414 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s1458 s145...], 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]]
Product exploration explored 100000 steps with 1 reset in 4576 ms.
Stack based approach found an accepted trace after 10619 steps with 0 reset with depth 10620 and stack size 10056 in 711 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-01 finished in 10326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((G(p0)&&F(p1))) U p2))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 77 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:26:51] [INFO ] Invariant cache hit.
[2024-05-29 17:26:51] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-29 17:26:51] [INFO ] Invariant cache hit.
[2024-05-29 17:26:52] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2024-05-29 17:26:52] [INFO ] Invariant cache hit.
[2024-05-29 17:26:55] [INFO ] Dead Transitions using invariants and state equation in 3287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4832 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 7928 ms.
Stack based approach found an accepted trace after 69855 steps with 0 reset with depth 69856 and stack size 2350 in 5557 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-03 finished in 18651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 82 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:27:09] [INFO ] Invariant cache hit.
[2024-05-29 17:27:11] [INFO ] Implicit Places using invariants in 2047 ms returned []
[2024-05-29 17:27:11] [INFO ] Invariant cache hit.
[2024-05-29 17:27:14] [INFO ] Implicit Places using invariants and state equation in 2394 ms returned []
Implicit Place search using SMT with State Equation took 4446 ms to find 0 implicit places.
[2024-05-29 17:27:14] [INFO ] Redundant transitions in 187 ms returned []
[2024-05-29 17:27:14] [INFO ] Invariant cache hit.
[2024-05-29 17:27:17] [INFO ] Dead Transitions using invariants and state equation in 3300 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8024 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-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:(LEQ (ADD s1414 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s1458 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 7836 ms.
Stack based approach found an accepted trace after 3491 steps with 0 reset with depth 3492 and stack size 3492 in 395 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-04 finished in 16349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((!p0&&F(G(p1)))))))'
Support contains 500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 86 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:27:26] [INFO ] Invariant cache hit.
[2024-05-29 17:27:28] [INFO ] Implicit Places using invariants in 2476 ms returned []
[2024-05-29 17:27:28] [INFO ] Invariant cache hit.
[2024-05-29 17:27:30] [INFO ] Implicit Places using invariants and state equation in 2376 ms returned []
Implicit Place search using SMT with State Equation took 4857 ms to find 0 implicit places.
[2024-05-29 17:27:31] [INFO ] Invariant cache hit.
[2024-05-29 17:27:31] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5749 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-05 finished in 6053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 116 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:27:32] [INFO ] Invariant cache hit.
[2024-05-29 17:27:34] [INFO ] Implicit Places using invariants in 2442 ms returned []
[2024-05-29 17:27:34] [INFO ] Invariant cache hit.
[2024-05-29 17:27:35] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 3103 ms to find 0 implicit places.
[2024-05-29 17:27:35] [INFO ] Redundant transitions in 212 ms returned []
[2024-05-29 17:27:35] [INFO ] Invariant cache hit.
[2024-05-29 17:27:38] [INFO ] Dead Transitions using invariants and state equation in 3376 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6823 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s1414 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s1458 s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 8687 ms.
Stack based approach found an accepted trace after 7988 steps with 0 reset with depth 7989 and stack size 7989 in 835 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-06 finished in 16429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1&&X((p1 U (p2||G(p1)))))) U (G((p0||(p1&&X((p1 U (p2||G(p1)))))))||(G(!p4)&&p3))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 36 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:27:48] [INFO ] Invariant cache hit.
[2024-05-29 17:27:49] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-05-29 17:27:49] [INFO ] Invariant cache hit.
[2024-05-29 17:27:50] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2024-05-29 17:27:50] [INFO ] Redundant transitions in 128 ms returned []
[2024-05-29 17:27:50] [INFO ] Invariant cache hit.
[2024-05-29 17:27:51] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2708 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p4)), true, p4, (AND (NOT p1) (NOT p2)), (AND p4 (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p1) p4)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1) (AND p4 p0) (AND p4 p1)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND p4 (NOT p0) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p0) p1) (AND p4 (NOT p0) p1)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p4) (NOT p0) p1), acceptance={} source=0 dest: 4}, { cond=(OR (AND p3 (NOT p4) p0) (AND p3 (NOT p4) p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p4, acceptance={} source=2 dest: 1}, { cond=(NOT p4), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p4 p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p4) p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p4 p0 p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p4) p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p4 p0) (AND p4 p1)), acceptance={} source=5 dest: 0}, { cond=(AND p4 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p4 (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p4) (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(OR (AND (NOT p4) p0) (AND (NOT p4) p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 92 steps with 0 reset in 66 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-07 finished in 3112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G((p1||(p2 U (p3||G(p2)))))))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 96 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:27:51] [INFO ] Invariant cache hit.
[2024-05-29 17:27:54] [INFO ] Implicit Places using invariants in 2533 ms returned []
[2024-05-29 17:27:54] [INFO ] Invariant cache hit.
[2024-05-29 17:27:56] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 5185 ms to find 0 implicit places.
[2024-05-29 17:27:56] [INFO ] Invariant cache hit.
[2024-05-29 17:28:00] [INFO ] Dead Transitions using invariants and state equation in 3114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8398 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p1)), true, (AND p1 (NOT p3) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(OR p1 p3 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s1971 0) (EQ s504 0) (EQ s1423 1)), p1:(AND (EQ s1423 0) (EQ s504 1)), p3:(AND (NOT (OR (EQ s1186 0) (EQ s198 1))) (NEQ s1971 1)), p2:(NEQ s197...], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 811 steps with 0 reset in 119 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-08 finished in 8794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G((p1&&(G(p3)||p2)))))'
Support contains 8 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 152 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:28:00] [INFO ] Invariant cache hit.
[2024-05-29 17:28:03] [INFO ] Implicit Places using invariants in 2832 ms returned []
[2024-05-29 17:28:03] [INFO ] Invariant cache hit.
[2024-05-29 17:28:06] [INFO ] Implicit Places using invariants and state equation in 3018 ms returned []
Implicit Place search using SMT with State Equation took 5853 ms to find 0 implicit places.
[2024-05-29 17:28:06] [INFO ] Invariant cache hit.
[2024-05-29 17:28:09] [INFO ] Dead Transitions using invariants and state equation in 3475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9481 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 6}], [{ cond=(OR (NOT p1) (AND (NOT p2) (NOT p3))), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p3), acceptance={} source=2 dest: 4}, { cond=(OR (NOT p1) (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p2) p3), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}, { cond=(OR (NOT p1) (AND (NOT p2) (NOT p3))), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 p3 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p1:(OR (EQ s793 0) (EQ s421 1)), p2:(OR (EQ s2084 0) (EQ s79 1)), p3:(OR (EQ s2128 0) (EQ s220 1)), p0:(OR (EQ s2311 0) (EQ s1052 1))], 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][false, false, false, false, false, false, false]]
Product exploration timeout after 78570 steps with 26190 reset in 10002 ms.
Product exploration timeout after 75990 steps with 25330 reset in 10002 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 p2 p3 p0), (X (NOT (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))))))]
False Knowledge obtained : [(X (AND p1 p3)), (X (NOT (AND p1 p3))), (X (OR (NOT p1) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (NOT p1) (AND (NOT p2) (NOT p3))))), (X (OR (NOT p1) (NOT p3))), (X (NOT (OR (NOT p1) (NOT p3)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p3 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 480 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 914 ms. (steps per millisecond=10 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 17:28:51] [INFO ] Invariant cache hit.
[2024-05-29 17:28:52] [INFO ] [Real]Absence check using 1000 positive place invariants in 313 ms returned sat
[2024-05-29 17:28:52] [INFO ] After 1074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:28:53] [INFO ] [Nat]Absence check using 1000 positive place invariants in 333 ms returned sat
[2024-05-29 17:28:55] [INFO ] After 1989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:28:56] [INFO ] After 2288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 168 ms.
[2024-05-29 17:28:56] [INFO ] After 3480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 329 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 36 ms.
Knowledge obtained : [(AND p1 p2 p3 p0), (X (NOT (AND p1 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))))))]
False Knowledge obtained : [(X (AND p1 p3)), (X (NOT (AND p1 p3))), (X (OR (NOT p1) (AND (NOT p2) (NOT p3)))), (X (NOT (OR (NOT p1) (AND (NOT p2) (NOT p3))))), (X (OR (NOT p1) (NOT p3))), (X (NOT (OR (NOT p1) (NOT p3)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 p3 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (F (AND p1 p3 (NOT p0))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0)))), (F (AND p1 (NOT p2) p3 (NOT p0))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0)))), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (OR (NOT p1) (NOT p2))), (F (AND p1 p2 (NOT p0)))]
Knowledge based reduction with 5 factoid took 946 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Support contains 8 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 151 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:28:58] [INFO ] Invariant cache hit.
[2024-05-29 17:29:01] [INFO ] Implicit Places using invariants in 3109 ms returned []
[2024-05-29 17:29:01] [INFO ] Invariant cache hit.
[2024-05-29 17:29:01] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 3849 ms to find 0 implicit places.
[2024-05-29 17:29:01] [INFO ] Invariant cache hit.
[2024-05-29 17:29:04] [INFO ] Dead Transitions using invariants and state equation in 2479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6485 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))))))]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 293 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 983 ms. (steps per millisecond=10 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 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 197 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 17:29:25] [INFO ] Invariant cache hit.
[2024-05-29 17:29:26] [INFO ] After 646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 17:29:27] [INFO ] [Nat]Absence check using 1000 positive place invariants in 366 ms returned sat
[2024-05-29 17:29:29] [INFO ] After 1997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 17:29:30] [INFO ] After 2380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 235 ms.
[2024-05-29 17:29:30] [INFO ] After 3881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 394 steps, including 0 resets, run visited all 2 properties in 28 ms. (steps per millisecond=14 )
Parikh walk visited 2 properties in 28 ms.
Knowledge obtained : [(AND p0 p1 p2 p3), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))))))]
False Knowledge obtained : [(X (OR (NOT p1) (NOT p2))), (X (NOT (OR (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (F (AND (NOT p0) p1 p3)), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))), (F (AND (NOT p0) p1 (NOT p2) p3)), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (OR (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 3 factoid took 744 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Product exploration timeout after 77230 steps with 25743 reset in 10001 ms.
Product exploration timeout after 72360 steps with 24120 reset in 10001 ms.
Applying partial POR strategy [true, false, false, true, true]
Stuttering acceptance computed with spot in 325 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Support contains 8 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 492 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 492 places in 1 ms
Iterating global reduction 0 with 492 rules applied. Total rules applied 492 place count 2500 transition count 2500
Deduced a syphon composed of 492 places in 1 ms
Applied a total of 492 rules in 1022 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-29 17:29:53] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2024-05-29 17:29:53] [INFO ] Computed 1000 invariants in 34 ms
[2024-05-29 17:29:56] [INFO ] Dead Transitions using invariants and state equation in 2751 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2500/2500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3873 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin4344777349812564167
[2024-05-29 17:29:56] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4344777349812564167
Running compilation step : cd /tmp/ltsmin4344777349812564167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4344777349812564167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4344777349812564167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 8 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 144 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2024-05-29 17:29:59] [INFO ] Computed 1000 invariants in 9 ms
[2024-05-29 17:30:02] [INFO ] Implicit Places using invariants in 2583 ms returned []
[2024-05-29 17:30:02] [INFO ] Invariant cache hit.
[2024-05-29 17:30:05] [INFO ] Implicit Places using invariants and state equation in 2787 ms returned []
Implicit Place search using SMT with State Equation took 5378 ms to find 0 implicit places.
[2024-05-29 17:30:05] [INFO ] Invariant cache hit.
[2024-05-29 17:30:07] [INFO ] Dead Transitions using invariants and state equation in 2754 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8277 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin4739189952660603438
[2024-05-29 17:30:07] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4739189952660603438
Running compilation step : cd /tmp/ltsmin4739189952660603438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4739189952660603438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4739189952660603438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 17:30:11] [INFO ] Flatten gal took : 120 ms
[2024-05-29 17:30:11] [INFO ] Flatten gal took : 104 ms
[2024-05-29 17:30:11] [INFO ] Time to serialize gal into /tmp/LTL14569838784574395091.gal : 29 ms
[2024-05-29 17:30:11] [INFO ] Time to serialize properties into /tmp/LTL15762506849107734690.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14569838784574395091.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2216958411746329364.hoa' '-atoms' '/tmp/LTL15762506849107734690.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15762506849107734690.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2216958411746329364.hoa
Detected timeout of ITS tools.
[2024-05-29 17:30:26] [INFO ] Flatten gal took : 107 ms
[2024-05-29 17:30:27] [INFO ] Flatten gal took : 96 ms
[2024-05-29 17:30:27] [INFO ] Time to serialize gal into /tmp/LTL3874617092828462047.gal : 17 ms
[2024-05-29 17:30:27] [INFO ] Time to serialize properties into /tmp/LTL12891455224879094101.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3874617092828462047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12891455224879094101.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((Eat_431==0)||(Catch1_104==1))"))))||(G(("((Fork_306==0)||(Think_430==1))")&&(("((Eat_235==0)||(Think_85==1))")||(G("((Eat...188
Formula 0 simplified : XXG!"((Eat_431==0)||(Catch1_104==1))" & F(!"((Fork_306==0)||(Think_430==1))" | (!"((Eat_235==0)||(Think_85==1))" & F!"((Eat_252==0)|...174
Detected timeout of ITS tools.
[2024-05-29 17:30:42] [INFO ] Flatten gal took : 98 ms
[2024-05-29 17:30:42] [INFO ] Applying decomposition
[2024-05-29 17:30:42] [INFO ] Flatten gal took : 91 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph76306002011363530.txt' '-o' '/tmp/graph76306002011363530.bin' '-w' '/tmp/graph76306002011363530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph76306002011363530.bin' '-l' '-1' '-v' '-w' '/tmp/graph76306002011363530.weights' '-q' '0' '-e' '0.001'
[2024-05-29 17:30:42] [INFO ] Decomposing Gal with order
[2024-05-29 17:30:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 17:30:43] [INFO ] Removed a total of 494 redundant transitions.
[2024-05-29 17:30:43] [INFO ] Flatten gal took : 227 ms
[2024-05-29 17:30:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 1678 labels/synchronizations in 84 ms.
[2024-05-29 17:30:43] [INFO ] Time to serialize gal into /tmp/LTL926351492304344481.gal : 34 ms
[2024-05-29 17:30:43] [INFO ] Time to serialize properties into /tmp/LTL15053214335236843450.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL926351492304344481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15053214335236843450.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((i42.u243.Eat_431==0)||(i11.i0.i0.u121.Catch1_104==1))"))))||(G(("((i38.i1.i1.u443.Fork_306==0)||(i6.i1.i1.u417.Think_430=...298
Formula 0 simplified : XXG!"((i42.u243.Eat_431==0)||(i11.i0.i0.u121.Catch1_104==1))" & F(!"((i38.i1.i1.u443.Fork_306==0)||(i6.i1.i1.u417.Think_430==1))" | ...284
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
1062 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,11.0579,192520,1,0,363790,733,8189,705760,381,2742,276765
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000500-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Philosophers-PT-000500-LTLCardinality-09 finished in 175251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 499
Deduced a syphon composed of 499 places in 1 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 0 with 998 rules applied. Total rules applied 998 place count 2001 transition count 2001
Applied a total of 998 rules in 313 ms. Remains 2001 /2500 variables (removed 499) and now considering 2001/2500 (removed 499) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2024-05-29 17:30:56] [INFO ] Computed 1000 invariants in 11 ms
[2024-05-29 17:30:58] [INFO ] Implicit Places using invariants in 2894 ms returned []
[2024-05-29 17:30:58] [INFO ] Invariant cache hit.
[2024-05-29 17:31:01] [INFO ] Implicit Places using invariants and state equation in 2533 ms returned []
Implicit Place search using SMT with State Equation took 5437 ms to find 0 implicit places.
[2024-05-29 17:31:01] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-29 17:31:01] [INFO ] Invariant cache hit.
[2024-05-29 17:31:03] [INFO ] Dead Transitions using invariants and state equation in 2031 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2001/2500 places, 2001/2500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7843 ms. Remains : 2001/2500 places, 2001/2500 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s1095 1) (NOT (OR (EQ s417 0) (EQ s1825 1)))), p0:(OR (EQ s417 0) (EQ s1825 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 2874 ms.
Stack based approach found an accepted trace after 238 steps with 0 reset with depth 239 and stack size 239 in 36 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-12 finished in 10922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 93 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2024-05-29 17:31:06] [INFO ] Computed 1000 invariants in 8 ms
[2024-05-29 17:31:09] [INFO ] Implicit Places using invariants in 2528 ms returned []
[2024-05-29 17:31:09] [INFO ] Invariant cache hit.
[2024-05-29 17:31:09] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 3187 ms to find 0 implicit places.
[2024-05-29 17:31:09] [INFO ] Invariant cache hit.
[2024-05-29 17:31:10] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4067 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s532 0) (EQ s1221 1)), p0:(AND (EQ s884 0) (EQ s1504 1))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-13 finished in 4260 ms.
All properties solved by simple procedures.
Total runtime 318272 ms.
BK_STOP 1717003871947
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Philosophers-PT-000500, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-smll-171654422500332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000500.tgz
mv Philosophers-PT-000500 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;