About the Execution of 2023-gold for ShieldPPPs-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16197.703 | 3600000.00 | 11666862.00 | 8780.10 | ?F??F?F??FFFFFF? | 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.r373-tall-171683789000308.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 ShieldPPPs-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789000308
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 13 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 708K 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 ShieldPPPs-PT-040B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716977084019
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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-040B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 10:04:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 10:04:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:04:46] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-05-29 10:04:46] [INFO ] Transformed 2723 places.
[2024-05-29 10:04:46] [INFO ] Transformed 2523 transitions.
[2024-05-29 10:04:46] [INFO ] Found NUPN structural information;
[2024-05-29 10:04:46] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 733 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-040B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 2723 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Discarding 268 places :
Symmetric choice reduction at 0 with 268 rule applications. Total rules 268 place count 2455 transition count 2255
Iterating global reduction 0 with 268 rules applied. Total rules applied 536 place count 2455 transition count 2255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 537 place count 2454 transition count 2254
Iterating global reduction 0 with 1 rules applied. Total rules applied 538 place count 2454 transition count 2254
Applied a total of 538 rules in 835 ms. Remains 2454 /2723 variables (removed 269) and now considering 2254/2523 (removed 269) transitions.
// Phase 1: matrix 2254 rows 2454 cols
[2024-05-29 10:04:47] [INFO ] Computed 441 invariants in 42 ms
[2024-05-29 10:04:48] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2024-05-29 10:04:48] [INFO ] Invariant cache hit.
[2024-05-29 10:04:51] [INFO ] Implicit Places using invariants and state equation in 2766 ms returned []
Implicit Place search using SMT with State Equation took 4148 ms to find 0 implicit places.
[2024-05-29 10:04:51] [INFO ] Invariant cache hit.
[2024-05-29 10:04:53] [INFO ] Dead Transitions using invariants and state equation in 1538 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2454/2723 places, 2254/2523 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6523 ms. Remains : 2454/2723 places, 2254/2523 transitions.
Support contains 44 out of 2454 places after structural reductions.
[2024-05-29 10:04:53] [INFO ] Flatten gal took : 183 ms
[2024-05-29 10:04:53] [INFO ] Flatten gal took : 103 ms
[2024-05-29 10:04:53] [INFO ] Input system was already deterministic with 2254 transitions.
Support contains 41 out of 2454 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=15 ) properties (out of 29) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-29 10:04:55] [INFO ] Invariant cache hit.
[2024-05-29 10:04:55] [INFO ] [Real]Absence check using 441 positive place invariants in 163 ms returned sat
[2024-05-29 10:04:55] [INFO ] After 836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 10:04:56] [INFO ] [Nat]Absence check using 441 positive place invariants in 169 ms returned sat
[2024-05-29 10:04:58] [INFO ] After 1823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 10:04:59] [INFO ] Deduced a trap composed of 19 places in 669 ms of which 9 ms to minimize.
[2024-05-29 10:05:00] [INFO ] Deduced a trap composed of 15 places in 654 ms of which 2 ms to minimize.
[2024-05-29 10:05:00] [INFO ] Deduced a trap composed of 25 places in 672 ms of which 2 ms to minimize.
[2024-05-29 10:05:01] [INFO ] Deduced a trap composed of 18 places in 655 ms of which 2 ms to minimize.
[2024-05-29 10:05:02] [INFO ] Deduced a trap composed of 31 places in 910 ms of which 4 ms to minimize.
[2024-05-29 10:05:03] [INFO ] Deduced a trap composed of 21 places in 677 ms of which 5 ms to minimize.
[2024-05-29 10:05:04] [INFO ] Deduced a trap composed of 23 places in 648 ms of which 2 ms to minimize.
[2024-05-29 10:05:04] [INFO ] Deduced a trap composed of 25 places in 616 ms of which 1 ms to minimize.
[2024-05-29 10:05:05] [INFO ] Deduced a trap composed of 26 places in 662 ms of which 1 ms to minimize.
[2024-05-29 10:05:06] [INFO ] Deduced a trap composed of 21 places in 601 ms of which 1 ms to minimize.
[2024-05-29 10:05:06] [INFO ] Deduced a trap composed of 24 places in 589 ms of which 5 ms to minimize.
[2024-05-29 10:05:07] [INFO ] Deduced a trap composed of 27 places in 584 ms of which 2 ms to minimize.
[2024-05-29 10:05:08] [INFO ] Deduced a trap composed of 63 places in 586 ms of which 1 ms to minimize.
[2024-05-29 10:05:09] [INFO ] Deduced a trap composed of 19 places in 595 ms of which 2 ms to minimize.
[2024-05-29 10:05:09] [INFO ] Deduced a trap composed of 27 places in 602 ms of which 3 ms to minimize.
[2024-05-29 10:05:10] [INFO ] Deduced a trap composed of 28 places in 631 ms of which 1 ms to minimize.
[2024-05-29 10:05:11] [INFO ] Deduced a trap composed of 27 places in 581 ms of which 1 ms to minimize.
[2024-05-29 10:05:11] [INFO ] Deduced a trap composed of 29 places in 620 ms of which 1 ms to minimize.
[2024-05-29 10:05:12] [INFO ] Deduced a trap composed of 31 places in 627 ms of which 1 ms to minimize.
[2024-05-29 10:05:13] [INFO ] Deduced a trap composed of 41 places in 658 ms of which 1 ms to minimize.
[2024-05-29 10:05:13] [INFO ] Deduced a trap composed of 33 places in 625 ms of which 2 ms to minimize.
[2024-05-29 10:05:14] [INFO ] Deduced a trap composed of 43 places in 632 ms of which 2 ms to minimize.
[2024-05-29 10:05:15] [INFO ] Deduced a trap composed of 35 places in 596 ms of which 2 ms to minimize.
[2024-05-29 10:05:15] [INFO ] Deduced a trap composed of 36 places in 592 ms of which 2 ms to minimize.
[2024-05-29 10:05:16] [INFO ] Deduced a trap composed of 47 places in 594 ms of which 1 ms to minimize.
[2024-05-29 10:05:17] [INFO ] Deduced a trap composed of 28 places in 513 ms of which 1 ms to minimize.
[2024-05-29 10:05:17] [INFO ] Deduced a trap composed of 31 places in 487 ms of which 1 ms to minimize.
[2024-05-29 10:05:18] [INFO ] Deduced a trap composed of 40 places in 446 ms of which 1 ms to minimize.
[2024-05-29 10:05:18] [INFO ] Deduced a trap composed of 38 places in 432 ms of which 1 ms to minimize.
[2024-05-29 10:05:19] [INFO ] Deduced a trap composed of 28 places in 454 ms of which 1 ms to minimize.
[2024-05-29 10:05:19] [INFO ] Deduced a trap composed of 40 places in 461 ms of which 1 ms to minimize.
[2024-05-29 10:05:20] [INFO ] Deduced a trap composed of 39 places in 376 ms of which 1 ms to minimize.
[2024-05-29 10:05:20] [INFO ] Deduced a trap composed of 31 places in 420 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 10:05:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:05:20] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 666 ms.
Support contains 13 out of 2454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 2454 transition count 1977
Reduce places removed 277 places and 0 transitions.
Iterating post reduction 1 with 277 rules applied. Total rules applied 554 place count 2177 transition count 1977
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 554 place count 2177 transition count 1776
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 956 place count 1976 transition count 1776
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 966 place count 1966 transition count 1766
Iterating global reduction 2 with 10 rules applied. Total rules applied 976 place count 1966 transition count 1766
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 976 place count 1966 transition count 1760
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 988 place count 1960 transition count 1760
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2408 place count 1250 transition count 1050
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 351 times.
Drop transitions removed 351 transitions
Iterating global reduction 2 with 351 rules applied. Total rules applied 2759 place count 1250 transition count 1050
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2760 place count 1249 transition count 1049
Applied a total of 2760 rules in 618 ms. Remains 1249 /2454 variables (removed 1205) and now considering 1049/2254 (removed 1205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 619 ms. Remains : 1249/2454 places, 1049/2254 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1049 rows 1249 cols
[2024-05-29 10:05:22] [INFO ] Computed 441 invariants in 48 ms
[2024-05-29 10:05:22] [INFO ] [Real]Absence check using 415 positive place invariants in 72 ms returned sat
[2024-05-29 10:05:22] [INFO ] [Real]Absence check using 415 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-29 10:05:23] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:05:23] [INFO ] [Nat]Absence check using 415 positive place invariants in 76 ms returned sat
[2024-05-29 10:05:23] [INFO ] [Nat]Absence check using 415 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-29 10:05:24] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:05:24] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-29 10:05:24] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2024-05-29 10:05:24] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2024-05-29 10:05:24] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 10:05:25] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 10:05:25] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2024-05-29 10:05:25] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2024-05-29 10:05:25] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2024-05-29 10:05:25] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2024-05-29 10:05:26] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-29 10:05:26] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2024-05-29 10:05:26] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 10:05:26] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2024-05-29 10:05:26] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2024-05-29 10:05:27] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2024-05-29 10:05:27] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-05-29 10:05:27] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2024-05-29 10:05:27] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3215 ms
[2024-05-29 10:05:27] [INFO ] After 3790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-29 10:05:27] [INFO ] After 4103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1049/1049 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1249 transition count 1047
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1247 transition count 1047
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1247 transition count 1046
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1246 transition count 1046
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1243 transition count 1043
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 1243 transition count 1043
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 1242 transition count 1042
Applied a total of 15 rules in 191 ms. Remains 1242 /1249 variables (removed 7) and now considering 1042/1049 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 1242/1249 places, 1042/1049 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 183797 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183797 steps, saw 169456 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1042 rows 1242 cols
[2024-05-29 10:05:30] [INFO ] Computed 441 invariants in 27 ms
[2024-05-29 10:05:31] [INFO ] [Real]Absence check using 421 positive place invariants in 66 ms returned sat
[2024-05-29 10:05:31] [INFO ] [Real]Absence check using 421 positive and 20 generalized place invariants in 4 ms returned sat
[2024-05-29 10:05:31] [INFO ] After 774ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:05:31] [INFO ] [Nat]Absence check using 421 positive place invariants in 76 ms returned sat
[2024-05-29 10:05:31] [INFO ] [Nat]Absence check using 421 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-29 10:05:32] [INFO ] After 602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:05:32] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-05-29 10:05:32] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-29 10:05:32] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 10:05:32] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2024-05-29 10:05:33] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-29 10:05:33] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-29 10:05:33] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2024-05-29 10:05:33] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-29 10:05:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 914 ms
[2024-05-29 10:05:33] [INFO ] After 1556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-29 10:05:33] [INFO ] After 1861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1042/1042 transitions.
Applied a total of 0 rules in 41 ms. Remains 1242 /1242 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1242/1242 places, 1042/1042 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1042/1042 transitions.
Applied a total of 0 rules in 38 ms. Remains 1242 /1242 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-05-29 10:05:33] [INFO ] Invariant cache hit.
[2024-05-29 10:05:34] [INFO ] Implicit Places using invariants in 794 ms returned []
[2024-05-29 10:05:34] [INFO ] Invariant cache hit.
[2024-05-29 10:05:36] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 2501 ms to find 0 implicit places.
[2024-05-29 10:05:36] [INFO ] Redundant transitions in 66 ms returned []
[2024-05-29 10:05:36] [INFO ] Invariant cache hit.
[2024-05-29 10:05:36] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3275 ms. Remains : 1242/1242 places, 1042/1042 transitions.
Applied a total of 0 rules in 35 ms. Remains 1242 /1242 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 10:05:36] [INFO ] Invariant cache hit.
[2024-05-29 10:05:37] [INFO ] [Real]Absence check using 421 positive place invariants in 75 ms returned sat
[2024-05-29 10:05:37] [INFO ] [Real]Absence check using 421 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-29 10:05:37] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:05:37] [INFO ] [Nat]Absence check using 421 positive place invariants in 71 ms returned sat
[2024-05-29 10:05:37] [INFO ] [Nat]Absence check using 421 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-29 10:05:38] [INFO ] After 534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:05:38] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2024-05-29 10:05:38] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-29 10:05:38] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-29 10:05:38] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2024-05-29 10:05:39] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 2 ms to minimize.
[2024-05-29 10:05:39] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2024-05-29 10:05:39] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2024-05-29 10:05:39] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-05-29 10:05:39] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2024-05-29 10:05:39] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2024-05-29 10:05:39] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 0 ms to minimize.
[2024-05-29 10:05:39] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-29 10:05:40] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2024-05-29 10:05:40] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-29 10:05:40] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-29 10:05:40] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2024-05-29 10:05:40] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2024-05-29 10:05:40] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-05-29 10:05:40] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2024-05-29 10:05:40] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2347 ms
[2024-05-29 10:05:40] [INFO ] After 2919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-29 10:05:40] [INFO ] After 3211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldPPPs-PT-040B-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 488 stabilizing places and 488 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' '!((F((p0||(p1 U p2)))||(X(G(p3))&&G(p1))))'
Support contains 4 out of 2454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2445 transition count 2245
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2445 transition count 2245
Applied a total of 18 rules in 193 ms. Remains 2445 /2454 variables (removed 9) and now considering 2245/2254 (removed 9) transitions.
// Phase 1: matrix 2245 rows 2445 cols
[2024-05-29 10:05:41] [INFO ] Computed 441 invariants in 14 ms
[2024-05-29 10:05:42] [INFO ] Implicit Places using invariants in 1128 ms returned []
[2024-05-29 10:05:42] [INFO ] Invariant cache hit.
[2024-05-29 10:05:45] [INFO ] Implicit Places using invariants and state equation in 2767 ms returned []
Implicit Place search using SMT with State Equation took 3897 ms to find 0 implicit places.
[2024-05-29 10:05:45] [INFO ] Invariant cache hit.
[2024-05-29 10:05:46] [INFO ] Dead Transitions using invariants and state equation in 1591 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2445/2454 places, 2245/2254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5683 ms. Remains : 2445/2454 places, 2245/2254 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 267 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1705 1), p2:(EQ s1847 1), p1:(EQ s454 1), p3:(EQ s1697 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][false, false, false]]
Product exploration explored 100000 steps with 830 reset in 525 ms.
Product exploration explored 100000 steps with 835 reset in 466 ms.
Computed a total of 482 stabilizing places and 482 stable transitions
Computed a total of 482 stabilizing places and 482 stable transitions
Detected a total of 482/2445 stabilizing places and 482/2245 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p2))), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 326 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 112 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p2))), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 393 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-29 10:05:49] [INFO ] Invariant cache hit.
[2024-05-29 10:05:51] [INFO ] [Real]Absence check using 441 positive place invariants in 841 ms returned sat
[2024-05-29 10:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:06:04] [INFO ] [Real]Absence check using state equation in 12564 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 2445 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2445/2445 places, 2245/2245 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2444 transition count 1964
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2164 transition count 1964
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 560 place count 2164 transition count 1765
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 958 place count 1965 transition count 1765
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 1 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2390 place count 1249 transition count 1049
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2392 place count 1247 transition count 1047
Applied a total of 2392 rules in 349 ms. Remains 1247 /2445 variables (removed 1198) and now considering 1047/2245 (removed 1198) transitions.
// Phase 1: matrix 1047 rows 1247 cols
[2024-05-29 10:06:04] [INFO ] Computed 441 invariants in 3 ms
[2024-05-29 10:06:05] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-05-29 10:06:05] [INFO ] Invariant cache hit.
[2024-05-29 10:06:06] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
[2024-05-29 10:06:06] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 10:06:06] [INFO ] Invariant cache hit.
[2024-05-29 10:06:07] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/2445 places, 1047/2245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3260 ms. Remains : 1247/2445 places, 1047/2245 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/1247 stabilizing places and 6/1047 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 349 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-29 10:06:08] [INFO ] Invariant cache hit.
[2024-05-29 10:06:09] [INFO ] [Real]Absence check using 441 positive place invariants in 258 ms returned sat
[2024-05-29 10:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:06:13] [INFO ] [Real]Absence check using state equation in 4127 ms returned sat
[2024-05-29 10:06:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:06:14] [INFO ] [Nat]Absence check using 441 positive place invariants in 284 ms returned sat
[2024-05-29 10:06:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:06:17] [INFO ] [Nat]Absence check using state equation in 2821 ms returned sat
[2024-05-29 10:06:17] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2024-05-29 10:06:17] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 0 ms to minimize.
[2024-05-29 10:06:18] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2024-05-29 10:06:18] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2024-05-29 10:06:18] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2024-05-29 10:06:18] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2024-05-29 10:06:19] [INFO ] Deduced a trap composed of 28 places in 603 ms of which 0 ms to minimize.
[2024-05-29 10:06:19] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2024-05-29 10:06:19] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-29 10:06:19] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2024-05-29 10:06:19] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2024-05-29 10:06:19] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-29 10:06:20] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-29 10:06:20] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 0 ms to minimize.
[2024-05-29 10:06:20] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 0 ms to minimize.
[2024-05-29 10:06:20] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2930 ms
[2024-05-29 10:06:20] [INFO ] Computed and/alt/rep : 1042/2037/1042 causal constraints (skipped 0 transitions) in 66 ms.
[2024-05-29 10:06:28] [INFO ] Added : 410 causal constraints over 82 iterations in 8177 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 28268 reset in 1181 ms.
Product exploration explored 100000 steps with 28298 reset in 1327 ms.
Built C files in :
/tmp/ltsmin7774212523501272522
[2024-05-29 10:06:31] [INFO ] Computing symmetric may disable matrix : 1047 transitions.
[2024-05-29 10:06:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:06:31] [INFO ] Computing symmetric may enable matrix : 1047 transitions.
[2024-05-29 10:06:31] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:06:31] [INFO ] Computing Do-Not-Accords matrix : 1047 transitions.
[2024-05-29 10:06:31] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:06:31] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7774212523501272522
Running compilation step : cd /tmp/ltsmin7774212523501272522;'/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/ltsmin7774212523501272522;'/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/ltsmin7774212523501272522;'/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 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1247/1247 places, 1047/1047 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1245 transition count 1045
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1244 transition count 1044
Applied a total of 3 rules in 196 ms. Remains 1244 /1247 variables (removed 3) and now considering 1044/1047 (removed 3) transitions.
// Phase 1: matrix 1044 rows 1244 cols
[2024-05-29 10:06:34] [INFO ] Computed 441 invariants in 4 ms
[2024-05-29 10:06:35] [INFO ] Implicit Places using invariants in 882 ms returned []
[2024-05-29 10:06:35] [INFO ] Invariant cache hit.
[2024-05-29 10:06:36] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 2234 ms to find 0 implicit places.
[2024-05-29 10:06:36] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 10:06:36] [INFO ] Invariant cache hit.
[2024-05-29 10:06:37] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1244/1247 places, 1044/1047 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3143 ms. Remains : 1244/1247 places, 1044/1047 transitions.
Built C files in :
/tmp/ltsmin9704940199751360819
[2024-05-29 10:06:37] [INFO ] Computing symmetric may disable matrix : 1044 transitions.
[2024-05-29 10:06:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:06:37] [INFO ] Computing symmetric may enable matrix : 1044 transitions.
[2024-05-29 10:06:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:06:37] [INFO ] Computing Do-Not-Accords matrix : 1044 transitions.
[2024-05-29 10:06:37] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:06:37] [INFO ] Built C files in 205ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9704940199751360819
Running compilation step : cd /tmp/ltsmin9704940199751360819;'/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/ltsmin9704940199751360819;'/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/ltsmin9704940199751360819;'/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 10:06:40] [INFO ] Flatten gal took : 46 ms
[2024-05-29 10:06:41] [INFO ] Flatten gal took : 79 ms
[2024-05-29 10:06:41] [INFO ] Time to serialize gal into /tmp/LTL7176865054315872720.gal : 31 ms
[2024-05-29 10:06:41] [INFO ] Time to serialize properties into /tmp/LTL15671209387165593802.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7176865054315872720.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14298597565895138307.hoa' '-atoms' '/tmp/LTL15671209387165593802.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/LTL15671209387165593802.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14298597565895138307.hoa
Detected timeout of ITS tools.
[2024-05-29 10:06:56] [INFO ] Flatten gal took : 85 ms
[2024-05-29 10:06:56] [INFO ] Flatten gal took : 56 ms
[2024-05-29 10:06:56] [INFO ] Time to serialize gal into /tmp/LTL927460449631982096.gal : 8 ms
[2024-05-29 10:06:56] [INFO ] Time to serialize properties into /tmp/LTL6872543591057386623.ltl : 3 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/LTL927460449631982096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6872543591057386623.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...274
Read 1 LTL properties
Checking formula 0 : !(((F(("(p1894==1)")||(("(p500==1)")U("(p2054==1)"))))||((X(G("(p1885==1)")))&&(G("(p500==1)")))))
Formula 0 simplified : G(!"(p1894==1)" & (!"(p500==1)" R !"(p2054==1)")) & (XF!"(p1885==1)" | F!"(p500==1)")
Detected timeout of ITS tools.
[2024-05-29 10:07:11] [INFO ] Flatten gal took : 43 ms
[2024-05-29 10:07:11] [INFO ] Applying decomposition
[2024-05-29 10:07:11] [INFO ] Flatten gal took : 36 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/graph9373206640159363941.txt' '-o' '/tmp/graph9373206640159363941.bin' '-w' '/tmp/graph9373206640159363941.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9373206640159363941.bin' '-l' '-1' '-v' '-w' '/tmp/graph9373206640159363941.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:07:12] [INFO ] Decomposing Gal with order
[2024-05-29 10:07:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:07:12] [INFO ] Removed a total of 242 redundant transitions.
[2024-05-29 10:07:12] [INFO ] Flatten gal took : 191 ms
[2024-05-29 10:07:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 472 labels/synchronizations in 43 ms.
[2024-05-29 10:07:12] [INFO ] Time to serialize gal into /tmp/LTL9995394483199643773.gal : 36 ms
[2024-05-29 10:07:12] [INFO ] Time to serialize properties into /tmp/LTL4223702965821559236.ltl : 11 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/LTL9995394483199643773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4223702965821559236.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 : !(((F(("(i27.i0.u308.p1894==1)")||(("(i6.i2.u76.p500==1)")U("(i30.i0.u333.p2054==1)"))))||((X(G("(i27.i1.u307.p1885==1)")))&&(G("(i6.i...175
Formula 0 simplified : G(!"(i27.i0.u308.p1894==1)" & (!"(i6.i2.u76.p500==1)" R !"(i30.i0.u333.p2054==1)")) & (XF!"(i27.i1.u307.p1885==1)" | F!"(i6.i2.u76.p...164
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17067330505482279456
[2024-05-29 10:07:27] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17067330505482279456
Running compilation step : cd /tmp/ltsmin17067330505482279456;'/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'
Compilation finished in 1836 ms.
Running link step : cd /tmp/ltsmin17067330505482279456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17067330505482279456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true))))||(X([]((LTLAPp3==true)))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-00 finished in 121772 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)))'
Support contains 1 out of 2454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 2453 transition count 1971
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 564 place count 2171 transition count 1971
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 564 place count 2171 transition count 1771
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 964 place count 1971 transition count 1771
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 975 place count 1960 transition count 1760
Iterating global reduction 2 with 11 rules applied. Total rules applied 986 place count 1960 transition count 1760
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 986 place count 1960 transition count 1754
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 998 place count 1954 transition count 1754
Performed 711 Post agglomeration using F-continuation condition.Transition count delta: 711
Deduced a syphon composed of 711 places in 1 ms
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 2 with 1422 rules applied. Total rules applied 2420 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2422 place count 1241 transition count 1041
Applied a total of 2422 rules in 368 ms. Remains 1241 /2454 variables (removed 1213) and now considering 1041/2254 (removed 1213) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2024-05-29 10:07:43] [INFO ] Computed 441 invariants in 3 ms
[2024-05-29 10:07:44] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-05-29 10:07:44] [INFO ] Invariant cache hit.
[2024-05-29 10:07:45] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
[2024-05-29 10:07:45] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 10:07:45] [INFO ] Invariant cache hit.
[2024-05-29 10:07:46] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1241/2454 places, 1041/2254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3309 ms. Remains : 1241/2454 places, 1041/2254 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s208 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5254 steps with 1 reset in 53 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-01 finished in 3476 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||X(X(X(p1))))))))'
Support contains 6 out of 2454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2442 transition count 2242
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2442 transition count 2242
Applied a total of 24 rules in 198 ms. Remains 2442 /2454 variables (removed 12) and now considering 2242/2254 (removed 12) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2024-05-29 10:07:46] [INFO ] Computed 441 invariants in 11 ms
[2024-05-29 10:07:47] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2024-05-29 10:07:47] [INFO ] Invariant cache hit.
[2024-05-29 10:07:50] [INFO ] Implicit Places using invariants and state equation in 2739 ms returned []
Implicit Place search using SMT with State Equation took 3755 ms to find 0 implicit places.
[2024-05-29 10:07:50] [INFO ] Invariant cache hit.
[2024-05-29 10:07:52] [INFO ] Dead Transitions using invariants and state equation in 1590 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2454 places, 2242/2254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5546 ms. Remains : 2442/2454 places, 2242/2254 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (EQ s598 0) (EQ s600 0)) (OR (EQ s2353 0) (EQ s2370 0))), p1:(OR (EQ s895 0) (EQ s1269 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 78 reset in 834 ms.
Product exploration explored 100000 steps with 83 reset in 895 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p0 p1), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 10:07:54] [INFO ] Invariant cache hit.
[2024-05-29 10:07:54] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:07:55] [INFO ] [Nat]Absence check using 441 positive place invariants in 164 ms returned sat
[2024-05-29 10:07:56] [INFO ] After 1216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:07:57] [INFO ] Deduced a trap composed of 30 places in 560 ms of which 2 ms to minimize.
[2024-05-29 10:07:57] [INFO ] Deduced a trap composed of 38 places in 542 ms of which 1 ms to minimize.
[2024-05-29 10:07:58] [INFO ] Deduced a trap composed of 26 places in 582 ms of which 3 ms to minimize.
[2024-05-29 10:07:59] [INFO ] Deduced a trap composed of 12 places in 575 ms of which 2 ms to minimize.
[2024-05-29 10:07:59] [INFO ] Deduced a trap composed of 29 places in 573 ms of which 2 ms to minimize.
[2024-05-29 10:08:00] [INFO ] Deduced a trap composed of 34 places in 530 ms of which 1 ms to minimize.
[2024-05-29 10:08:00] [INFO ] Deduced a trap composed of 20 places in 527 ms of which 1 ms to minimize.
[2024-05-29 10:08:01] [INFO ] Deduced a trap composed of 20 places in 524 ms of which 2 ms to minimize.
[2024-05-29 10:08:02] [INFO ] Deduced a trap composed of 33 places in 530 ms of which 1 ms to minimize.
[2024-05-29 10:08:02] [INFO ] Deduced a trap composed of 29 places in 492 ms of which 2 ms to minimize.
[2024-05-29 10:08:03] [INFO ] Deduced a trap composed of 40 places in 521 ms of which 1 ms to minimize.
[2024-05-29 10:08:03] [INFO ] Deduced a trap composed of 34 places in 512 ms of which 1 ms to minimize.
[2024-05-29 10:08:04] [INFO ] Deduced a trap composed of 28 places in 506 ms of which 6 ms to minimize.
[2024-05-29 10:08:05] [INFO ] Deduced a trap composed of 26 places in 512 ms of which 2 ms to minimize.
[2024-05-29 10:08:05] [INFO ] Deduced a trap composed of 29 places in 550 ms of which 2 ms to minimize.
[2024-05-29 10:08:06] [INFO ] Deduced a trap composed of 25 places in 523 ms of which 1 ms to minimize.
[2024-05-29 10:08:06] [INFO ] Deduced a trap composed of 25 places in 518 ms of which 6 ms to minimize.
[2024-05-29 10:08:07] [INFO ] Deduced a trap composed of 26 places in 509 ms of which 2 ms to minimize.
[2024-05-29 10:08:08] [INFO ] Deduced a trap composed of 36 places in 488 ms of which 2 ms to minimize.
[2024-05-29 10:08:08] [INFO ] Deduced a trap composed of 38 places in 455 ms of which 1 ms to minimize.
[2024-05-29 10:08:09] [INFO ] Deduced a trap composed of 16 places in 450 ms of which 1 ms to minimize.
[2024-05-29 10:08:09] [INFO ] Deduced a trap composed of 39 places in 472 ms of which 2 ms to minimize.
[2024-05-29 10:08:10] [INFO ] Deduced a trap composed of 35 places in 475 ms of which 1 ms to minimize.
[2024-05-29 10:08:10] [INFO ] Deduced a trap composed of 38 places in 477 ms of which 1 ms to minimize.
[2024-05-29 10:08:11] [INFO ] Deduced a trap composed of 35 places in 485 ms of which 1 ms to minimize.
[2024-05-29 10:08:11] [INFO ] Deduced a trap composed of 32 places in 477 ms of which 2 ms to minimize.
[2024-05-29 10:08:12] [INFO ] Deduced a trap composed of 34 places in 464 ms of which 1 ms to minimize.
[2024-05-29 10:08:13] [INFO ] Deduced a trap composed of 30 places in 464 ms of which 1 ms to minimize.
[2024-05-29 10:08:13] [INFO ] Deduced a trap composed of 49 places in 452 ms of which 1 ms to minimize.
[2024-05-29 10:08:14] [INFO ] Deduced a trap composed of 52 places in 456 ms of which 1 ms to minimize.
[2024-05-29 10:08:14] [INFO ] Deduced a trap composed of 18 places in 445 ms of which 1 ms to minimize.
[2024-05-29 10:08:15] [INFO ] Deduced a trap composed of 20 places in 445 ms of which 1 ms to minimize.
[2024-05-29 10:08:15] [INFO ] Deduced a trap composed of 42 places in 448 ms of which 1 ms to minimize.
[2024-05-29 10:08:16] [INFO ] Deduced a trap composed of 37 places in 447 ms of which 1 ms to minimize.
[2024-05-29 10:08:16] [INFO ] Deduced a trap composed of 31 places in 391 ms of which 1 ms to minimize.
[2024-05-29 10:08:17] [INFO ] Deduced a trap composed of 37 places in 382 ms of which 1 ms to minimize.
[2024-05-29 10:08:17] [INFO ] Deduced a trap composed of 47 places in 358 ms of which 1 ms to minimize.
[2024-05-29 10:08:17] [INFO ] Deduced a trap composed of 50 places in 366 ms of which 1 ms to minimize.
[2024-05-29 10:08:18] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 1 ms to minimize.
[2024-05-29 10:08:18] [INFO ] Deduced a trap composed of 32 places in 344 ms of which 2 ms to minimize.
[2024-05-29 10:08:19] [INFO ] Deduced a trap composed of 50 places in 367 ms of which 1 ms to minimize.
[2024-05-29 10:08:19] [INFO ] Deduced a trap composed of 40 places in 339 ms of which 1 ms to minimize.
[2024-05-29 10:08:20] [INFO ] Deduced a trap composed of 38 places in 340 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 10:08:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:08:20] [INFO ] After 25283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 2442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2442 transition count 1962
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2162 transition count 1962
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 560 place count 2162 transition count 1762
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 960 place count 1962 transition count 1762
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 1 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 2 with 1438 rules applied. Total rules applied 2398 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 355 times.
Drop transitions removed 355 transitions
Iterating global reduction 2 with 355 rules applied. Total rules applied 2753 place count 1243 transition count 1043
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2754 place count 1242 transition count 1042
Applied a total of 2754 rules in 301 ms. Remains 1242 /2442 variables (removed 1200) and now considering 1042/2242 (removed 1200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 1242/2442 places, 1042/2242 transitions.
Finished random walk after 1507 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 6 out of 2442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Applied a total of 0 rules in 103 ms. Remains 2442 /2442 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
[2024-05-29 10:08:21] [INFO ] Invariant cache hit.
[2024-05-29 10:08:22] [INFO ] Implicit Places using invariants in 1034 ms returned []
[2024-05-29 10:08:22] [INFO ] Invariant cache hit.
[2024-05-29 10:08:24] [INFO ] Implicit Places using invariants and state equation in 2753 ms returned []
Implicit Place search using SMT with State Equation took 3793 ms to find 0 implicit places.
[2024-05-29 10:08:24] [INFO ] Invariant cache hit.
[2024-05-29 10:08:26] [INFO ] Dead Transitions using invariants and state equation in 1648 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5550 ms. Remains : 2442/2442 places, 2242/2242 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p0 p1), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 10:08:27] [INFO ] Invariant cache hit.
[2024-05-29 10:08:27] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:08:27] [INFO ] [Nat]Absence check using 441 positive place invariants in 159 ms returned sat
[2024-05-29 10:08:29] [INFO ] After 1193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:08:29] [INFO ] Deduced a trap composed of 30 places in 573 ms of which 1 ms to minimize.
[2024-05-29 10:08:30] [INFO ] Deduced a trap composed of 38 places in 560 ms of which 2 ms to minimize.
[2024-05-29 10:08:31] [INFO ] Deduced a trap composed of 26 places in 559 ms of which 1 ms to minimize.
[2024-05-29 10:08:31] [INFO ] Deduced a trap composed of 12 places in 557 ms of which 3 ms to minimize.
[2024-05-29 10:08:32] [INFO ] Deduced a trap composed of 29 places in 554 ms of which 1 ms to minimize.
[2024-05-29 10:08:33] [INFO ] Deduced a trap composed of 34 places in 540 ms of which 1 ms to minimize.
[2024-05-29 10:08:33] [INFO ] Deduced a trap composed of 20 places in 504 ms of which 2 ms to minimize.
[2024-05-29 10:08:34] [INFO ] Deduced a trap composed of 20 places in 514 ms of which 1 ms to minimize.
[2024-05-29 10:08:34] [INFO ] Deduced a trap composed of 33 places in 499 ms of which 1 ms to minimize.
[2024-05-29 10:08:35] [INFO ] Deduced a trap composed of 29 places in 502 ms of which 2 ms to minimize.
[2024-05-29 10:08:35] [INFO ] Deduced a trap composed of 40 places in 497 ms of which 1 ms to minimize.
[2024-05-29 10:08:36] [INFO ] Deduced a trap composed of 34 places in 485 ms of which 2 ms to minimize.
[2024-05-29 10:08:37] [INFO ] Deduced a trap composed of 28 places in 492 ms of which 1 ms to minimize.
[2024-05-29 10:08:37] [INFO ] Deduced a trap composed of 26 places in 506 ms of which 1 ms to minimize.
[2024-05-29 10:08:38] [INFO ] Deduced a trap composed of 29 places in 546 ms of which 1 ms to minimize.
[2024-05-29 10:08:38] [INFO ] Deduced a trap composed of 25 places in 482 ms of which 2 ms to minimize.
[2024-05-29 10:08:39] [INFO ] Deduced a trap composed of 25 places in 478 ms of which 1 ms to minimize.
[2024-05-29 10:08:39] [INFO ] Deduced a trap composed of 26 places in 482 ms of which 1 ms to minimize.
[2024-05-29 10:08:40] [INFO ] Deduced a trap composed of 36 places in 410 ms of which 2 ms to minimize.
[2024-05-29 10:08:40] [INFO ] Deduced a trap composed of 38 places in 467 ms of which 2 ms to minimize.
[2024-05-29 10:08:41] [INFO ] Deduced a trap composed of 16 places in 446 ms of which 1 ms to minimize.
[2024-05-29 10:08:42] [INFO ] Deduced a trap composed of 39 places in 463 ms of which 1 ms to minimize.
[2024-05-29 10:08:42] [INFO ] Deduced a trap composed of 35 places in 479 ms of which 2 ms to minimize.
[2024-05-29 10:08:43] [INFO ] Deduced a trap composed of 38 places in 474 ms of which 1 ms to minimize.
[2024-05-29 10:08:43] [INFO ] Deduced a trap composed of 35 places in 460 ms of which 1 ms to minimize.
[2024-05-29 10:08:44] [INFO ] Deduced a trap composed of 32 places in 477 ms of which 2 ms to minimize.
[2024-05-29 10:08:44] [INFO ] Deduced a trap composed of 34 places in 471 ms of which 1 ms to minimize.
[2024-05-29 10:08:45] [INFO ] Deduced a trap composed of 30 places in 457 ms of which 1 ms to minimize.
[2024-05-29 10:08:45] [INFO ] Deduced a trap composed of 49 places in 450 ms of which 2 ms to minimize.
[2024-05-29 10:08:46] [INFO ] Deduced a trap composed of 52 places in 476 ms of which 1 ms to minimize.
[2024-05-29 10:08:46] [INFO ] Deduced a trap composed of 18 places in 443 ms of which 1 ms to minimize.
[2024-05-29 10:08:47] [INFO ] Deduced a trap composed of 20 places in 466 ms of which 1 ms to minimize.
[2024-05-29 10:08:48] [INFO ] Deduced a trap composed of 42 places in 461 ms of which 1 ms to minimize.
[2024-05-29 10:08:48] [INFO ] Deduced a trap composed of 37 places in 454 ms of which 1 ms to minimize.
[2024-05-29 10:08:49] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 1 ms to minimize.
[2024-05-29 10:08:49] [INFO ] Deduced a trap composed of 37 places in 392 ms of which 1 ms to minimize.
[2024-05-29 10:08:49] [INFO ] Deduced a trap composed of 47 places in 380 ms of which 2 ms to minimize.
[2024-05-29 10:08:50] [INFO ] Deduced a trap composed of 50 places in 399 ms of which 1 ms to minimize.
[2024-05-29 10:08:50] [INFO ] Deduced a trap composed of 29 places in 345 ms of which 1 ms to minimize.
[2024-05-29 10:08:51] [INFO ] Deduced a trap composed of 32 places in 316 ms of which 1 ms to minimize.
[2024-05-29 10:08:51] [INFO ] Deduced a trap composed of 50 places in 353 ms of which 1 ms to minimize.
[2024-05-29 10:08:52] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 1 ms to minimize.
[2024-05-29 10:08:52] [INFO ] Deduced a trap composed of 38 places in 336 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 10:08:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:08:52] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 2442 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2442 transition count 1962
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2162 transition count 1962
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 560 place count 2162 transition count 1762
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 960 place count 1962 transition count 1762
Performed 719 Post agglomeration using F-continuation condition.Transition count delta: 719
Deduced a syphon composed of 719 places in 2 ms
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 2 with 1438 rules applied. Total rules applied 2398 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 355 times.
Drop transitions removed 355 transitions
Iterating global reduction 2 with 355 rules applied. Total rules applied 2753 place count 1243 transition count 1043
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2754 place count 1242 transition count 1042
Applied a total of 2754 rules in 306 ms. Remains 1242 /2442 variables (removed 1200) and now considering 1042/2242 (removed 1200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 1242/2442 places, 1042/2242 transitions.
Finished random walk after 2269 steps, including 0 resets, run visited all 1 properties in 31 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 84 reset in 746 ms.
Product exploration explored 100000 steps with 56 reset in 965 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 6 out of 2442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2442 transition count 2242
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 279 place count 2442 transition count 2243
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 360 place count 2442 transition count 2243
Performed 838 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1198 places in 2 ms
Iterating global reduction 1 with 838 rules applied. Total rules applied 1198 place count 2442 transition count 2243
Renaming transitions due to excessive name length > 1024 char.
Discarding 282 places :
Symmetric choice reduction at 1 with 282 rule applications. Total rules 1480 place count 2160 transition count 1961
Deduced a syphon composed of 916 places in 2 ms
Iterating global reduction 1 with 282 rules applied. Total rules applied 1762 place count 2160 transition count 1961
Deduced a syphon composed of 916 places in 1 ms
Applied a total of 1762 rules in 956 ms. Remains 2160 /2442 variables (removed 282) and now considering 1961/2242 (removed 281) transitions.
[2024-05-29 10:08:59] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 1961 rows 2160 cols
[2024-05-29 10:08:59] [INFO ] Computed 441 invariants in 28 ms
[2024-05-29 10:09:00] [INFO ] Dead Transitions using invariants and state equation in 1351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2160/2442 places, 1961/2242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2363 ms. Remains : 2160/2442 places, 1961/2242 transitions.
Built C files in :
/tmp/ltsmin4623210563788954362
[2024-05-29 10:09:01] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4623210563788954362
Running compilation step : cd /tmp/ltsmin4623210563788954362;'/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/ltsmin4623210563788954362;'/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/ltsmin4623210563788954362;'/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 6 out of 2442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Applied a total of 0 rules in 109 ms. Remains 2442 /2442 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2024-05-29 10:09:04] [INFO ] Computed 441 invariants in 13 ms
[2024-05-29 10:09:05] [INFO ] Implicit Places using invariants in 996 ms returned []
[2024-05-29 10:09:05] [INFO ] Invariant cache hit.
[2024-05-29 10:09:07] [INFO ] Implicit Places using invariants and state equation in 2707 ms returned []
Implicit Place search using SMT with State Equation took 3705 ms to find 0 implicit places.
[2024-05-29 10:09:07] [INFO ] Invariant cache hit.
[2024-05-29 10:09:09] [INFO ] Dead Transitions using invariants and state equation in 1694 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5510 ms. Remains : 2442/2442 places, 2242/2242 transitions.
Built C files in :
/tmp/ltsmin7444685746548590188
[2024-05-29 10:09:09] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7444685746548590188
Running compilation step : cd /tmp/ltsmin7444685746548590188;'/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/ltsmin7444685746548590188;'/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/ltsmin7444685746548590188;'/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 10:09:12] [INFO ] Flatten gal took : 65 ms
[2024-05-29 10:09:12] [INFO ] Flatten gal took : 53 ms
[2024-05-29 10:09:12] [INFO ] Time to serialize gal into /tmp/LTL8296670874001417701.gal : 12 ms
[2024-05-29 10:09:12] [INFO ] Time to serialize properties into /tmp/LTL5780420880618260100.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8296670874001417701.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18039033787881583422.hoa' '-atoms' '/tmp/LTL5780420880618260100.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...318
Loading property file /tmp/LTL5780420880618260100.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18039033787881583422.hoa
Detected timeout of ITS tools.
[2024-05-29 10:09:28] [INFO ] Flatten gal took : 56 ms
[2024-05-29 10:09:28] [INFO ] Flatten gal took : 55 ms
[2024-05-29 10:09:28] [INFO ] Time to serialize gal into /tmp/LTL2976305893604681981.gal : 10 ms
[2024-05-29 10:09:28] [INFO ] Time to serialize properties into /tmp/LTL16653312178637967999.ltl : 276 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/LTL2976305893604681981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16653312178637967999.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(G((X(X(X("((p993==0)||(p1409==0))"))))||("(((p661==0)||(p663==0))&&((p2619==0)||(p2639==0)))"))))))
Formula 0 simplified : XXF(!"(((p661==0)||(p663==0))&&((p2619==0)||(p2639==0)))" & XXX!"((p993==0)||(p1409==0))")
Detected timeout of ITS tools.
[2024-05-29 10:09:43] [INFO ] Flatten gal took : 51 ms
[2024-05-29 10:09:43] [INFO ] Applying decomposition
[2024-05-29 10:09:43] [INFO ] Flatten gal took : 49 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/graph12213705898646866318.txt' '-o' '/tmp/graph12213705898646866318.bin' '-w' '/tmp/graph12213705898646866318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12213705898646866318.bin' '-l' '-1' '-v' '-w' '/tmp/graph12213705898646866318.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:09:43] [INFO ] Decomposing Gal with order
[2024-05-29 10:09:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:09:43] [INFO ] Removed a total of 360 redundant transitions.
[2024-05-29 10:09:44] [INFO ] Flatten gal took : 106 ms
[2024-05-29 10:09:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-29 10:09:44] [INFO ] Time to serialize gal into /tmp/LTL2272805678187529432.gal : 26 ms
[2024-05-29 10:09:44] [INFO ] Time to serialize properties into /tmp/LTL16641244523171075146.ltl : 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/LTL2272805678187529432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16641244523171075146.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...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X(X(X("((i14.i2.i0.u356.p993==0)||(i20.i0.i1.u503.p1409==0))"))))||("(((i9.i2.i0.u239.p661==0)||(i9.i2.i0.u240.p663==0))&&((...215
Formula 0 simplified : XXF(!"(((i9.i2.i0.u239.p661==0)||(i9.i2.i0.u240.p663==0))&&((i38.i2.i0.u932.p2619==0)||(i38.i2.i1.u938.p2639==0)))" & XXX!"((i14.i2....201
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18020463387088301908
[2024-05-29 10:09:59] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18020463387088301908
Running compilation step : cd /tmp/ltsmin18020463387088301908;'/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/ltsmin18020463387088301908;'/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/ltsmin18020463387088301908;'/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)
Treatment of property ShieldPPPs-PT-040B-LTLFireability-02 finished in 135767 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(p0))'
Support contains 2 out of 2454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2453 transition count 1972
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2172 transition count 1972
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 562 place count 2172 transition count 1771
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 964 place count 1971 transition count 1771
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 976 place count 1959 transition count 1759
Iterating global reduction 2 with 12 rules applied. Total rules applied 988 place count 1959 transition count 1759
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 988 place count 1959 transition count 1753
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1000 place count 1953 transition count 1753
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 1 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2420 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2422 place count 1241 transition count 1041
Applied a total of 2422 rules in 369 ms. Remains 1241 /2454 variables (removed 1213) and now considering 1041/2254 (removed 1213) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2024-05-29 10:10:02] [INFO ] Computed 441 invariants in 18 ms
[2024-05-29 10:10:03] [INFO ] Implicit Places using invariants in 684 ms returned []
[2024-05-29 10:10:03] [INFO ] Invariant cache hit.
[2024-05-29 10:10:04] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
[2024-05-29 10:10:04] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 10:10:04] [INFO ] Invariant cache hit.
[2024-05-29 10:10:05] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1241/2454 places, 1041/2254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3185 ms. Remains : 1241/2454 places, 1041/2254 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 41 reset in 954 ms.
Product exploration explored 100000 steps with 41 reset in 1164 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 2439 steps, including 0 resets, run visited all 1 properties in 33 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-29 10:10:08] [INFO ] Invariant cache hit.
[2024-05-29 10:10:09] [INFO ] [Real]Absence check using 441 positive place invariants in 289 ms returned sat
[2024-05-29 10:10:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:10:12] [INFO ] [Real]Absence check using state equation in 3594 ms returned sat
[2024-05-29 10:10:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:10:13] [INFO ] [Nat]Absence check using 441 positive place invariants in 299 ms returned sat
[2024-05-29 10:10:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:10:16] [INFO ] [Nat]Absence check using state equation in 2821 ms returned sat
[2024-05-29 10:10:16] [INFO ] Computed and/alt/rep : 1038/1999/1038 causal constraints (skipped 0 transitions) in 67 ms.
[2024-05-29 10:10:28] [INFO ] Deduced a trap composed of 2 places in 645 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 10:10:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 46 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2024-05-29 10:10:28] [INFO ] Invariant cache hit.
[2024-05-29 10:10:29] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-29 10:10:29] [INFO ] Invariant cache hit.
[2024-05-29 10:10:30] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1960 ms to find 0 implicit places.
[2024-05-29 10:10:30] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 10:10:30] [INFO ] Invariant cache hit.
[2024-05-29 10:10:31] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2674 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 2397 steps, including 0 resets, run visited all 1 properties in 29 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-29 10:10:31] [INFO ] Invariant cache hit.
[2024-05-29 10:10:32] [INFO ] [Real]Absence check using 441 positive place invariants in 296 ms returned sat
[2024-05-29 10:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:10:36] [INFO ] [Real]Absence check using state equation in 3488 ms returned sat
[2024-05-29 10:10:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:10:37] [INFO ] [Nat]Absence check using 441 positive place invariants in 277 ms returned sat
[2024-05-29 10:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:10:40] [INFO ] [Nat]Absence check using state equation in 2810 ms returned sat
[2024-05-29 10:10:40] [INFO ] Computed and/alt/rep : 1038/1999/1038 causal constraints (skipped 0 transitions) in 63 ms.
[2024-05-29 10:10:51] [INFO ] Added : 515 causal constraints over 103 iterations in 11112 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 41 reset in 928 ms.
Product exploration explored 100000 steps with 41 reset in 1129 ms.
Built C files in :
/tmp/ltsmin10627376478525775718
[2024-05-29 10:10:53] [INFO ] Computing symmetric may disable matrix : 1041 transitions.
[2024-05-29 10:10:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:10:53] [INFO ] Computing symmetric may enable matrix : 1041 transitions.
[2024-05-29 10:10:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:10:53] [INFO ] Computing Do-Not-Accords matrix : 1041 transitions.
[2024-05-29 10:10:53] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:10:53] [INFO ] Built C files in 186ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10627376478525775718
Running compilation step : cd /tmp/ltsmin10627376478525775718;'/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/ltsmin10627376478525775718;'/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/ltsmin10627376478525775718;'/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 2 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 36 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2024-05-29 10:10:56] [INFO ] Invariant cache hit.
[2024-05-29 10:10:57] [INFO ] Implicit Places using invariants in 695 ms returned []
[2024-05-29 10:10:57] [INFO ] Invariant cache hit.
[2024-05-29 10:10:58] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2024-05-29 10:10:58] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 10:10:58] [INFO ] Invariant cache hit.
[2024-05-29 10:10:59] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2741 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Built C files in :
/tmp/ltsmin13031137757412484336
[2024-05-29 10:10:59] [INFO ] Computing symmetric may disable matrix : 1041 transitions.
[2024-05-29 10:10:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:10:59] [INFO ] Computing symmetric may enable matrix : 1041 transitions.
[2024-05-29 10:10:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:10:59] [INFO ] Computing Do-Not-Accords matrix : 1041 transitions.
[2024-05-29 10:10:59] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:10:59] [INFO ] Built C files in 183ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13031137757412484336
Running compilation step : cd /tmp/ltsmin13031137757412484336;'/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/ltsmin13031137757412484336;'/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/ltsmin13031137757412484336;'/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 10:11:02] [INFO ] Flatten gal took : 28 ms
[2024-05-29 10:11:02] [INFO ] Flatten gal took : 27 ms
[2024-05-29 10:11:02] [INFO ] Time to serialize gal into /tmp/LTL15258315544531657293.gal : 5 ms
[2024-05-29 10:11:02] [INFO ] Time to serialize properties into /tmp/LTL5444626356604639465.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/LTL15258315544531657293.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7626016121002356224.hoa' '-atoms' '/tmp/LTL5444626356604639465.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...318
Loading property file /tmp/LTL5444626356604639465.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7626016121002356224.hoa
Detected timeout of ITS tools.
[2024-05-29 10:11:17] [INFO ] Flatten gal took : 27 ms
[2024-05-29 10:11:17] [INFO ] Flatten gal took : 28 ms
[2024-05-29 10:11:17] [INFO ] Time to serialize gal into /tmp/LTL10961023635420547610.gal : 5 ms
[2024-05-29 10:11:17] [INFO ] Time to serialize properties into /tmp/LTL15127811625033808837.ltl : 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/LTL10961023635420547610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15127811625033808837.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...277
Read 1 LTL properties
Checking formula 0 : !((F("((p42==1)&&(p61==1))")))
Formula 0 simplified : G!"((p42==1)&&(p61==1))"
Detected timeout of ITS tools.
[2024-05-29 10:11:32] [INFO ] Flatten gal took : 27 ms
[2024-05-29 10:11:32] [INFO ] Applying decomposition
[2024-05-29 10:11:32] [INFO ] Flatten gal took : 29 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/graph11516539256999738907.txt' '-o' '/tmp/graph11516539256999738907.bin' '-w' '/tmp/graph11516539256999738907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11516539256999738907.bin' '-l' '-1' '-v' '-w' '/tmp/graph11516539256999738907.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:11:32] [INFO ] Decomposing Gal with order
[2024-05-29 10:11:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:11:33] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-29 10:11:33] [INFO ] Flatten gal took : 52 ms
[2024-05-29 10:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 18 ms.
[2024-05-29 10:11:33] [INFO ] Time to serialize gal into /tmp/LTL5077809055751792850.gal : 20 ms
[2024-05-29 10:11:33] [INFO ] Time to serialize properties into /tmp/LTL10943562646914046244.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5077809055751792850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10943562646914046244.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...255
Read 1 LTL properties
Checking formula 0 : !((F("((i0.i1.u0.p42==1)&&(i0.i0.u4.p61==1))")))
Formula 0 simplified : G!"((i0.i1.u0.p42==1)&&(i0.i0.u4.p61==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9219638102152984283
[2024-05-29 10:11:48] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9219638102152984283
Running compilation step : cd /tmp/ltsmin9219638102152984283;'/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'
Compilation finished in 1859 ms.
Running link step : cd /tmp/ltsmin9219638102152984283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9219638102152984283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-03 finished in 121048 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 2 out of 2454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 2453 transition count 1971
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 564 place count 2171 transition count 1971
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 564 place count 2171 transition count 1771
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 964 place count 1971 transition count 1771
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 976 place count 1959 transition count 1759
Iterating global reduction 2 with 12 rules applied. Total rules applied 988 place count 1959 transition count 1759
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 988 place count 1959 transition count 1753
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1000 place count 1953 transition count 1753
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2420 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2422 place count 1241 transition count 1041
Applied a total of 2422 rules in 357 ms. Remains 1241 /2454 variables (removed 1213) and now considering 1041/2254 (removed 1213) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2024-05-29 10:12:03] [INFO ] Computed 441 invariants in 5 ms
[2024-05-29 10:12:04] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-29 10:12:04] [INFO ] Invariant cache hit.
[2024-05-29 10:12:05] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
[2024-05-29 10:12:05] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-29 10:12:05] [INFO ] Invariant cache hit.
[2024-05-29 10:12:06] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1241/2454 places, 1041/2254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3037 ms. Remains : 1241/2454 places, 1041/2254 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s843 1) (EQ s860 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2803 steps with 0 reset in 31 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-04 finished in 3133 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(p0))'
Support contains 1 out of 2454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 2453 transition count 1971
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 564 place count 2171 transition count 1971
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 564 place count 2171 transition count 1771
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 964 place count 1971 transition count 1771
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 976 place count 1959 transition count 1759
Iterating global reduction 2 with 12 rules applied. Total rules applied 988 place count 1959 transition count 1759
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 988 place count 1959 transition count 1753
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1000 place count 1953 transition count 1753
Performed 711 Post agglomeration using F-continuation condition.Transition count delta: 711
Deduced a syphon composed of 711 places in 2 ms
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 2 with 1422 rules applied. Total rules applied 2422 place count 1242 transition count 1042
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2424 place count 1240 transition count 1040
Applied a total of 2424 rules in 338 ms. Remains 1240 /2454 variables (removed 1214) and now considering 1040/2254 (removed 1214) transitions.
// Phase 1: matrix 1040 rows 1240 cols
[2024-05-29 10:12:06] [INFO ] Computed 441 invariants in 3 ms
[2024-05-29 10:12:07] [INFO ] Implicit Places using invariants in 608 ms returned []
[2024-05-29 10:12:07] [INFO ] Invariant cache hit.
[2024-05-29 10:12:08] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
[2024-05-29 10:12:08] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-29 10:12:08] [INFO ] Invariant cache hit.
[2024-05-29 10:12:09] [INFO ] Dead Transitions using invariants and state equation in 651 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1240/2454 places, 1040/2254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3035 ms. Remains : 1240/2454 places, 1040/2254 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s586 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 87 reset in 950 ms.
Product exploration explored 100000 steps with 86 reset in 1102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 1124 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-05-29 10:12:11] [INFO ] Invariant cache hit.
[2024-05-29 10:12:12] [INFO ] [Real]Absence check using 441 positive place invariants in 286 ms returned sat
[2024-05-29 10:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:12:16] [INFO ] [Real]Absence check using state equation in 3233 ms returned sat
[2024-05-29 10:12:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:12:17] [INFO ] [Nat]Absence check using 441 positive place invariants in 260 ms returned sat
[2024-05-29 10:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:12:19] [INFO ] [Nat]Absence check using state equation in 2647 ms returned sat
[2024-05-29 10:12:19] [INFO ] Computed and/alt/rep : 1038/1993/1038 causal constraints (skipped 0 transitions) in 55 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 10:12:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 1240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 29 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2024-05-29 10:12:31] [INFO ] Invariant cache hit.
[2024-05-29 10:12:31] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-29 10:12:31] [INFO ] Invariant cache hit.
[2024-05-29 10:12:33] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2024-05-29 10:12:33] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-29 10:12:33] [INFO ] Invariant cache hit.
[2024-05-29 10:12:33] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2745 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 256 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 1224 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=81 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-29 10:12:34] [INFO ] Invariant cache hit.
[2024-05-29 10:12:35] [INFO ] [Real]Absence check using 441 positive place invariants in 297 ms returned sat
[2024-05-29 10:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:12:38] [INFO ] [Real]Absence check using state equation in 3355 ms returned sat
[2024-05-29 10:12:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:12:40] [INFO ] [Nat]Absence check using 441 positive place invariants in 299 ms returned sat
[2024-05-29 10:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:12:42] [INFO ] [Nat]Absence check using state equation in 2829 ms returned sat
[2024-05-29 10:12:43] [INFO ] Computed and/alt/rep : 1038/1993/1038 causal constraints (skipped 0 transitions) in 68 ms.
2timeout
^^^^^^^^
(error "Invalid token: 2timeout")
[2024-05-29 10:12:54] [INFO ] Deduced a trap composed of 3 places in 619 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 10:12:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 85 reset in 839 ms.
Product exploration explored 100000 steps with 87 reset in 1003 ms.
Built C files in :
/tmp/ltsmin7453543691786144978
[2024-05-29 10:12:56] [INFO ] Computing symmetric may disable matrix : 1040 transitions.
[2024-05-29 10:12:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:12:56] [INFO ] Computing symmetric may enable matrix : 1040 transitions.
[2024-05-29 10:12:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:12:56] [INFO ] Computing Do-Not-Accords matrix : 1040 transitions.
[2024-05-29 10:12:56] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:12:56] [INFO ] Built C files in 201ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7453543691786144978
Running compilation step : cd /tmp/ltsmin7453543691786144978;'/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/ltsmin7453543691786144978;'/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/ltsmin7453543691786144978;'/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 1 out of 1240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 32 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2024-05-29 10:12:59] [INFO ] Invariant cache hit.
[2024-05-29 10:13:00] [INFO ] Implicit Places using invariants in 612 ms returned []
[2024-05-29 10:13:00] [INFO ] Invariant cache hit.
[2024-05-29 10:13:01] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 2039 ms to find 0 implicit places.
[2024-05-29 10:13:01] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 10:13:01] [INFO ] Invariant cache hit.
[2024-05-29 10:13:02] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2732 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Built C files in :
/tmp/ltsmin9751172586380513699
[2024-05-29 10:13:02] [INFO ] Computing symmetric may disable matrix : 1040 transitions.
[2024-05-29 10:13:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:13:02] [INFO ] Computing symmetric may enable matrix : 1040 transitions.
[2024-05-29 10:13:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:13:02] [INFO ] Computing Do-Not-Accords matrix : 1040 transitions.
[2024-05-29 10:13:02] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:13:02] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9751172586380513699
Running compilation step : cd /tmp/ltsmin9751172586380513699;'/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/ltsmin9751172586380513699;'/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/ltsmin9751172586380513699;'/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 10:13:05] [INFO ] Flatten gal took : 33 ms
[2024-05-29 10:13:05] [INFO ] Flatten gal took : 29 ms
[2024-05-29 10:13:05] [INFO ] Time to serialize gal into /tmp/LTL10326898332603319659.gal : 11 ms
[2024-05-29 10:13:05] [INFO ] Time to serialize properties into /tmp/LTL11159814061490312857.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/LTL10326898332603319659.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5301131761699826270.hoa' '-atoms' '/tmp/LTL11159814061490312857.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/LTL11159814061490312857.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5301131761699826270.hoa
Detected timeout of ITS tools.
[2024-05-29 10:13:20] [INFO ] Flatten gal took : 26 ms
[2024-05-29 10:13:20] [INFO ] Flatten gal took : 26 ms
[2024-05-29 10:13:20] [INFO ] Time to serialize gal into /tmp/LTL2990710661859961533.gal : 6 ms
[2024-05-29 10:13:21] [INFO ] Time to serialize properties into /tmp/LTL9322854019335604241.ltl : 98 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/LTL2990710661859961533.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9322854019335604241.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...275
Read 1 LTL properties
Checking formula 0 : !((F("(p1301==1)")))
Formula 0 simplified : G!"(p1301==1)"
Detected timeout of ITS tools.
[2024-05-29 10:13:36] [INFO ] Flatten gal took : 32 ms
[2024-05-29 10:13:36] [INFO ] Applying decomposition
[2024-05-29 10:13:36] [INFO ] Flatten gal took : 27 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/graph14292292325926145682.txt' '-o' '/tmp/graph14292292325926145682.bin' '-w' '/tmp/graph14292292325926145682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14292292325926145682.bin' '-l' '-1' '-v' '-w' '/tmp/graph14292292325926145682.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:13:36] [INFO ] Decomposing Gal with order
[2024-05-29 10:13:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:13:36] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-29 10:13:36] [INFO ] Flatten gal took : 64 ms
[2024-05-29 10:13:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 10 ms.
[2024-05-29 10:13:36] [INFO ] Time to serialize gal into /tmp/LTL1125312863297676737.gal : 13 ms
[2024-05-29 10:13:36] [INFO ] Time to serialize properties into /tmp/LTL16566620310854480712.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/LTL1125312863297676737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16566620310854480712.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...255
Read 1 LTL properties
Checking formula 0 : !((F("(i18.i1.u208.p1301==1)")))
Formula 0 simplified : G!"(i18.i1.u208.p1301==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5482140741102204834
[2024-05-29 10:13:51] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5482140741102204834
Running compilation step : cd /tmp/ltsmin5482140741102204834;'/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'
Compilation finished in 1800 ms.
Running link step : cd /tmp/ltsmin5482140741102204834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5482140741102204834;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-05 finished in 120141 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)||G(F(p1)))))'
Support contains 4 out of 2454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2453 transition count 1972
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2172 transition count 1972
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2172 transition count 1772
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1972 transition count 1772
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 974 place count 1960 transition count 1760
Iterating global reduction 2 with 12 rules applied. Total rules applied 986 place count 1960 transition count 1760
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 986 place count 1960 transition count 1754
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 998 place count 1954 transition count 1754
Performed 708 Post agglomeration using F-continuation condition.Transition count delta: 708
Deduced a syphon composed of 708 places in 1 ms
Reduce places removed 708 places and 0 transitions.
Iterating global reduction 2 with 1416 rules applied. Total rules applied 2414 place count 1246 transition count 1046
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2416 place count 1244 transition count 1044
Applied a total of 2416 rules in 373 ms. Remains 1244 /2454 variables (removed 1210) and now considering 1044/2254 (removed 1210) transitions.
// Phase 1: matrix 1044 rows 1244 cols
[2024-05-29 10:14:06] [INFO ] Computed 441 invariants in 4 ms
[2024-05-29 10:14:07] [INFO ] Implicit Places using invariants in 673 ms returned []
[2024-05-29 10:14:07] [INFO ] Invariant cache hit.
[2024-05-29 10:14:09] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 2134 ms to find 0 implicit places.
[2024-05-29 10:14:09] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 10:14:09] [INFO ] Invariant cache hit.
[2024-05-29 10:14:09] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1244/2454 places, 1044/2254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3120 ms. Remains : 1244/2454 places, 1044/2254 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s662 1) (EQ s675 1)), p1:(EQ s842 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2665 steps with 3 reset in 30 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-06 finished in 3246 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(p0))'
Support contains 2 out of 2454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2453 transition count 1972
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2172 transition count 1972
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2172 transition count 1772
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1972 transition count 1772
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 974 place count 1960 transition count 1760
Iterating global reduction 2 with 12 rules applied. Total rules applied 986 place count 1960 transition count 1760
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 986 place count 1960 transition count 1754
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 998 place count 1954 transition count 1754
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 1 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2418 place count 1244 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2420 place count 1242 transition count 1042
Applied a total of 2420 rules in 331 ms. Remains 1242 /2454 variables (removed 1212) and now considering 1042/2254 (removed 1212) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2024-05-29 10:14:10] [INFO ] Computed 441 invariants in 2 ms
[2024-05-29 10:14:10] [INFO ] Implicit Places using invariants in 675 ms returned []
[2024-05-29 10:14:10] [INFO ] Invariant cache hit.
[2024-05-29 10:14:12] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
[2024-05-29 10:14:12] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 10:14:12] [INFO ] Invariant cache hit.
[2024-05-29 10:14:12] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1242/2454 places, 1042/2254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3009 ms. Remains : 1242/2454 places, 1042/2254 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s39 1) (EQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 41 reset in 871 ms.
Product exploration explored 100000 steps with 41 reset in 1081 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 2448 steps, including 0 resets, run visited all 1 properties in 30 ms. (steps per millisecond=81 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2024-05-29 10:14:15] [INFO ] Invariant cache hit.
[2024-05-29 10:14:16] [INFO ] [Real]Absence check using 441 positive place invariants in 271 ms returned sat
[2024-05-29 10:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:14:19] [INFO ] [Real]Absence check using state equation in 2918 ms returned sat
[2024-05-29 10:14:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:14:20] [INFO ] [Nat]Absence check using 441 positive place invariants in 277 ms returned sat
[2024-05-29 10:14:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:14:23] [INFO ] [Nat]Absence check using state equation in 2979 ms returned sat
[2024-05-29 10:14:23] [INFO ] Computed and/alt/rep : 1039/1996/1039 causal constraints (skipped 0 transitions) in 59 ms.
[2024-05-29 10:14:34] [INFO ] Deduced a trap composed of 2 places in 608 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 10:14:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 1042/1042 transitions.
Applied a total of 0 rules in 26 ms. Remains 1242 /1242 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-05-29 10:14:34] [INFO ] Invariant cache hit.
[2024-05-29 10:14:35] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-29 10:14:35] [INFO ] Invariant cache hit.
[2024-05-29 10:14:36] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2024-05-29 10:14:36] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 10:14:36] [INFO ] Invariant cache hit.
[2024-05-29 10:14:37] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2664 ms. Remains : 1242/1242 places, 1042/1042 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 2280 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-29 10:14:37] [INFO ] Invariant cache hit.
[2024-05-29 10:14:38] [INFO ] [Real]Absence check using 441 positive place invariants in 272 ms returned sat
[2024-05-29 10:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:14:41] [INFO ] [Real]Absence check using state equation in 2901 ms returned sat
[2024-05-29 10:14:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:14:42] [INFO ] [Nat]Absence check using 441 positive place invariants in 267 ms returned sat
[2024-05-29 10:14:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:14:45] [INFO ] [Nat]Absence check using state equation in 2816 ms returned sat
[2024-05-29 10:14:45] [INFO ] Computed and/alt/rep : 1039/1996/1039 causal constraints (skipped 0 transitions) in 58 ms.
[2024-05-29 10:14:56] [INFO ] Added : 600 causal constraints over 120 iterations in 11109 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 41 reset in 891 ms.
Product exploration explored 100000 steps with 40 reset in 1063 ms.
Built C files in :
/tmp/ltsmin7425598517162451446
[2024-05-29 10:14:58] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2024-05-29 10:14:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:14:58] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2024-05-29 10:14:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:14:59] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
[2024-05-29 10:14:59] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:14:59] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7425598517162451446
Running compilation step : cd /tmp/ltsmin7425598517162451446;'/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/ltsmin7425598517162451446;'/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/ltsmin7425598517162451446;'/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 2 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 1042/1042 transitions.
Applied a total of 0 rules in 26 ms. Remains 1242 /1242 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2024-05-29 10:15:02] [INFO ] Invariant cache hit.
[2024-05-29 10:15:02] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-29 10:15:02] [INFO ] Invariant cache hit.
[2024-05-29 10:15:04] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
[2024-05-29 10:15:04] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 10:15:04] [INFO ] Invariant cache hit.
[2024-05-29 10:15:04] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2735 ms. Remains : 1242/1242 places, 1042/1042 transitions.
Built C files in :
/tmp/ltsmin9075983054695327549
[2024-05-29 10:15:04] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2024-05-29 10:15:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:15:04] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2024-05-29 10:15:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:15:05] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
[2024-05-29 10:15:05] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:15:05] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9075983054695327549
Running compilation step : cd /tmp/ltsmin9075983054695327549;'/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/ltsmin9075983054695327549;'/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/ltsmin9075983054695327549;'/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 10:15:08] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:15:08] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:15:08] [INFO ] Time to serialize gal into /tmp/LTL2754470832886855406.gal : 4 ms
[2024-05-29 10:15:08] [INFO ] Time to serialize properties into /tmp/LTL8169593257854065681.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/LTL2754470832886855406.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11429577966461923634.hoa' '-atoms' '/tmp/LTL8169593257854065681.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...318
Loading property file /tmp/LTL8169593257854065681.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11429577966461923634.hoa
Detected timeout of ITS tools.
[2024-05-29 10:15:23] [INFO ] Flatten gal took : 26 ms
[2024-05-29 10:15:23] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:15:23] [INFO ] Time to serialize gal into /tmp/LTL3825928547673669046.gal : 4 ms
[2024-05-29 10:15:23] [INFO ] Time to serialize properties into /tmp/LTL13697472484781192991.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/LTL3825928547673669046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13697472484781192991.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 : !((F("((p126==1)&&(p163==1))")))
Formula 0 simplified : G!"((p126==1)&&(p163==1))"
Detected timeout of ITS tools.
[2024-05-29 10:15:38] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:15:38] [INFO ] Applying decomposition
[2024-05-29 10:15:38] [INFO ] Flatten gal took : 25 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/graph12974152105227116159.txt' '-o' '/tmp/graph12974152105227116159.bin' '-w' '/tmp/graph12974152105227116159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12974152105227116159.bin' '-l' '-1' '-v' '-w' '/tmp/graph12974152105227116159.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:15:38] [INFO ] Decomposing Gal with order
[2024-05-29 10:15:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:15:38] [INFO ] Removed a total of 242 redundant transitions.
[2024-05-29 10:15:38] [INFO ] Flatten gal took : 43 ms
[2024-05-29 10:15:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 478 labels/synchronizations in 14 ms.
[2024-05-29 10:15:38] [INFO ] Time to serialize gal into /tmp/LTL15603100099558803759.gal : 9 ms
[2024-05-29 10:15:38] [INFO ] Time to serialize properties into /tmp/LTL5442384770116056711.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/LTL15603100099558803759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5442384770116056711.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...255
Read 1 LTL properties
Checking formula 0 : !((F("((i1.i0.u15.p126==1)&&(i1.i3.u23.p163==1))")))
Formula 0 simplified : G!"((i1.i0.u15.p126==1)&&(i1.i3.u23.p163==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3866460499408197531
[2024-05-29 10:15:53] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3866460499408197531
Running compilation step : cd /tmp/ltsmin3866460499408197531;'/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'
Compilation finished in 1816 ms.
Running link step : cd /tmp/ltsmin3866460499408197531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3866460499408197531;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-07 finished in 118961 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) U X(p2))))'
Support contains 3 out of 2454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2444 transition count 2244
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2444 transition count 2244
Applied a total of 20 rules in 204 ms. Remains 2444 /2454 variables (removed 10) and now considering 2244/2254 (removed 10) transitions.
// Phase 1: matrix 2244 rows 2444 cols
[2024-05-29 10:16:09] [INFO ] Computed 441 invariants in 14 ms
[2024-05-29 10:16:10] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2024-05-29 10:16:10] [INFO ] Invariant cache hit.
[2024-05-29 10:16:12] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned []
Implicit Place search using SMT with State Equation took 3771 ms to find 0 implicit places.
[2024-05-29 10:16:12] [INFO ] Invariant cache hit.
[2024-05-29 10:16:14] [INFO ] Dead Transitions using invariants and state equation in 1664 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2444/2454 places, 2244/2254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5640 ms. Remains : 2444/2454 places, 2244/2254 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s2204 0), p1:(NEQ s1823 1), p2:(EQ s2194 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 945 reset in 336 ms.
Product exploration explored 100000 steps with 949 reset in 350 ms.
Computed a total of 481 stabilizing places and 481 stable transitions
Computed a total of 481 stabilizing places and 481 stable transitions
Detected a total of 481/2444 stabilizing places and 481/2244 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 491 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 9) seen :7
Finished Best-First random walk after 5907 steps, including 1 resets, run visited all 2 properties in 14 ms. (steps per millisecond=421 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F p2), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 18 factoid took 1817 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2444/2444 places, 2244/2244 transitions.
Applied a total of 0 rules in 96 ms. Remains 2444 /2444 variables (removed 0) and now considering 2244/2244 (removed 0) transitions.
[2024-05-29 10:16:18] [INFO ] Invariant cache hit.
[2024-05-29 10:16:20] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2024-05-29 10:16:20] [INFO ] Invariant cache hit.
[2024-05-29 10:16:22] [INFO ] Implicit Places using invariants and state equation in 2603 ms returned []
Implicit Place search using SMT with State Equation took 3609 ms to find 0 implicit places.
[2024-05-29 10:16:22] [INFO ] Invariant cache hit.
[2024-05-29 10:16:24] [INFO ] Dead Transitions using invariants and state equation in 1515 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5223 ms. Remains : 2444/2444 places, 2244/2244 transitions.
Computed a total of 481 stabilizing places and 481 stable transitions
Computed a total of 481 stabilizing places and 481 stable transitions
Detected a total of 481/2444 stabilizing places and 481/2244 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 324 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 9) seen :7
Finished Best-First random walk after 2395 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=399 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F p2), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 1161 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 934 reset in 354 ms.
Product exploration explored 100000 steps with 934 reset in 361 ms.
Applying partial POR strategy [false, true, false, true, false, true, true]
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2444 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2444/2444 places, 2244/2244 transitions.
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2444 transition count 2244
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 279 place count 2444 transition count 2246
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 360 place count 2444 transition count 2246
Performed 837 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1197 places in 1 ms
Iterating global reduction 1 with 837 rules applied. Total rules applied 1197 place count 2444 transition count 2246
Renaming transitions due to excessive name length > 1024 char.
Discarding 278 places :
Symmetric choice reduction at 1 with 278 rule applications. Total rules 1475 place count 2166 transition count 1968
Deduced a syphon composed of 919 places in 2 ms
Iterating global reduction 1 with 278 rules applied. Total rules applied 1753 place count 2166 transition count 1968
Deduced a syphon composed of 919 places in 2 ms
Applied a total of 1753 rules in 538 ms. Remains 2166 /2444 variables (removed 278) and now considering 1968/2244 (removed 276) transitions.
[2024-05-29 10:16:28] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 1968 rows 2166 cols
[2024-05-29 10:16:28] [INFO ] Computed 441 invariants in 22 ms
[2024-05-29 10:16:30] [INFO ] Dead Transitions using invariants and state equation in 1415 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2166/2444 places, 1968/2244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2005 ms. Remains : 2166/2444 places, 1968/2244 transitions.
Built C files in :
/tmp/ltsmin16948425527560384918
[2024-05-29 10:16:30] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16948425527560384918
Running compilation step : cd /tmp/ltsmin16948425527560384918;'/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/ltsmin16948425527560384918;'/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/ltsmin16948425527560384918;'/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 3 out of 2444 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2444/2444 places, 2244/2244 transitions.
Applied a total of 0 rules in 93 ms. Remains 2444 /2444 variables (removed 0) and now considering 2244/2244 (removed 0) transitions.
// Phase 1: matrix 2244 rows 2444 cols
[2024-05-29 10:16:33] [INFO ] Computed 441 invariants in 14 ms
[2024-05-29 10:16:34] [INFO ] Implicit Places using invariants in 997 ms returned []
[2024-05-29 10:16:34] [INFO ] Invariant cache hit.
[2024-05-29 10:16:37] [INFO ] Implicit Places using invariants and state equation in 2669 ms returned []
Implicit Place search using SMT with State Equation took 3671 ms to find 0 implicit places.
[2024-05-29 10:16:37] [INFO ] Invariant cache hit.
[2024-05-29 10:16:38] [INFO ] Dead Transitions using invariants and state equation in 1626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5391 ms. Remains : 2444/2444 places, 2244/2244 transitions.
Built C files in :
/tmp/ltsmin3432749233389212725
[2024-05-29 10:16:38] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3432749233389212725
Running compilation step : cd /tmp/ltsmin3432749233389212725;'/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/ltsmin3432749233389212725;'/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/ltsmin3432749233389212725;'/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 10:16:41] [INFO ] Flatten gal took : 54 ms
[2024-05-29 10:16:41] [INFO ] Flatten gal took : 45 ms
[2024-05-29 10:16:41] [INFO ] Time to serialize gal into /tmp/LTL14690720107791943382.gal : 8 ms
[2024-05-29 10:16:41] [INFO ] Time to serialize properties into /tmp/LTL17268131213516867363.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14690720107791943382.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13800881359250543515.hoa' '-atoms' '/tmp/LTL17268131213516867363.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...320
Loading property file /tmp/LTL17268131213516867363.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13800881359250543515.hoa
Detected timeout of ITS tools.
[2024-05-29 10:16:57] [INFO ] Flatten gal took : 44 ms
[2024-05-29 10:16:57] [INFO ] Flatten gal took : 44 ms
[2024-05-29 10:16:57] [INFO ] Time to serialize gal into /tmp/LTL530461372978913329.gal : 8 ms
[2024-05-29 10:16:57] [INFO ] Time to serialize properties into /tmp/LTL215355366979832575.ltl : 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/LTL530461372978913329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL215355366979832575.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...273
Read 1 LTL properties
Checking formula 0 : !(((G("(p2454==0)"))||((F("(p2028!=1)"))U(X("(p2442==1)")))))
Formula 0 simplified : F!"(p2454==0)" & (G!"(p2028!=1)" R X!"(p2442==1)")
Detected timeout of ITS tools.
[2024-05-29 10:17:12] [INFO ] Flatten gal took : 45 ms
[2024-05-29 10:17:12] [INFO ] Applying decomposition
[2024-05-29 10:17:12] [INFO ] Flatten gal took : 43 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/graph2471645973689364136.txt' '-o' '/tmp/graph2471645973689364136.bin' '-w' '/tmp/graph2471645973689364136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2471645973689364136.bin' '-l' '-1' '-v' '-w' '/tmp/graph2471645973689364136.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:17:12] [INFO ] Decomposing Gal with order
[2024-05-29 10:17:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:17:12] [INFO ] Removed a total of 360 redundant transitions.
[2024-05-29 10:17:12] [INFO ] Flatten gal took : 80 ms
[2024-05-29 10:17:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 10:17:12] [INFO ] Time to serialize gal into /tmp/LTL6198602177158753252.gal : 35 ms
[2024-05-29 10:17:12] [INFO ] Time to serialize properties into /tmp/LTL5623938543632633904.ltl : 44 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/LTL6198602177158753252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5623938543632633904.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 : !(((G("(i35.i3.i1.u871.p2454==0)"))||((F("(i29.i0.i0.u723.p2028!=1)"))U(X("(i35.i1.i1.u868.p2442==1)")))))
Formula 0 simplified : F!"(i35.i3.i1.u871.p2454==0)" & (G!"(i29.i0.i0.u723.p2028!=1)" R X!"(i35.i1.i1.u868.p2442==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15461412242275379167
[2024-05-29 10:17:27] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15461412242275379167
Running compilation step : cd /tmp/ltsmin15461412242275379167;'/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/ltsmin15461412242275379167;'/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/ltsmin15461412242275379167;'/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)
Treatment of property ShieldPPPs-PT-040B-LTLFireability-08 finished in 82121 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 U p1))))'
Support contains 3 out of 2454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2453 transition count 1972
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2172 transition count 1972
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 562 place count 2172 transition count 1773
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 960 place count 1973 transition count 1773
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 971 place count 1962 transition count 1762
Iterating global reduction 2 with 11 rules applied. Total rules applied 982 place count 1962 transition count 1762
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 982 place count 1962 transition count 1756
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 994 place count 1956 transition count 1756
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 1 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2414 place count 1246 transition count 1046
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2416 place count 1244 transition count 1044
Applied a total of 2416 rules in 330 ms. Remains 1244 /2454 variables (removed 1210) and now considering 1044/2254 (removed 1210) transitions.
// Phase 1: matrix 1044 rows 1244 cols
[2024-05-29 10:17:31] [INFO ] Computed 441 invariants in 3 ms
[2024-05-29 10:17:31] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-29 10:17:31] [INFO ] Invariant cache hit.
[2024-05-29 10:17:33] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2024-05-29 10:17:33] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 10:17:33] [INFO ] Invariant cache hit.
[2024-05-29 10:17:33] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1244/2454 places, 1044/2254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2987 ms. Remains : 1244/2454 places, 1044/2254 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s675 1), p0:(AND (EQ s1157 1) (EQ s1179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2664 steps with 0 reset in 33 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-09 finished in 3135 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 U X((p1||(G(!p1)&&p2)))))'
Support contains 4 out of 2454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2444 transition count 2244
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2444 transition count 2244
Applied a total of 20 rules in 197 ms. Remains 2444 /2454 variables (removed 10) and now considering 2244/2254 (removed 10) transitions.
// Phase 1: matrix 2244 rows 2444 cols
[2024-05-29 10:17:34] [INFO ] Computed 441 invariants in 13 ms
[2024-05-29 10:17:35] [INFO ] Implicit Places using invariants in 992 ms returned []
[2024-05-29 10:17:35] [INFO ] Invariant cache hit.
[2024-05-29 10:17:37] [INFO ] Implicit Places using invariants and state equation in 2615 ms returned []
Implicit Place search using SMT with State Equation took 3623 ms to find 0 implicit places.
[2024-05-29 10:17:37] [INFO ] Invariant cache hit.
[2024-05-29 10:17:39] [INFO ] Dead Transitions using invariants and state equation in 1539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2444/2454 places, 2244/2254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5372 ms. Remains : 2444/2454 places, 2244/2254 transitions.
Stuttering acceptance computed with spot in 342 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p1, false, false]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s698 1), p1:(EQ s2008 1), p2:(AND (NEQ s698 1) (NOT (AND (EQ s2167 1) (EQ s2169 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]]
Entered a terminal (fully accepting) state of product in 877 steps with 0 reset in 8 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-12 finished in 5757 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(((p1 U (p2||G(p1)))&&p0)))'
Support contains 4 out of 2454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2443 transition count 2243
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2443 transition count 2243
Applied a total of 22 rules in 207 ms. Remains 2443 /2454 variables (removed 11) and now considering 2243/2254 (removed 11) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2024-05-29 10:17:40] [INFO ] Computed 441 invariants in 13 ms
[2024-05-29 10:17:40] [INFO ] Implicit Places using invariants in 982 ms returned []
[2024-05-29 10:17:40] [INFO ] Invariant cache hit.
[2024-05-29 10:17:43] [INFO ] Implicit Places using invariants and state equation in 2470 ms returned []
Implicit Place search using SMT with State Equation took 3475 ms to find 0 implicit places.
[2024-05-29 10:17:43] [INFO ] Invariant cache hit.
[2024-05-29 10:17:44] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2443/2454 places, 2243/2254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5228 ms. Remains : 2443/2454 places, 2243/2254 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (NEQ s1583 1) (NEQ s271 1)), p1:(NEQ s271 1), p0:(AND (EQ s2054 1) (EQ s2073 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 0 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-13 finished in 5378 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 U X(X((p1&&G(p2))))))'
Support contains 3 out of 2454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2443 transition count 2243
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2443 transition count 2243
Applied a total of 22 rules in 206 ms. Remains 2443 /2454 variables (removed 11) and now considering 2243/2254 (removed 11) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2024-05-29 10:17:45] [INFO ] Computed 441 invariants in 10 ms
[2024-05-29 10:17:46] [INFO ] Implicit Places using invariants in 987 ms returned []
[2024-05-29 10:17:46] [INFO ] Invariant cache hit.
[2024-05-29 10:17:48] [INFO ] Implicit Places using invariants and state equation in 2514 ms returned []
Implicit Place search using SMT with State Equation took 3530 ms to find 0 implicit places.
[2024-05-29 10:17:48] [INFO ] Invariant cache hit.
[2024-05-29 10:17:50] [INFO ] Dead Transitions using invariants and state equation in 1574 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2443/2454 places, 2243/2254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5316 ms. Remains : 2443/2454 places, 2243/2254 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p2), acceptance={} source=6 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=7 dest: 6}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 8}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 9}], [{ cond=(NOT p2), acceptance={} source=8 dest: 3}, { cond=p2, acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 8}, { cond=(AND p0 p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(OR (EQ s1827 1) (EQ s2372 1)), p1:(EQ s2372 1), p2:(EQ s1750 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-14 finished in 5678 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 1 out of 2454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 2453 transition count 1971
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 564 place count 2171 transition count 1971
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 564 place count 2171 transition count 1771
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 964 place count 1971 transition count 1771
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 975 place count 1960 transition count 1760
Iterating global reduction 2 with 11 rules applied. Total rules applied 986 place count 1960 transition count 1760
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 986 place count 1960 transition count 1754
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 998 place count 1954 transition count 1754
Performed 711 Post agglomeration using F-continuation condition.Transition count delta: 711
Deduced a syphon composed of 711 places in 1 ms
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 2 with 1422 rules applied. Total rules applied 2420 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2422 place count 1241 transition count 1041
Applied a total of 2422 rules in 335 ms. Remains 1241 /2454 variables (removed 1213) and now considering 1041/2254 (removed 1213) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2024-05-29 10:17:51] [INFO ] Computed 441 invariants in 5 ms
[2024-05-29 10:17:51] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-05-29 10:17:51] [INFO ] Invariant cache hit.
[2024-05-29 10:17:53] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2024-05-29 10:17:53] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-29 10:17:53] [INFO ] Invariant cache hit.
[2024-05-29 10:17:53] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1241/2454 places, 1041/2254 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2936 ms. Remains : 1241/2454 places, 1041/2254 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s1117 1)], 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 37 reset in 871 ms.
Product exploration explored 100000 steps with 37 reset in 1090 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 190 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=63 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 30 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2024-05-29 10:17:56] [INFO ] Invariant cache hit.
[2024-05-29 10:17:56] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-05-29 10:17:56] [INFO ] Invariant cache hit.
[2024-05-29 10:17:58] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
[2024-05-29 10:17:58] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-29 10:17:58] [INFO ] Invariant cache hit.
[2024-05-29 10:17:58] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2719 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 166077 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166077 steps, saw 120804 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 10:18:02] [INFO ] Invariant cache hit.
[2024-05-29 10:18:02] [INFO ] [Real]Absence check using 441 positive place invariants in 67 ms returned sat
[2024-05-29 10:18:02] [INFO ] After 430ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 10:18:02] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2024-05-29 10:18:03] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2024-05-29 10:18:03] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-29 10:18:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 381 ms
[2024-05-29 10:18:03] [INFO ] After 844ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:18:03] [INFO ] After 1085ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:18:03] [INFO ] [Nat]Absence check using 441 positive place invariants in 76 ms returned sat
[2024-05-29 10:18:03] [INFO ] After 489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:18:04] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 10:18:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 10:18:04] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 10:18:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2024-05-29 10:18:04] [INFO ] After 811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-29 10:18:04] [INFO ] After 1132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 83 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 37 reset in 948 ms.
Product exploration explored 100000 steps with 37 reset in 1145 ms.
Built C files in :
/tmp/ltsmin9928942898070147658
[2024-05-29 10:18:06] [INFO ] Computing symmetric may disable matrix : 1041 transitions.
[2024-05-29 10:18:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:18:06] [INFO ] Computing symmetric may enable matrix : 1041 transitions.
[2024-05-29 10:18:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:18:06] [INFO ] Computing Do-Not-Accords matrix : 1041 transitions.
[2024-05-29 10:18:06] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:18:06] [INFO ] Built C files in 199ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9928942898070147658
Running compilation step : cd /tmp/ltsmin9928942898070147658;'/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/ltsmin9928942898070147658;'/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/ltsmin9928942898070147658;'/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 1 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 27 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
[2024-05-29 10:18:09] [INFO ] Invariant cache hit.
[2024-05-29 10:18:10] [INFO ] Implicit Places using invariants in 620 ms returned []
[2024-05-29 10:18:10] [INFO ] Invariant cache hit.
[2024-05-29 10:18:11] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
[2024-05-29 10:18:11] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 10:18:11] [INFO ] Invariant cache hit.
[2024-05-29 10:18:12] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2737 ms. Remains : 1241/1241 places, 1041/1041 transitions.
Built C files in :
/tmp/ltsmin13034911571938568258
[2024-05-29 10:18:12] [INFO ] Computing symmetric may disable matrix : 1041 transitions.
[2024-05-29 10:18:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:18:12] [INFO ] Computing symmetric may enable matrix : 1041 transitions.
[2024-05-29 10:18:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:18:12] [INFO ] Computing Do-Not-Accords matrix : 1041 transitions.
[2024-05-29 10:18:12] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:18:12] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13034911571938568258
Running compilation step : cd /tmp/ltsmin13034911571938568258;'/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/ltsmin13034911571938568258;'/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/ltsmin13034911571938568258;'/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 10:18:15] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:18:15] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:18:15] [INFO ] Time to serialize gal into /tmp/LTL15258275103110520531.gal : 4 ms
[2024-05-29 10:18:15] [INFO ] Time to serialize properties into /tmp/LTL14678958324628792095.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15258275103110520531.gal' '-t' 'CGAL' '-hoa' '/tmp/aut425063038311265763.hoa' '-atoms' '/tmp/LTL14678958324628792095.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...318
Loading property file /tmp/LTL14678958324628792095.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut425063038311265763.hoa
Detected timeout of ITS tools.
[2024-05-29 10:18:30] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:18:30] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:18:30] [INFO ] Time to serialize gal into /tmp/LTL16516556004902147677.gal : 4 ms
[2024-05-29 10:18:30] [INFO ] Time to serialize properties into /tmp/LTL10784727503881404897.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/LTL16516556004902147677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10784727503881404897.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(p2450!=1)"))))
Formula 0 simplified : GF!"(p2450!=1)"
Detected timeout of ITS tools.
[2024-05-29 10:18:46] [INFO ] Flatten gal took : 29 ms
[2024-05-29 10:18:46] [INFO ] Applying decomposition
[2024-05-29 10:18:46] [INFO ] Flatten gal took : 25 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/graph7234841651761266549.txt' '-o' '/tmp/graph7234841651761266549.bin' '-w' '/tmp/graph7234841651761266549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7234841651761266549.bin' '-l' '-1' '-v' '-w' '/tmp/graph7234841651761266549.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:18:46] [INFO ] Decomposing Gal with order
[2024-05-29 10:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:18:46] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-29 10:18:46] [INFO ] Flatten gal took : 39 ms
[2024-05-29 10:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 7 ms.
[2024-05-29 10:18:46] [INFO ] Time to serialize gal into /tmp/LTL6348268744513272637.gal : 8 ms
[2024-05-29 10:18:46] [INFO ] Time to serialize properties into /tmp/LTL3994775803861807327.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/LTL6348268744513272637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3994775803861807327.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 : !((F(G("(i35.i2.u396.p2450!=1)"))))
Formula 0 simplified : GF!"(i35.i2.u396.p2450!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13501741858438872040
[2024-05-29 10:19:01] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13501741858438872040
Running compilation step : cd /tmp/ltsmin13501741858438872040;'/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'
Compilation finished in 1846 ms.
Running link step : cd /tmp/ltsmin13501741858438872040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13501741858438872040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-15 finished in 85577 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((p0||(p1 U p2)))||(X(G(p3))&&G(p1))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-040B-LTLFireability-00
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 2454 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2454/2454 places, 2254/2254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2453 transition count 1973
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 2173 transition count 1973
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 560 place count 2173 transition count 1774
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 958 place count 1974 transition count 1774
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 967 place count 1965 transition count 1765
Iterating global reduction 2 with 9 rules applied. Total rules applied 976 place count 1965 transition count 1765
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 976 place count 1965 transition count 1761
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 984 place count 1961 transition count 1761
Performed 712 Post agglomeration using F-continuation condition.Transition count delta: 712
Deduced a syphon composed of 712 places in 1 ms
Reduce places removed 712 places and 0 transitions.
Iterating global reduction 2 with 1424 rules applied. Total rules applied 2408 place count 1249 transition count 1049
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2410 place count 1247 transition count 1047
Applied a total of 2410 rules in 342 ms. Remains 1247 /2454 variables (removed 1207) and now considering 1047/2254 (removed 1207) transitions.
// Phase 1: matrix 1047 rows 1247 cols
[2024-05-29 10:19:17] [INFO ] Computed 441 invariants in 4 ms
[2024-05-29 10:19:17] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-29 10:19:17] [INFO ] Invariant cache hit.
[2024-05-29 10:19:19] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
[2024-05-29 10:19:19] [INFO ] Invariant cache hit.
[2024-05-29 10:19:19] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1247/2454 places, 1047/2254 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3028 ms. Remains : 1247/2454 places, 1047/2254 transitions.
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s864 1), p2:(EQ s938 1), p1:(EQ s216 1), p3:(EQ s859 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28117 reset in 1098 ms.
Product exploration explored 100000 steps with 28206 reset in 1248 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/1247 stabilizing places and 6/1047 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 657 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 719 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-29 10:19:23] [INFO ] Invariant cache hit.
[2024-05-29 10:19:24] [INFO ] [Real]Absence check using 441 positive place invariants in 282 ms returned sat
[2024-05-29 10:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:19:29] [INFO ] [Real]Absence check using state equation in 4710 ms returned sat
[2024-05-29 10:19:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:19:30] [INFO ] [Nat]Absence check using 441 positive place invariants in 271 ms returned sat
[2024-05-29 10:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:19:33] [INFO ] [Nat]Absence check using state equation in 3128 ms returned sat
[2024-05-29 10:19:33] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-29 10:19:33] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 10:19:33] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-29 10:19:33] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-29 10:19:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 407 ms
[2024-05-29 10:19:34] [INFO ] Computed and/alt/rep : 1042/2037/1042 causal constraints (skipped 0 transitions) in 60 ms.
[2024-05-29 10:19:45] [INFO ] Deduced a trap composed of 2 places in 608 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 10:19:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 1247 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1247/1247 places, 1047/1047 transitions.
Applied a total of 0 rules in 28 ms. Remains 1247 /1247 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
[2024-05-29 10:19:45] [INFO ] Invariant cache hit.
[2024-05-29 10:19:45] [INFO ] Implicit Places using invariants in 670 ms returned []
[2024-05-29 10:19:45] [INFO ] Invariant cache hit.
[2024-05-29 10:19:47] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 2021 ms to find 0 implicit places.
[2024-05-29 10:19:47] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 10:19:47] [INFO ] Invariant cache hit.
[2024-05-29 10:19:47] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2752 ms. Remains : 1247/1247 places, 1047/1047 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Detected a total of 6/1247 stabilizing places and 6/1047 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 238 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-29 10:19:48] [INFO ] Invariant cache hit.
[2024-05-29 10:19:49] [INFO ] [Real]Absence check using 441 positive place invariants in 283 ms returned sat
[2024-05-29 10:19:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 10:19:54] [INFO ] [Real]Absence check using state equation in 4914 ms returned sat
[2024-05-29 10:19:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:19:55] [INFO ] [Nat]Absence check using 441 positive place invariants in 271 ms returned sat
[2024-05-29 10:19:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 10:19:58] [INFO ] [Nat]Absence check using state equation in 3017 ms returned sat
[2024-05-29 10:19:58] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:19:58] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 10:19:58] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-05-29 10:19:58] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-05-29 10:19:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 452 ms
[2024-05-29 10:19:58] [INFO ] Computed and/alt/rep : 1042/2037/1042 causal constraints (skipped 0 transitions) in 61 ms.
[2024-05-29 10:20:10] [INFO ] Deduced a trap composed of 2 places in 605 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 10:20:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p2))
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 28364 reset in 1123 ms.
Product exploration explored 100000 steps with 28366 reset in 1251 ms.
Built C files in :
/tmp/ltsmin3320006900249921550
[2024-05-29 10:20:12] [INFO ] Computing symmetric may disable matrix : 1047 transitions.
[2024-05-29 10:20:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:20:12] [INFO ] Computing symmetric may enable matrix : 1047 transitions.
[2024-05-29 10:20:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:20:12] [INFO ] Computing Do-Not-Accords matrix : 1047 transitions.
[2024-05-29 10:20:12] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:20:12] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3320006900249921550
Running compilation step : cd /tmp/ltsmin3320006900249921550;'/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/ltsmin3320006900249921550;'/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/ltsmin3320006900249921550;'/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 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1247/1247 places, 1047/1047 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1245 transition count 1045
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1244 transition count 1044
Applied a total of 3 rules in 76 ms. Remains 1244 /1247 variables (removed 3) and now considering 1044/1047 (removed 3) transitions.
// Phase 1: matrix 1044 rows 1244 cols
[2024-05-29 10:20:15] [INFO ] Computed 441 invariants in 2 ms
[2024-05-29 10:20:16] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-29 10:20:16] [INFO ] Invariant cache hit.
[2024-05-29 10:20:17] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
[2024-05-29 10:20:17] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 10:20:17] [INFO ] Invariant cache hit.
[2024-05-29 10:20:18] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1244/1247 places, 1044/1047 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2852 ms. Remains : 1244/1247 places, 1044/1047 transitions.
Built C files in :
/tmp/ltsmin9389312521762173091
[2024-05-29 10:20:18] [INFO ] Computing symmetric may disable matrix : 1044 transitions.
[2024-05-29 10:20:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:20:18] [INFO ] Computing symmetric may enable matrix : 1044 transitions.
[2024-05-29 10:20:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:20:18] [INFO ] Computing Do-Not-Accords matrix : 1044 transitions.
[2024-05-29 10:20:18] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:20:18] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9389312521762173091
Running compilation step : cd /tmp/ltsmin9389312521762173091;'/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/ltsmin9389312521762173091;'/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/ltsmin9389312521762173091;'/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 10:20:21] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:20:21] [INFO ] Flatten gal took : 26 ms
[2024-05-29 10:20:21] [INFO ] Time to serialize gal into /tmp/LTL170553409767654860.gal : 4 ms
[2024-05-29 10:20:21] [INFO ] Time to serialize properties into /tmp/LTL7270472553078490719.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/LTL170553409767654860.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7294434390891843434.hoa' '-atoms' '/tmp/LTL7270472553078490719.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...316
Loading property file /tmp/LTL7270472553078490719.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7294434390891843434.hoa
Detected timeout of ITS tools.
[2024-05-29 10:20:36] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:20:36] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:20:36] [INFO ] Time to serialize gal into /tmp/LTL12181124955465095140.gal : 5 ms
[2024-05-29 10:20:36] [INFO ] Time to serialize properties into /tmp/LTL3442694934606180884.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/LTL12181124955465095140.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3442694934606180884.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 : !(((F(("(p1894==1)")||(("(p500==1)")U("(p2054==1)"))))||((X(G("(p1885==1)")))&&(G("(p500==1)")))))
Formula 0 simplified : G(!"(p1894==1)" & (!"(p500==1)" R !"(p2054==1)")) & (XF!"(p1885==1)" | F!"(p500==1)")
Detected timeout of ITS tools.
[2024-05-29 10:20:51] [INFO ] Flatten gal took : 25 ms
[2024-05-29 10:20:51] [INFO ] Applying decomposition
[2024-05-29 10:20:52] [INFO ] Flatten gal took : 25 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/graph12327786955197704769.txt' '-o' '/tmp/graph12327786955197704769.bin' '-w' '/tmp/graph12327786955197704769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12327786955197704769.bin' '-l' '-1' '-v' '-w' '/tmp/graph12327786955197704769.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:20:52] [INFO ] Decomposing Gal with order
[2024-05-29 10:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:20:52] [INFO ] Removed a total of 242 redundant transitions.
[2024-05-29 10:20:52] [INFO ] Flatten gal took : 39 ms
[2024-05-29 10:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 472 labels/synchronizations in 6 ms.
[2024-05-29 10:20:52] [INFO ] Time to serialize gal into /tmp/LTL6688837148073136928.gal : 8 ms
[2024-05-29 10:20:52] [INFO ] Time to serialize properties into /tmp/LTL12910857976424638348.ltl : 6 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/LTL6688837148073136928.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12910857976424638348.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...255
Read 1 LTL properties
Checking formula 0 : !(((F(("(i27.i2.u308.p1894==1)")||(("(i6.i2.u76.p500==1)")U("(i30.i1.u333.p2054==1)"))))||((X(G("(i27.i1.u306.p1885==1)")))&&(G("(i6.i...175
Formula 0 simplified : G(!"(i27.i2.u308.p1894==1)" & (!"(i6.i2.u76.p500==1)" R !"(i30.i1.u333.p2054==1)")) & (XF!"(i27.i1.u306.p1885==1)" | F!"(i6.i2.u76.p...164
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1321472676890817049
[2024-05-29 10:21:07] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1321472676890817049
Running compilation step : cd /tmp/ltsmin1321472676890817049;'/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'
Compilation finished in 1821 ms.
Running link step : cd /tmp/ltsmin1321472676890817049;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1321472676890817049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true))))||(X([]((LTLAPp3==true)))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-00 finished in 125936 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||X(X(X(p1))))))))'
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(p0))'
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(p0))'
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(p0))'
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) U X(p2))))'
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)))'
[2024-05-29 10:21:22] [INFO ] Flatten gal took : 49 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11717975309410232625
[2024-05-29 10:21:22] [INFO ] Too many transitions (2254) to apply POR reductions. Disabling POR matrices.
[2024-05-29 10:21:22] [INFO ] Applying decomposition
[2024-05-29 10:21:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11717975309410232625
Running compilation step : cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '102' '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'
[2024-05-29 10:21:22] [INFO ] Flatten gal took : 46 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/graph490151882303370746.txt' '-o' '/tmp/graph490151882303370746.bin' '-w' '/tmp/graph490151882303370746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph490151882303370746.bin' '-l' '-1' '-v' '-w' '/tmp/graph490151882303370746.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:21:23] [INFO ] Decomposing Gal with order
[2024-05-29 10:21:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:21:23] [INFO ] Removed a total of 360 redundant transitions.
[2024-05-29 10:21:23] [INFO ] Flatten gal took : 79 ms
[2024-05-29 10:21:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-29 10:21:23] [INFO ] Time to serialize gal into /tmp/LTLFireability11761424020076960024.gal : 22 ms
[2024-05-29 10:21:23] [INFO ] Time to serialize properties into /tmp/LTLFireability10827948649999201884.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11761424020076960024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10827948649999201884.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...278
Read 7 LTL properties
Checking formula 0 : !(((F(("(i27.i0.i0.u671.p1894==1)")||(("(i6.i3.i1.u175.p500==1)")U("(i30.i2.i0.u725.p2054==1)"))))||((X(G("(i27.i3.i1.u668.p1885==1)")...192
Formula 0 simplified : G(!"(i27.i0.i0.u671.p1894==1)" & (!"(i6.i3.i1.u175.p500==1)" R !"(i30.i2.i0.u725.p2054==1)")) & (XF!"(i27.i3.i1.u668.p1885==1)" | F!...181
Compilation finished in 4896 ms.
Running link step : cd /tmp/ltsmin11717975309410232625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true))))||(X([]((LTLAPp3==true)))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((LTLAPp0==true)||((LTLAPp1==true) U (LTLAPp2==true))))||(X([]((LTLAPp3==true)))&&[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp4==true)||X(X(X((LTLAPp5==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([](((LTLAPp4==true)||X(X(X((LTLAPp5==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp6==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 10:46:56] [INFO ] Applying decomposition
[2024-05-29 10:46:56] [INFO ] Flatten gal took : 138 ms
[2024-05-29 10:46:56] [INFO ] Decomposing Gal with order
[2024-05-29 10:46:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:46:57] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-29 10:46:57] [INFO ] Flatten gal took : 168 ms
[2024-05-29 10:46:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 51 ms.
[2024-05-29 10:46:58] [INFO ] Time to serialize gal into /tmp/LTLFireability2039496337337640640.gal : 35 ms
[2024-05-29 10:46:58] [INFO ] Time to serialize properties into /tmp/LTLFireability18011081970652341490.ltl : 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/LTLFireability2039496337337640640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18011081970652341490.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...277
Read 7 LTL properties
Checking formula 0 : !(((F(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u626.p1894==1)")||(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...477
Formula 0 simplified : G(!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u626.p1894==1)" & (!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....466
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp6==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp7==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp7==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp8==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>514 s) on command cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp8==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11717975309410232625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp9==true))||(<>((LTLAPp10==true)) U X((LTLAPp11==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 156460 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15092556 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldPPPs-PT-040B"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPs-PT-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789000308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-PT-040B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;