About the Execution of LTSMin+red for HirschbergSinclair-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 964.539 | 1313609.00 | 3229765.00 | 2599.20 | TTF?FTTF??FTFFFF | 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.r500-smll-171649587400076.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 ltsminxred
Input is HirschbergSinclair-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587400076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 13 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 13 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 13 03:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 173K May 18 16:42 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 HirschbergSinclair-PT-15-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-15-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717239437055
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:57:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:57:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:57:19] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-06-01 10:57:19] [INFO ] Transformed 330 places.
[2024-06-01 10:57:19] [INFO ] Transformed 296 transitions.
[2024-06-01 10:57:20] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-15-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 315 transition count 296
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 27 place count 303 transition count 284
Iterating global reduction 1 with 12 rules applied. Total rules applied 39 place count 303 transition count 284
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 295 transition count 276
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 295 transition count 276
Applied a total of 55 rules in 125 ms. Remains 295 /330 variables (removed 35) and now considering 276/296 (removed 20) transitions.
// Phase 1: matrix 276 rows 295 cols
[2024-06-01 10:57:20] [INFO ] Computed 19 invariants in 31 ms
[2024-06-01 10:57:20] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-06-01 10:57:20] [INFO ] Invariant cache hit.
[2024-06-01 10:57:21] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-01 10:57:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 15/295 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 276/571 variables, 295/314 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/571 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 314 constraints, problems are : Problem set: 0 solved, 261 unsolved in 23416 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/280 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 15/295 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 276/571 variables, 295/314 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 261/575 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 575 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints]
After SMT, in 53747ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 53772ms
Starting structural reductions in LTL mode, iteration 1 : 295/330 places, 276/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55121 ms. Remains : 295/330 places, 276/296 transitions.
Support contains 35 out of 295 places after structural reductions.
[2024-06-01 10:58:15] [INFO ] Flatten gal took : 117 ms
[2024-06-01 10:58:15] [INFO ] Flatten gal took : 52 ms
[2024-06-01 10:58:16] [INFO ] Input system was already deterministic with 276 transitions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 1351 steps (1 resets) in 434 ms. (3 steps per ms) remains 0/25 properties
Computed a total of 295 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 295 transition count 276
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 281 transition count 158
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 177 transition count 158
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 215 place count 170 transition count 151
Iterating global reduction 2 with 7 rules applied. Total rules applied 222 place count 170 transition count 151
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 226 place count 170 transition count 147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 230 place count 166 transition count 147
Applied a total of 230 rules in 40 ms. Remains 166 /295 variables (removed 129) and now considering 147/276 (removed 129) transitions.
// Phase 1: matrix 147 rows 166 cols
[2024-06-01 10:58:16] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 10:58:16] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-01 10:58:16] [INFO ] Invariant cache hit.
[2024-06-01 10:58:17] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2024-06-01 10:58:17] [INFO ] Redundant transitions in 6 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 10:58:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/141 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 122/263 variables, 141/160 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 2/265 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/313 variables, and 161 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7321 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 142/166 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/141 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 122/263 variables, 141/160 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 108/268 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 2/265 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/313 variables, and 281 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9936 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 142/166 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 17292ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 17295ms
Starting structural reductions in SI_LTL mode, iteration 1 : 166/295 places, 147/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18014 ms. Remains : 166/295 places, 147/276 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-00
Product exploration explored 100000 steps with 911 reset in 563 ms.
Product exploration explored 100000 steps with 912 reset in 335 ms.
Computed a total of 166 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 147
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 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)]
RANDOM walk for 454 steps (0 resets) in 12 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 120 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 39 ms :[(NOT p0)]
[2024-06-01 10:58:36] [INFO ] Invariant cache hit.
[2024-06-01 10:58:36] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 31 ms returned sat
[2024-06-01 10:58:36] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2024-06-01 10:58:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:58:37] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 33 ms returned sat
[2024-06-01 10:58:37] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2024-06-01 10:58:37] [INFO ] Computed and/alt/rep : 109/115/109 causal constraints (skipped 11 transitions) in 19 ms.
[2024-06-01 10:58:37] [INFO ] Added : 63 causal constraints over 13 iterations in 350 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 147/147 transitions.
Applied a total of 0 rules in 10 ms. Remains 166 /166 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-06-01 10:58:37] [INFO ] Invariant cache hit.
[2024-06-01 10:58:38] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-01 10:58:38] [INFO ] Invariant cache hit.
[2024-06-01 10:58:38] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-06-01 10:58:38] [INFO ] Redundant transitions in 7 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 10:58:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/141 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 122/263 variables, 141/160 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 2/265 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/313 variables, and 161 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5523 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 142/166 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/141 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 122/263 variables, 141/160 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 108/268 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 2/265 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/313 variables, and 281 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6581 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 142/166 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 12137ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 12141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12745 ms. Remains : 166/166 places, 147/147 transitions.
Computed a total of 166 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 147
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 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 48 ms :[(NOT p0)]
RANDOM walk for 473 steps (0 resets) in 5 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 148 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2024-06-01 10:58:51] [INFO ] Invariant cache hit.
[2024-06-01 10:58:51] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 36 ms returned sat
[2024-06-01 10:58:51] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-06-01 10:58:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:58:51] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 25 ms returned sat
[2024-06-01 10:58:52] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-06-01 10:58:52] [INFO ] Computed and/alt/rep : 109/115/109 causal constraints (skipped 11 transitions) in 11 ms.
[2024-06-01 10:58:52] [INFO ] Added : 63 causal constraints over 13 iterations in 244 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 910 reset in 175 ms.
Product exploration explored 100000 steps with 911 reset in 207 ms.
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 147/147 transitions.
Applied a total of 0 rules in 9 ms. Remains 166 /166 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-06-01 10:58:52] [INFO ] Invariant cache hit.
[2024-06-01 10:58:53] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 10:58:53] [INFO ] Invariant cache hit.
[2024-06-01 10:58:53] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-06-01 10:58:53] [INFO ] Redundant transitions in 8 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 10:58:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/141 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 122/263 variables, 141/160 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 2/265 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/313 variables, and 161 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5960 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 142/166 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 2/141 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 122/263 variables, 141/160 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 108/268 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 2/265 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/313 variables, and 281 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8723 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 142/166 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 14709ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 14712ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15296 ms. Remains : 166/166 places, 147/147 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-00 finished in 51600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 3 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 281 transition count 157
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 176 transition count 157
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 217 place count 169 transition count 150
Iterating global reduction 2 with 7 rules applied. Total rules applied 224 place count 169 transition count 150
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 228 place count 169 transition count 146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 232 place count 165 transition count 146
Applied a total of 232 rules in 22 ms. Remains 165 /295 variables (removed 130) and now considering 146/276 (removed 130) transitions.
// Phase 1: matrix 146 rows 165 cols
[2024-06-01 10:59:08] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 10:59:08] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 10:59:08] [INFO ] Invariant cache hit.
[2024-06-01 10:59:08] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-06-01 10:59:08] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 10:59:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 3/142 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 123/265 variables, 142/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/311 variables, and 161 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5670 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 142/165 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 3/142 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 123/265 variables, 142/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 120/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/311 variables, and 281 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6840 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 142/165 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 12530ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 12532ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/295 places, 146/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13017 ms. Remains : 165/295 places, 146/276 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-01
Product exploration explored 100000 steps with 619 reset in 313 ms.
Product exploration explored 100000 steps with 618 reset in 280 ms.
Computed a total of 165 stabilizing places and 146 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 165 transition count 146
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-01 finished in 13820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 289 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 289 transition count 270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 286 transition count 267
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 286 transition count 267
Applied a total of 18 rules in 13 ms. Remains 286 /295 variables (removed 9) and now considering 267/276 (removed 9) transitions.
// Phase 1: matrix 267 rows 286 cols
[2024-06-01 10:59:22] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 10:59:22] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-01 10:59:22] [INFO ] Invariant cache hit.
[2024-06-01 10:59:22] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-06-01 10:59:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 305 constraints, problems are : Problem set: 0 solved, 252 unsolved in 21935 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 252/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 557 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 52014ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 52019ms
Starting structural reductions in LTL mode, iteration 1 : 286/295 places, 267/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52835 ms. Remains : 286/295 places, 267/276 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-02 finished in 52986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 288 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 285 transition count 266
Applied a total of 20 rules in 15 ms. Remains 285 /295 variables (removed 10) and now considering 266/276 (removed 10) transitions.
// Phase 1: matrix 266 rows 285 cols
[2024-06-01 11:00:15] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 11:00:15] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 11:00:15] [INFO ] Invariant cache hit.
[2024-06-01 11:00:16] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-06-01 11:00:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 19093 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 49203ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 49207ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 266/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50413 ms. Remains : 285/295 places, 266/276 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-03
Product exploration explored 100000 steps with 481 reset in 427 ms.
Product exploration explored 100000 steps with 470 reset in 396 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 667 steps (0 resets) in 13 ms. (47 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 270 transition count 137
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 156 transition count 137
Applied a total of 228 rules in 12 ms. Remains 156 /285 variables (removed 129) and now considering 137/266 (removed 129) transitions.
// Phase 1: matrix 137 rows 156 cols
[2024-06-01 11:01:07] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 11:01:07] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-06-01 11:01:07] [INFO ] Invariant cache hit.
[2024-06-01 11:01:08] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2024-06-01 11:01:08] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:01:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/293 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5371 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/293 variables, and 256 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5389 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10780ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10783ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/285 places, 137/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11615 ms. Remains : 156/285 places, 137/266 transitions.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 341 steps (0 resets) in 14 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 954 reset in 282 ms.
Product exploration explored 100000 steps with 966 reset in 328 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 11 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-01 11:01:20] [INFO ] Invariant cache hit.
[2024-06-01 11:01:20] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-06-01 11:01:20] [INFO ] Invariant cache hit.
[2024-06-01 11:01:21] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-06-01 11:01:21] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:01:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/293 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5221 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/293 variables, and 256 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5653 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 10887ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10889ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11550 ms. Remains : 156/156 places, 137/137 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-03 finished in 77008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 13 places and 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 282 transition count 166
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 185 transition count 166
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 200 place count 179 transition count 160
Iterating global reduction 2 with 6 rules applied. Total rules applied 206 place count 179 transition count 160
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 209 place count 179 transition count 157
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 212 place count 176 transition count 157
Applied a total of 212 rules in 35 ms. Remains 176 /295 variables (removed 119) and now considering 157/276 (removed 119) transitions.
// Phase 1: matrix 157 rows 176 cols
[2024-06-01 11:01:32] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 11:01:32] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-06-01 11:01:32] [INFO ] Invariant cache hit.
[2024-06-01 11:01:32] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2024-06-01 11:01:32] [INFO ] Redundant transitions in 0 ms returned []
Running 133 sub problems to find dead transitions.
[2024-06-01 11:01:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 2/154 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 135/289 variables, 154/173 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/333 variables, and 173 constraints, problems are : Problem set: 0 solved, 133 unsolved in 7489 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 154/176 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 2/154 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 135/289 variables, 154/173 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 133/306 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/333 variables, and 306 constraints, problems are : Problem set: 0 solved, 133 unsolved in 9255 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 154/176 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 16775ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 16778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 176/295 places, 157/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17548 ms. Remains : 176/295 places, 157/276 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-04
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-04 finished in 17676 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 289 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 289 transition count 270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 286 transition count 267
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 286 transition count 267
Applied a total of 18 rules in 19 ms. Remains 286 /295 variables (removed 9) and now considering 267/276 (removed 9) transitions.
// Phase 1: matrix 267 rows 286 cols
[2024-06-01 11:01:49] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 11:01:50] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-06-01 11:01:50] [INFO ] Invariant cache hit.
[2024-06-01 11:01:50] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-06-01 11:01:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 305 constraints, problems are : Problem set: 0 solved, 252 unsolved in 22984 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 252/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 557 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 53090ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 53094ms
Starting structural reductions in LTL mode, iteration 1 : 286/295 places, 267/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54336 ms. Remains : 286/295 places, 267/276 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-05
Product exploration explored 100000 steps with 4249 reset in 304 ms.
Product exploration explored 100000 steps with 4288 reset in 338 ms.
Computed a total of 286 stabilizing places and 267 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 286 transition count 267
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-05 finished in 55192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 280 transition count 148
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 226 place count 167 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 231 place count 162 transition count 143
Iterating global reduction 2 with 5 rules applied. Total rules applied 236 place count 162 transition count 143
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 240 place count 162 transition count 139
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 244 place count 158 transition count 139
Applied a total of 244 rules in 15 ms. Remains 158 /295 variables (removed 137) and now considering 139/276 (removed 137) transitions.
// Phase 1: matrix 139 rows 158 cols
[2024-06-01 11:02:44] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 11:02:45] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 11:02:45] [INFO ] Invariant cache hit.
[2024-06-01 11:02:45] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-06-01 11:02:45] [INFO ] Redundant transitions in 0 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-01 11:02:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 2/131 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 116/247 variables, 131/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 4/251 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/251 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/297 variables, and 154 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4419 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 135/158 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 2/131 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 116/247 variables, 131/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 110/260 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 4/251 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/251 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/297 variables, and 264 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3986 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 135/158 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 8418ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 8419ms
Starting structural reductions in SI_LTL mode, iteration 1 : 158/295 places, 139/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9012 ms. Remains : 158/295 places, 139/276 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-06
Product exploration explored 100000 steps with 1032 reset in 177 ms.
Product exploration explored 100000 steps with 1058 reset in 202 ms.
Computed a total of 158 stabilizing places and 139 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 158 transition count 139
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-06 finished in 9565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (!F(X(X(X(!p1)))) U p2)))'
Support contains 6 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 289 transition count 270
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 289 transition count 270
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 286 transition count 267
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 286 transition count 267
Applied a total of 18 rules in 13 ms. Remains 286 /295 variables (removed 9) and now considering 267/276 (removed 9) transitions.
// Phase 1: matrix 267 rows 286 cols
[2024-06-01 11:02:54] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 11:02:54] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 11:02:54] [INFO ] Invariant cache hit.
[2024-06-01 11:02:55] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-06-01 11:02:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 305 constraints, problems are : Problem set: 0 solved, 252 unsolved in 14523 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 252/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 557 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 44600ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 44603ms
Starting structural reductions in LTL mode, iteration 1 : 286/295 places, 267/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45444 ms. Remains : 286/295 places, 267/276 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-07
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-07 finished in 45700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 13 places and 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 282 transition count 158
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 177 transition count 158
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 217 place count 170 transition count 151
Iterating global reduction 2 with 7 rules applied. Total rules applied 224 place count 170 transition count 151
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 228 place count 170 transition count 147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 232 place count 166 transition count 147
Applied a total of 232 rules in 24 ms. Remains 166 /295 variables (removed 129) and now considering 147/276 (removed 129) transitions.
// Phase 1: matrix 147 rows 166 cols
[2024-06-01 11:03:40] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 11:03:40] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 11:03:40] [INFO ] Invariant cache hit.
[2024-06-01 11:03:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 11:03:40] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-06-01 11:03:40] [INFO ] Redundant transitions in 1 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-01 11:03:40] [INFO ] Invariant cache hit.
[2024-06-01 11:03:40] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/267 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 2/269 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/313 variables, and 172 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7021 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 144/166 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/267 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 109/280 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 2/269 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/313 variables, and 293 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7339 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 144/166 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 14378ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 14379ms
Starting structural reductions in SI_LTL mode, iteration 1 : 166/295 places, 147/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14976 ms. Remains : 166/295 places, 147/276 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 4025 reset in 271 ms.
Product exploration explored 100000 steps with 4049 reset in 311 ms.
Computed a total of 166 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 147
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 131 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)]
RANDOM walk for 93 steps (0 resets) in 4 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 163 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)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-01 11:03:56] [INFO ] Invariant cache hit.
[2024-06-01 11:03:56] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 21 ms returned sat
[2024-06-01 11:03:56] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2024-06-01 11:03:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:03:57] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 25 ms returned sat
[2024-06-01 11:03:57] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2024-06-01 11:03:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 11:03:57] [INFO ] [Nat]Added 9 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:03:57] [INFO ] Computed and/alt/rep : 110/126/110 causal constraints (skipped 11 transitions) in 12 ms.
[2024-06-01 11:03:57] [INFO ] Added : 48 causal constraints over 10 iterations in 240 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 147/147 transitions.
Applied a total of 0 rules in 7 ms. Remains 166 /166 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-06-01 11:03:57] [INFO ] Invariant cache hit.
[2024-06-01 11:03:57] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 11:03:57] [INFO ] Invariant cache hit.
[2024-06-01 11:03:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 11:03:58] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-06-01 11:03:58] [INFO ] Redundant transitions in 1 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-01 11:03:58] [INFO ] Invariant cache hit.
[2024-06-01 11:03:58] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/267 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 2/269 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/313 variables, and 172 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7160 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 144/166 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/267 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 109/280 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 2/269 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/313 variables, and 293 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7066 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 144/166 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 14242ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 14244ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14785 ms. Remains : 166/166 places, 147/147 transitions.
Computed a total of 166 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 147
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 124 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 33 ms :[(NOT p0)]
RANDOM walk for 122 steps (0 resets) in 6 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 145 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 11:04:12] [INFO ] Invariant cache hit.
[2024-06-01 11:04:13] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 24 ms returned sat
[2024-06-01 11:04:13] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2024-06-01 11:04:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:04:13] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 26 ms returned sat
[2024-06-01 11:04:14] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2024-06-01 11:04:14] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 11:04:14] [INFO ] [Nat]Added 9 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:04:14] [INFO ] Computed and/alt/rep : 110/126/110 causal constraints (skipped 11 transitions) in 12 ms.
[2024-06-01 11:04:14] [INFO ] Added : 48 causal constraints over 10 iterations in 236 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4018 reset in 267 ms.
Product exploration explored 100000 steps with 4074 reset in 301 ms.
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 147/147 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2024-06-01 11:04:14] [INFO ] Invariant cache hit.
[2024-06-01 11:04:15] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 11:04:15] [INFO ] Invariant cache hit.
[2024-06-01 11:04:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 11:04:15] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2024-06-01 11:04:15] [INFO ] Redundant transitions in 0 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-01 11:04:15] [INFO ] Invariant cache hit.
[2024-06-01 11:04:15] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/267 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 2/269 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/313 variables, and 172 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6950 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 144/166 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/267 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 109/280 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 2/269 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 12/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/313 variables, and 293 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7344 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 144/166 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 14317ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 14318ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14884 ms. Remains : 166/166 places, 147/147 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-08 finished in 49672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 288 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 285 transition count 266
Applied a total of 20 rules in 13 ms. Remains 285 /295 variables (removed 10) and now considering 266/276 (removed 10) transitions.
// Phase 1: matrix 266 rows 285 cols
[2024-06-01 11:04:29] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 11:04:30] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 11:04:30] [INFO ] Invariant cache hit.
[2024-06-01 11:04:30] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-06-01 11:04:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 14474 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 44544ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 44547ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 266/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45472 ms. Remains : 285/295 places, 266/276 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-09
Product exploration explored 100000 steps with 1071 reset in 257 ms.
Product exploration explored 100000 steps with 1061 reset in 288 ms.
Computed a total of 285 stabilizing places and 266 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 266
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 358 steps (0 resets) in 6 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:05:16] [INFO ] Invariant cache hit.
[2024-06-01 11:05:16] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 38 ms returned sat
[2024-06-01 11:05:18] [INFO ] [Real]Absence check using state equation in 1509 ms returned sat
[2024-06-01 11:05:18] [INFO ] Computed and/alt/rep : 176/604/176 causal constraints (skipped 75 transitions) in 23 ms.
[2024-06-01 11:05:18] [INFO ] Added : 42 causal constraints over 9 iterations in 642 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 266/266 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 270 transition count 137
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 228 place count 156 transition count 137
Applied a total of 228 rules in 10 ms. Remains 156 /285 variables (removed 129) and now considering 137/266 (removed 129) transitions.
// Phase 1: matrix 137 rows 156 cols
[2024-06-01 11:05:19] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 11:05:19] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-01 11:05:19] [INFO ] Invariant cache hit.
[2024-06-01 11:05:19] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2024-06-01 11:05:19] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:05:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/293 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3470 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/293 variables, and 256 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3646 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7128ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/285 places, 137/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7668 ms. Remains : 156/285 places, 137/266 transitions.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 203 steps (0 resets) in 4 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:05:27] [INFO ] Invariant cache hit.
[2024-06-01 11:05:27] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 27 ms returned sat
[2024-06-01 11:05:27] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2024-06-01 11:05:27] [INFO ] Computed and/alt/rep : 108/113/108 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 11:05:27] [INFO ] Added : 3 causal constraints over 1 iterations in 59 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2272 reset in 242 ms.
Product exploration explored 100000 steps with 2276 reset in 276 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-01 11:05:28] [INFO ] Invariant cache hit.
[2024-06-01 11:05:28] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-01 11:05:28] [INFO ] Invariant cache hit.
[2024-06-01 11:05:28] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-06-01 11:05:28] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:05:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/293 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3514 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/293 variables, and 256 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3624 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7149ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7150ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7669 ms. Remains : 156/156 places, 137/137 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-09 finished in 66239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))||G(F(p0)))))'
Support contains 3 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 281 transition count 158
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 208 place count 177 transition count 158
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 215 place count 170 transition count 151
Iterating global reduction 2 with 7 rules applied. Total rules applied 222 place count 170 transition count 151
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 226 place count 170 transition count 147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 230 place count 166 transition count 147
Applied a total of 230 rules in 15 ms. Remains 166 /295 variables (removed 129) and now considering 147/276 (removed 129) transitions.
// Phase 1: matrix 147 rows 166 cols
[2024-06-01 11:05:36] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 11:05:36] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 11:05:36] [INFO ] Invariant cache hit.
[2024-06-01 11:05:36] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-06-01 11:05:36] [INFO ] Redundant transitions in 0 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-01 11:05:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/267 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/313 variables, and 162 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4115 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 143/166 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/267 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 121/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/313 variables, and 283 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4975 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 143/166 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 9106ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 9108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 166/295 places, 147/276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9681 ms. Remains : 166/295 places, 147/276 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-10
Product exploration explored 100000 steps with 912 reset in 196 ms.
Product exploration explored 100000 steps with 911 reset in 221 ms.
Computed a total of 166 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 147
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 459 steps (0 resets) in 17 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 11 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-15-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLFireability-10 finished in 10789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 288 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 285 transition count 266
Applied a total of 20 rules in 13 ms. Remains 285 /295 variables (removed 10) and now considering 266/276 (removed 10) transitions.
// Phase 1: matrix 266 rows 285 cols
[2024-06-01 11:05:46] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 11:05:47] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-06-01 11:05:47] [INFO ] Invariant cache hit.
[2024-06-01 11:05:47] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-06-01 11:05:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 14231 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 44303ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 44307ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 266/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45202 ms. Remains : 285/295 places, 266/276 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-13
Entered a terminal (fully accepting) state of product in 198 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-13 finished in 45300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((X(p0) U p1)||p1) U X((G(F(p3))&&p2))))))'
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 290 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 290 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 288 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 288 transition count 269
Applied a total of 14 rules in 11 ms. Remains 288 /295 variables (removed 7) and now considering 269/276 (removed 7) transitions.
// Phase 1: matrix 269 rows 288 cols
[2024-06-01 11:06:32] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 11:06:32] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 11:06:32] [INFO ] Invariant cache hit.
[2024-06-01 11:06:33] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-06-01 11:06:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 15/288 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 269/557 variables, 288/307 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 307 constraints, problems are : Problem set: 0 solved, 254 unsolved in 14853 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 15/288 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 269/557 variables, 288/307 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 254/561 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 557/557 variables, and 561 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 44926ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 44929ms
Starting structural reductions in LTL mode, iteration 1 : 288/295 places, 269/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45830 ms. Remains : 288/295 places, 269/276 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-14
Stuttering criterion allowed to conclude after 830 steps with 10 reset in 3 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-14 finished in 46218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))&&F(p2)))'
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 288 transition count 269
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 288 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 285 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 285 transition count 266
Applied a total of 20 rules in 12 ms. Remains 285 /295 variables (removed 10) and now considering 266/276 (removed 10) transitions.
// Phase 1: matrix 266 rows 285 cols
[2024-06-01 11:07:18] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 11:07:18] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-01 11:07:18] [INFO ] Invariant cache hit.
[2024-06-01 11:07:19] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-06-01 11:07:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 14189 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 44262ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 44265ms
Starting structural reductions in LTL mode, iteration 1 : 285/295 places, 266/276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45123 ms. Remains : 285/295 places, 266/276 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-15
Entered a terminal (fully accepting) state of product in 745 steps with 2 reset in 2 ms.
FORMULA HirschbergSinclair-PT-15-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLFireability-15 finished in 45303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-15-LTLFireability-03
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 280 transition count 148
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 226 place count 167 transition count 148
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 233 place count 160 transition count 141
Iterating global reduction 2 with 7 rules applied. Total rules applied 240 place count 160 transition count 141
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 244 place count 160 transition count 137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 248 place count 156 transition count 137
Applied a total of 248 rules in 16 ms. Remains 156 /295 variables (removed 139) and now considering 137/276 (removed 139) transitions.
// Phase 1: matrix 137 rows 156 cols
[2024-06-01 11:08:04] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 11:08:04] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-06-01 11:08:04] [INFO ] Invariant cache hit.
[2024-06-01 11:08:04] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 11:08:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/293 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3400 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/293 variables, and 256 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3656 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7069ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7070ms
Starting structural reductions in LI_LTL mode, iteration 1 : 156/295 places, 137/276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7647 ms. Remains : 156/295 places, 137/276 transitions.
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-03
Product exploration explored 100000 steps with 966 reset in 168 ms.
Product exploration explored 100000 steps with 967 reset in 195 ms.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 148 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 353 steps (0 resets) in 10 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-01 11:08:12] [INFO ] Invariant cache hit.
[2024-06-01 11:08:13] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-01 11:08:13] [INFO ] Invariant cache hit.
[2024-06-01 11:08:13] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-06-01 11:08:13] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:08:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/293 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3484 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/293 variables, and 256 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3682 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7178ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7180ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7744 ms. Remains : 156/156 places, 137/137 transitions.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 341 steps (0 resets) in 6 ms. (48 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 973 reset in 168 ms.
Product exploration explored 100000 steps with 968 reset in 195 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-01 11:08:21] [INFO ] Invariant cache hit.
[2024-06-01 11:08:21] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-01 11:08:21] [INFO ] Invariant cache hit.
[2024-06-01 11:08:22] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-06-01 11:08:22] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:08:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/293 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3485 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/293 variables, and 256 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3659 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7157ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7703 ms. Remains : 156/156 places, 137/137 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-03 finished in 25457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : HirschbergSinclair-PT-15-LTLFireability-09
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 295/295 places, 276/276 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 280 transition count 148
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 226 place count 167 transition count 148
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 233 place count 160 transition count 141
Iterating global reduction 2 with 7 rules applied. Total rules applied 240 place count 160 transition count 141
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 244 place count 160 transition count 137
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 248 place count 156 transition count 137
Applied a total of 248 rules in 12 ms. Remains 156 /295 variables (removed 139) and now considering 137/276 (removed 139) transitions.
// Phase 1: matrix 137 rows 156 cols
[2024-06-01 11:08:29] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 11:08:29] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 11:08:29] [INFO ] Invariant cache hit.
[2024-06-01 11:08:30] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 11:08:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/293 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3229 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/293 variables, and 256 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3551 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6791ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6793ms
Starting structural reductions in LI_LTL mode, iteration 1 : 156/295 places, 137/276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7289 ms. Remains : 156/295 places, 137/276 transitions.
Running random walk in product with property : HirschbergSinclair-PT-15-LTLFireability-09
Product exploration explored 100000 steps with 2270 reset in 242 ms.
Product exploration explored 100000 steps with 2262 reset in 274 ms.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 203 steps (0 resets) in 4 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:08:37] [INFO ] Invariant cache hit.
[2024-06-01 11:08:38] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 27 ms returned sat
[2024-06-01 11:08:38] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2024-06-01 11:08:38] [INFO ] Computed and/alt/rep : 108/113/108 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 11:08:38] [INFO ] Added : 3 causal constraints over 1 iterations in 57 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-01 11:08:38] [INFO ] Invariant cache hit.
[2024-06-01 11:08:38] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 11:08:38] [INFO ] Invariant cache hit.
[2024-06-01 11:08:38] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-06-01 11:08:38] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:08:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/293 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3317 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/293 variables, and 256 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3624 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6953ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6955ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7461 ms. Remains : 156/156 places, 137/137 transitions.
Computed a total of 156 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 156 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 210 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-06-01 11:08:46] [INFO ] Invariant cache hit.
[2024-06-01 11:08:46] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 28 ms returned sat
[2024-06-01 11:08:46] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2024-06-01 11:08:46] [INFO ] Computed and/alt/rep : 108/113/108 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 11:08:46] [INFO ] Added : 3 causal constraints over 1 iterations in 58 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2271 reset in 243 ms.
Product exploration explored 100000 steps with 2269 reset in 278 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-06-01 11:08:47] [INFO ] Invariant cache hit.
[2024-06-01 11:08:47] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 11:08:47] [INFO ] Invariant cache hit.
[2024-06-01 11:08:48] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-06-01 11:08:48] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:08:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/239 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/293 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3394 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 110/239 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/293 variables, and 256 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3608 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 129/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7015ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7016ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7531 ms. Remains : 156/156 places, 137/137 transitions.
Treatment of property HirschbergSinclair-PT-15-LTLFireability-09 finished in 25542 ms.
[2024-06-01 11:08:55] [INFO ] Flatten gal took : 23 ms
[2024-06-01 11:08:55] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 11:08:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 295 places, 276 transitions and 829 arcs took 9 ms.
Total runtime 695622 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA HirschbergSinclair-PT-15-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : HirschbergSinclair-PT-15-LTLFireability-03
Could not compute solution for formula : HirschbergSinclair-PT-15-LTLFireability-08
Could not compute solution for formula : HirschbergSinclair-PT-15-LTLFireability-09
BK_STOP 1717240750664
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name HirschbergSinclair-PT-15-LTLFireability-00
ltl formula formula --ltl=/tmp/1872/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 295 places, 276 transitions and 829 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1872/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1872/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1872/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1872/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 297 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 296, there are 278 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~217 levels ~10000 states ~30520 transitions
pnml2lts-mc( 0/ 4): ~216 levels ~20000 states ~64820 transitions
pnml2lts-mc( 0/ 4): ~216 levels ~40000 states ~137108 transitions
pnml2lts-mc( 0/ 4): ~216 levels ~80000 states ~277756 transitions
pnml2lts-mc( 0/ 4): ~216 levels ~160000 states ~631856 transitions
pnml2lts-mc( 0/ 4): ~216 levels ~320000 states ~1262672 transitions
pnml2lts-mc( 0/ 4): ~216 levels ~640000 states ~2791492 transitions
pnml2lts-mc( 1/ 4): ~217 levels ~1280000 states ~6015772 transitions
pnml2lts-mc( 0/ 4): ~216 levels ~2560000 states ~13232572 transitions
pnml2lts-mc( 1/ 4): ~217 levels ~5120000 states ~26628628 transitions
pnml2lts-mc( 1/ 4): ~217 levels ~10240000 states ~56576280 transitions
pnml2lts-mc( 1/ 4): ~217 levels ~20480000 states ~122076072 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33550020
pnml2lts-mc( 0/ 4): unique states count: 33550717
pnml2lts-mc( 0/ 4): unique transitions count: 230463331
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 196906922
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33551005
pnml2lts-mc( 0/ 4): - cum. max stack depth: 865
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33551005 states 230464302 transitions, fanout: 6.869
pnml2lts-mc( 0/ 4): Total exploration time 253.000 sec (252.970 sec minimum, 252.985 sec on average)
pnml2lts-mc( 0/ 4): States per second: 132613, Transitions per second: 910926
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 279.0MB, 8.7 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/36.0%
pnml2lts-mc( 0/ 4): Stored 279 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 279.0MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-15-LTLFireability-03
ltl formula formula --ltl=/tmp/1872/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 295 places, 276 transitions and 829 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1872/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1872/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1872/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1872/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 297 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 296, there are 280 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~291 levels ~10000 states ~22112 transitions
pnml2lts-mc( 3/ 4): ~295 levels ~20000 states ~48420 transitions
pnml2lts-mc( 3/ 4): ~295 levels ~40000 states ~103392 transitions
pnml2lts-mc( 3/ 4): ~295 levels ~80000 states ~236876 transitions
pnml2lts-mc( 3/ 4): ~295 levels ~160000 states ~501124 transitions
pnml2lts-mc( 3/ 4): ~295 levels ~320000 states ~1077472 transitions
pnml2lts-mc( 3/ 4): ~295 levels ~640000 states ~2438188 transitions
pnml2lts-mc( 2/ 4): ~295 levels ~1280000 states ~5078944 transitions
pnml2lts-mc( 3/ 4): ~295 levels ~2560000 states ~11087356 transitions
pnml2lts-mc( 2/ 4): ~295 levels ~5120000 states ~23818640 transitions
pnml2lts-mc( 2/ 4): ~295 levels ~10240000 states ~49698372 transitions
pnml2lts-mc( 3/ 4): ~295 levels ~20480000 states ~107027872 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33417072
pnml2lts-mc( 0/ 4): unique states count: 33417837
pnml2lts-mc( 0/ 4): unique transitions count: 188441811
pnml2lts-mc( 0/ 4): - self-loop count: 23106
pnml2lts-mc( 0/ 4): - claim dead count: 154998085
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33419867
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1182
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33419867 states 188445717 transitions, fanout: 5.639
pnml2lts-mc( 0/ 4): Total exploration time 238.890 sec (238.880 sec minimum, 238.888 sec on average)
pnml2lts-mc( 0/ 4): States per second: 139896, Transitions per second: 788839
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 319.0MB, 10.0 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 279 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 319.0MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-15-LTLFireability-08
ltl formula formula --ltl=/tmp/1872/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 295 places, 276 transitions and 829 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1872/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1872/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1872/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1872/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 297 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 296, there are 278 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~113 levels ~10000 states ~22848 transitions
pnml2lts-mc( 1/ 4): ~113 levels ~20000 states ~47028 transitions
pnml2lts-mc( 1/ 4): ~113 levels ~40000 states ~97800 transitions
pnml2lts-mc( 1/ 4): ~113 levels ~80000 states ~204596 transitions
pnml2lts-mc( 1/ 4): ~113 levels ~160000 states ~445488 transitions
pnml2lts-mc( 1/ 4): ~113 levels ~320000 states ~938796 transitions
pnml2lts-mc( 1/ 4): ~113 levels ~640000 states ~2040820 transitions
pnml2lts-mc( 1/ 4): ~113 levels ~1280000 states ~4146596 transitions
pnml2lts-mc( 1/ 4): ~113 levels ~2560000 states ~8911080 transitions
pnml2lts-mc( 1/ 4): ~113 levels ~5120000 states ~18596916 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8991585
pnml2lts-mc( 0/ 4): unique states count: 8991926
pnml2lts-mc( 0/ 4): unique transitions count: 34910635
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 25915116
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8991929
pnml2lts-mc( 0/ 4): - cum. max stack depth: 412
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8991929 states 34910727 transitions, fanout: 3.882
pnml2lts-mc( 0/ 4): Total exploration time 62.000 sec (61.970 sec minimum, 61.985 sec on average)
pnml2lts-mc( 0/ 4): States per second: 145031, Transitions per second: 563076
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 132.6MB, 15.5 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 26.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 279 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 132.6MB (~256.0MB paged-in)
ltl formula name HirschbergSinclair-PT-15-LTLFireability-09
ltl formula formula --ltl=/tmp/1872/ltl_3_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 295 places, 276 transitions and 829 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1872/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1872/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1872/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1872/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 297 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 296, there are 279 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~106 levels ~10000 states ~26748 transitions
pnml2lts-mc( 0/ 4): ~106 levels ~20000 states ~52376 transitions
pnml2lts-mc( 2/ 4): ~105 levels ~40000 states ~106420 transitions
pnml2lts-mc( 2/ 4): ~105 levels ~80000 states ~220436 transitions
pnml2lts-mc( 0/ 4): ~106 levels ~160000 states ~463528 transitions
pnml2lts-mc( 0/ 4): ~106 levels ~320000 states ~981772 transitions
pnml2lts-mc( 0/ 4): ~106 levels ~640000 states ~2042204 transitions
pnml2lts-mc( 0/ 4): ~106 levels ~1280000 states ~4275832 transitions
pnml2lts-mc( 0/ 4): ~106 levels ~2560000 states ~8779408 transitions
pnml2lts-mc( 0/ 4): ~106 levels ~5120000 states ~18364996 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7769428
pnml2lts-mc( 0/ 4): unique states count: 7769778
pnml2lts-mc( 0/ 4): unique transitions count: 46486526
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 38710882
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7769781
pnml2lts-mc( 0/ 4): - cum. max stack depth: 421
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7769781 states 46486572 transitions, fanout: 5.983
pnml2lts-mc( 0/ 4): Total exploration time 59.520 sec (59.490 sec minimum, 59.507 sec on average)
pnml2lts-mc( 0/ 4): States per second: 130541, Transitions per second: 781024
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 123.3MB, 16.6 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 23.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 279 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 123.3MB (~256.0MB paged-in)
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="HirschbergSinclair-PT-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HirschbergSinclair-PT-15, 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 r500-smll-171649587400076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-15.tgz
mv HirschbergSinclair-PT-15 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 ;