About the Execution of ITS-Tools for BridgeAndVehicles-COL-V10P10N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1438710.00 | 0.00 | 0.00 | FTTFTFTTTTFFTTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853764600170.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is BridgeAndVehicles-COL-V10P10N10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853764600170
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 38K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-00
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-01
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-02
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-03
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-04
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-05
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-06
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-07
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-08
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-09
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-10
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-11
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-12
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-13
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-14
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-15
=== Now, execution of the tool begins
BK_START 1748738334808
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V10P10N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLFireability COL
Running Version 202505121319
[2025-06-01 00:38:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 00:38:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 00:38:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-01 00:38:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 00:38:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1297 ms
[2025-06-01 00:38:58] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 48 PT places and 5438.0 transition bindings in 43 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
[2025-06-01 00:38:58] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 8 ms.
[2025-06-01 00:38:58] [INFO ] Skeletonized 5 HLPN properties in 3 ms. Removed 11 properties that had guard overlaps.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 11)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 11) 11) 11)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2025-06-01 00:38:59] [INFO ] Unfolded HLPN to a Petri net with 48 places and 288 transitions 2090 arcs in 76 ms.
[2025-06-01 00:38:59] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Support contains 46 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 288
Applied a total of 2 rules in 53 ms. Remains 46 /48 variables (removed 2) and now considering 288/288 (removed 0) transitions.
Running 285 sub problems to find dead transitions.
[2025-06-01 00:38:59] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2025-06-01 00:38:59] [INFO ] Computed 5 invariants in 9 ms
[2025-06-01 00:38:59] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:39:01] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:39:02] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 4 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 265 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 3 (OVERLAPS) 90/136 variables, 46/53 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 22/75 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/75 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 0/136 variables, 0/75 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 75 constraints, problems are : Problem set: 22 solved, 263 unsolved in 13834 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 90/136 variables, 46/53 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 22/75 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 263/338 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/338 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/338 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 338 constraints, problems are : Problem set: 22 solved, 263 unsolved in 19014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 263/285 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33460ms problems are : Problem set: 22 solved, 263 unsolved
Search for dead transitions found 22 dead transitions in 33495ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 22 transitions.
[2025-06-01 00:39:32] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2025-06-01 00:39:32] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:39:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-01 00:39:32] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:39:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:39:33] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/48 places, 266/288 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33779 ms. Remains : 46/48 places, 266/288 transitions.
Support contains 46 out of 46 places after structural reductions.
[2025-06-01 00:39:33] [INFO ] Flatten gal took : 157 ms
[2025-06-01 00:39:34] [INFO ] Flatten gal took : 71 ms
[2025-06-01 00:39:34] [INFO ] Input system was already deterministic with 266 transitions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (443 resets) in 4190 ms. (9 steps per ms) remains 7/29 properties
BEST_FIRST walk for 40001 steps (180 resets) in 954 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (155 resets) in 740 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (216 resets) in 442 ms. (90 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (200 resets) in 477 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (202 resets) in 294 ms. (135 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (216 resets) in 570 ms. (70 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (196 resets) in 300 ms. (132 steps per ms) remains 7/7 properties
[2025-06-01 00:39:37] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:39:37] [INFO ] Invariant cache hit.
[2025-06-01 00:39:37] [INFO ] State equation strengthened by 20 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Real declared 46/132 variables, and 6 constraints, problems are : Problem set: 7 solved, 0 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/46 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 00:39:37] [INFO ] Flatten gal took : 31 ms
[2025-06-01 00:39:37] [INFO ] Flatten gal took : 52 ms
[2025-06-01 00:39:37] [INFO ] Input system was already deterministic with 266 transitions.
Computed a total of 29 stabilizing places and 42 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 265
Applied a total of 2 rules in 10 ms. Remains 45 /46 variables (removed 1) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:39:37] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2025-06-01 00:39:37] [INFO ] Computed 7 invariants in 3 ms
[2025-06-01 00:39:37] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:39:38] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7712 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:39:51] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27932ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 27935ms
[2025-06-01 00:40:05] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:40:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:40:05] [INFO ] Implicit Places using invariants in 100 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 265/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28052 ms. Remains : 44/46 places, 265/266 transitions.
[2025-06-01 00:40:05] [INFO ] Flatten gal took : 19 ms
[2025-06-01 00:40:05] [INFO ] Flatten gal took : 28 ms
[2025-06-01 00:40:05] [INFO ] Input system was already deterministic with 265 transitions.
[2025-06-01 00:40:05] [INFO ] Flatten gal took : 17 ms
[2025-06-01 00:40:05] [INFO ] Flatten gal took : 17 ms
[2025-06-01 00:40:05] [INFO ] Time to serialize gal into /tmp/CTLFireability8135930222410084303.gal : 14 ms
[2025-06-01 00:40:05] [INFO ] Time to serialize properties into /tmp/CTLFireability11975795159774791960.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8135930222410084303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11975795159774791960.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,20.8439,463044,2,133149,5,623344,6,0,443,816624,0
Converting to forward existential form...Done !
original formula: AG((E(AX(AX(((((((NB_ATTENTE_B_9>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1)))||(((NB_ATTENTE_B_8>=1)&&(ROUTE_B>=1))||((NB_ATT...1924
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(!(EX(!(!(EX(!(((((((NB_ATTENTE_B_9>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=...2171
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-01 00:40:36] [INFO ] Flatten gal took : 37 ms
[2025-06-01 00:40:36] [INFO ] Applying decomposition
[2025-06-01 00:40:36] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4926912296729884627.txt' '-o' '/tmp/graph4926912296729884627.bin' '-w' '/tmp/graph4926912296729884627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4926912296729884627.bin' '-l' '-1' '-v' '-w' '/tmp/graph4926912296729884627.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:40:36] [INFO ] Decomposing Gal with order
[2025-06-01 00:40:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:40:36] [INFO ] Removed a total of 606 redundant transitions.
[2025-06-01 00:40:36] [INFO ] Flatten gal took : 116 ms
[2025-06-01 00:40:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 15 ms.
[2025-06-01 00:40:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11327257505259924373.gal : 4 ms
[2025-06-01 00:40:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8372628622879120742.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11327257505259924373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8372628622879120742.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,0.596701,20732,540,510,25998,5405,163,83166,124,21809,0
Converting to forward existential form...Done !
original formula: AG((E(AX(AX(((((((i2.u5.NB_ATTENTE_B_9>=1)&&(i2.u2.ROUTE_B>=1))||((i2.u2.NB_ATTENTE_B_3>=1)&&(i2.u2.ROUTE_B>=1)))||(((i2.u5.NB_ATTENTE_B_...2500
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(!(EX(!(!(EX(!(((((((i2.u5.NB_ATTENTE_B_9>=1)&&(i2.u2.ROUTE_B>=1))||((i2.u2.NB_ATTENTE_B...2854
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t23, t53, t106, t112, t146, t152, t230, t234, i0.u0.t10, i1.t54, Intersection ...239
(forward)formula 0,1,21.2458,275212,1,0,324279,110633,944,1.77163e+06,779,577369,261243
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 265
Applied a total of 2 rules in 4 ms. Remains 45 /46 variables (removed 1) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:40:57] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:40:57] [INFO ] Invariant cache hit.
[2025-06-01 00:40:57] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:40:59] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:41:02] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 9177 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29352ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 29355ms
[2025-06-01 00:41:27] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:41:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:41:27] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-01 00:41:27] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:41:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:41:27] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:41:27] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:41:27] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:41:27] [INFO ] Invariant cache hit.
[2025-06-01 00:41:27] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:41:28] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:41:31] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10462 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 21872 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32485ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 32487ms
Starting structural reductions in LTL mode, iteration 1 : 45/46 places, 265/266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61959 ms. Remains : 45/46 places, 265/266 transitions.
[2025-06-01 00:41:59] [INFO ] Flatten gal took : 19 ms
[2025-06-01 00:41:59] [INFO ] Flatten gal took : 28 ms
[2025-06-01 00:41:59] [INFO ] Input system was already deterministic with 265 transitions.
[2025-06-01 00:41:59] [INFO ] Flatten gal took : 26 ms
[2025-06-01 00:41:59] [INFO ] Flatten gal took : 25 ms
[2025-06-01 00:41:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17786160521203422606.gal : 8 ms
[2025-06-01 00:41:59] [INFO ] Time to serialize properties into /tmp/CTLFireability12875027468906660465.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17786160521203422606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12875027468906660465.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 00:42:30] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:42:30] [INFO ] Applying decomposition
[2025-06-01 00:42:30] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12380802338340857025.txt' '-o' '/tmp/graph12380802338340857025.bin' '-w' '/tmp/graph12380802338340857025.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12380802338340857025.bin' '-l' '-1' '-v' '-w' '/tmp/graph12380802338340857025.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:42:30] [INFO ] Decomposing Gal with order
[2025-06-01 00:42:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:42:30] [INFO ] Removed a total of 578 redundant transitions.
[2025-06-01 00:42:30] [INFO ] Flatten gal took : 55 ms
[2025-06-01 00:42:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 7 ms.
[2025-06-01 00:42:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2019567570744803929.gal : 2 ms
[2025-06-01 00:42:30] [INFO ] Time to serialize properties into /tmp/CTLFireability10897371400065088597.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2019567570744803929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10897371400065088597.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,1.75245,43280,1956,619,55491,5338,182,247390,115,32831,0
Converting to forward existential form...Done !
original formula: AX(((A(AG((!(((((((i0.u5.NB_ATTENTE_B_9>=1)&&(i1.u4.ROUTE_B>=1))||((i1.u4.NB_ATTENTE_B_3>=1)&&(i1.u4.ROUTE_B>=1)))||(((i0.u5.NB_ATTENTE_B...5224
=> equivalent forward existential formula: ([((EY(Init) * !((!((E(!((((i1.u2.CAPACITE>=10)&&(i0.u5.VIDANGE_1>=1))||((i1.u2.CAPACITE>=10)&&(i2.u3.VIDANGE_0>...7495
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t23, t54, t140, t150, t193, t194, t243, t244, i0.t152, i0.t72, i0.t53, i1.u2.t1...256
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 265
Applied a total of 2 rules in 4 ms. Remains 45 /46 variables (removed 1) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:43:00] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:43:00] [INFO ] Invariant cache hit.
[2025-06-01 00:43:00] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:43:01] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:43:04] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10939 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31091ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 31092ms
[2025-06-01 00:43:31] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:43:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:43:31] [INFO ] Implicit Places using invariants in 65 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 265/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31168 ms. Remains : 43/46 places, 265/266 transitions.
[2025-06-01 00:43:31] [INFO ] Flatten gal took : 20 ms
[2025-06-01 00:43:31] [INFO ] Flatten gal took : 27 ms
[2025-06-01 00:43:31] [INFO ] Input system was already deterministic with 265 transitions.
[2025-06-01 00:43:31] [INFO ] Flatten gal took : 28 ms
[2025-06-01 00:43:31] [INFO ] Flatten gal took : 27 ms
[2025-06-01 00:43:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10946512755188972922.gal : 8 ms
[2025-06-01 00:43:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9801778432998093681.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10946512755188972922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9801778432998093681.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,27.4653,494976,2,57587,5,794249,6,0,439,987797,0
Converting to forward existential form...Done !
original formula: A(!(AF(((((((NB_ATTENTE_A_8>=1)&&(ROUTE_A>=1))||((NB_ATTENTE_A_7>=1)&&(ROUTE_A>=1)))||(((NB_ATTENTE_A_9>=1)&&(ROUTE_A>=1))||((NB_ATTENTE_...28990
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((((((!(EX(!(E(TRUE U ((((((((((NB_ATTENTE_A_8>=1)&&(NB_ATTENTE_B_0>=1))&&((CONTROLEUR_1>=1...65217
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-01 00:44:01] [INFO ] Flatten gal took : 18 ms
[2025-06-01 00:44:01] [INFO ] Applying decomposition
[2025-06-01 00:44:01] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14027603550877254975.txt' '-o' '/tmp/graph14027603550877254975.bin' '-w' '/tmp/graph14027603550877254975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14027603550877254975.bin' '-l' '-1' '-v' '-w' '/tmp/graph14027603550877254975.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:44:01] [INFO ] Decomposing Gal with order
[2025-06-01 00:44:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:44:02] [INFO ] Removed a total of 523 redundant transitions.
[2025-06-01 00:44:02] [INFO ] Flatten gal took : 124 ms
[2025-06-01 00:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 24 ms.
[2025-06-01 00:44:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12330031347394868202.gal : 3 ms
[2025-06-01 00:44:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12456761421555048467.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12330031347394868202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12456761421555048467.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,3.26946,62204,1744,970,48955,17368,150,285186,138,278932,0
Converting to forward existential form...Done !
original formula: A(!(AF(((((((u3.NB_ATTENTE_A_8>=1)&&(u3.ROUTE_A>=1))||((u3.NB_ATTENTE_A_7>=1)&&(u3.ROUTE_A>=1)))||(((u3.NB_ATTENTE_A_9>=1)&&(u3.ROUTE_A>=...35020
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((((((!(EX(!(E(TRUE U ((((((((((u3.NB_ATTENTE_A_8>=1)&&(u3.NB_ATTENTE_B_0>=1))&&((u3.CONTRO...81673
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t23, t54, t99, t149, t159, t164, i0.t153, i0.t103, i0.t53, i2.u0.t10, Intersec...244
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 33 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:44:32] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2025-06-01 00:44:32] [INFO ] Computed 7 invariants in 3 ms
[2025-06-01 00:44:32] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:44:33] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:44:41] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/132 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 14061 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34295ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 34296ms
[2025-06-01 00:45:06] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:45:06] [INFO ] Implicit Places using invariants in 82 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/46 places, 266/266 transitions.
Applied a total of 0 rules in 19 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 34434 ms. Remains : 45/46 places, 266/266 transitions.
[2025-06-01 00:45:06] [INFO ] Flatten gal took : 10 ms
[2025-06-01 00:45:06] [INFO ] Flatten gal took : 12 ms
[2025-06-01 00:45:06] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-01 00:45:06] [INFO ] Flatten gal took : 15 ms
[2025-06-01 00:45:06] [INFO ] Flatten gal took : 13 ms
[2025-06-01 00:45:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9266323141264965293.gal : 2 ms
[2025-06-01 00:45:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16606693939852878416.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9266323141264965293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16606693939852878416.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,17.2774,328988,2,121585,5,435998,6,0,448,533487,0
Converting to forward existential form...Done !
original formula: !(E((EG(!((((((((CAPACITE>=1)&&(NB_ATTENTE_B_9>=1))&&((ATTENTE_B>=1)&&(CONTROLEUR_1>=1)))||(((CAPACITE>=1)&&(NB_ATTENTE_B_8>=1))&&((ATTEN...11865
=> equivalent forward existential formula: [(FwdU(Init,(EG(!((((((((CAPACITE>=1)&&(NB_ATTENTE_B_9>=1))&&((ATTENTE_B>=1)&&(CONTROLEUR_1>=1)))||(((CAPACITE>=...8614
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-01 00:45:36] [INFO ] Flatten gal took : 13 ms
[2025-06-01 00:45:36] [INFO ] Applying decomposition
[2025-06-01 00:45:36] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13919437345889739510.txt' '-o' '/tmp/graph13919437345889739510.bin' '-w' '/tmp/graph13919437345889739510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13919437345889739510.bin' '-l' '-1' '-v' '-w' '/tmp/graph13919437345889739510.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:45:36] [INFO ] Decomposing Gal with order
[2025-06-01 00:45:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:45:36] [INFO ] Removed a total of 515 redundant transitions.
[2025-06-01 00:45:36] [INFO ] Flatten gal took : 52 ms
[2025-06-01 00:45:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 5 ms.
[2025-06-01 00:45:36] [INFO ] Time to serialize gal into /tmp/CTLFireability13409235572140583719.gal : 1 ms
[2025-06-01 00:45:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6379174384917772564.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13409235572140583719.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6379174384917772564.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,1.60635,40120,844,886,34085,16806,154,92912,148,263251,0
Converting to forward existential form...Done !
original formula: !(E((EG(!((((((((i0.u0.CAPACITE>=1)&&(i2.u4.NB_ATTENTE_B_9>=1))&&((i0.u1.ATTENTE_B>=1)&&(u3.CONTROLEUR_1>=1)))||(((i0.u0.CAPACITE>=1)&&(i...15219
=> equivalent forward existential formula: [(FwdU(Init,(EG(!((((((((i0.u0.CAPACITE>=1)&&(i2.u4.NB_ATTENTE_B_9>=1))&&((i0.u1.ATTENTE_B>=1)&&(u3.CONTROLEUR_1...15291
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t24, t55, t56, t146, t166, t175, i0.u0.t10, i0.u0.t23, i2.t153, i2.t143, i2.t54...255
(forward)formula 0,1,4.0877,68408,1,0,69326,30627,857,217078,939,263251,93957
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:45:41] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:45:41] [INFO ] Invariant cache hit.
[2025-06-01 00:45:41] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:45:42] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 74 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/337 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:45:57] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30338ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 30339ms
[2025-06-01 00:46:11] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:46:11] [INFO ] Implicit Places using invariants in 80 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/46 places, 266/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30427 ms. Remains : 45/46 places, 266/266 transitions.
[2025-06-01 00:46:11] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:46:11] [INFO ] Flatten gal took : 19 ms
[2025-06-01 00:46:11] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-01 00:46:11] [INFO ] Flatten gal took : 18 ms
[2025-06-01 00:46:11] [INFO ] Flatten gal took : 19 ms
[2025-06-01 00:46:11] [INFO ] Time to serialize gal into /tmp/CTLFireability7654548712165067673.gal : 4 ms
[2025-06-01 00:46:11] [INFO ] Time to serialize properties into /tmp/CTLFireability7175333272310119884.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7654548712165067673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7175333272310119884.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,16.3309,328524,2,121585,5,435998,6,0,448,533487,0
Converting to forward existential form...Done !
original formula: EF((AX((((((((((SUR_PONT_A>=1)&&(((((((CAPACITE>=1)&&(NB_ATTENTE_B_9>=1))&&((ATTENTE_B>=1)&&(CONTROLEUR_1>=1)))||(((CAPACITE>=1)&&(NB_ATT...11492
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (SUR_PONT_B>=1)) * !(EX(!((((((((((SUR_PONT_A>=1)&&(((((((CAPACITE>=1)&&(NB_ATTENTE_B_9>=1)...8987
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 00:46:41] [INFO ] Flatten gal took : 11 ms
[2025-06-01 00:46:41] [INFO ] Applying decomposition
[2025-06-01 00:46:41] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4479369094452721483.txt' '-o' '/tmp/graph4479369094452721483.bin' '-w' '/tmp/graph4479369094452721483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4479369094452721483.bin' '-l' '-1' '-v' '-w' '/tmp/graph4479369094452721483.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:46:41] [INFO ] Decomposing Gal with order
[2025-06-01 00:46:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:46:41] [INFO ] Removed a total of 515 redundant transitions.
[2025-06-01 00:46:41] [INFO ] Flatten gal took : 53 ms
[2025-06-01 00:46:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 4 ms.
[2025-06-01 00:46:41] [INFO ] Time to serialize gal into /tmp/CTLFireability13950558127925094515.gal : 2 ms
[2025-06-01 00:46:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13599353014840908123.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13950558127925094515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13599353014840908123.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,3.67365,72004,1087,1149,118986,19250,165,234533,145,239204,0
Converting to forward existential form...Done !
original formula: EF((AX((((((((((i0.u0.SUR_PONT_A>=1)&&(((((((i0.u0.CAPACITE>=1)&&(i0.u2.NB_ATTENTE_B_9>=1))&&((i0.u2.ATTENTE_B>=1)&&(u1.CONTROLEUR_1>=1))...13739
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (i0.u0.SUR_PONT_B>=1)) * !(EX(!((((((((((i0.u0.SUR_PONT_A>=1)&&(((((((i0.u0.CAPACITE>=1)&&(...13797
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t24, t55, t92, t152, t229, t235, i0.u0.t10, i0.u0.t23, i2.t146, i2.t66, i2.t54,...254
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 11 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:47:11] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:47:11] [INFO ] Invariant cache hit.
[2025-06-01 00:47:11] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:47:13] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 74 constraints, problems are : Problem set: 0 solved, 263 unsolved in 9659 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/337 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:47:27] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29959ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 29960ms
[2025-06-01 00:47:41] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:47:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:47:42] [INFO ] Implicit Places using invariants in 94 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/46 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30071 ms. Remains : 45/46 places, 266/266 transitions.
[2025-06-01 00:47:42] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:47:42] [INFO ] Flatten gal took : 20 ms
[2025-06-01 00:47:42] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-01 00:47:42] [INFO ] Flatten gal took : 18 ms
[2025-06-01 00:47:42] [INFO ] Flatten gal took : 19 ms
[2025-06-01 00:47:42] [INFO ] Time to serialize gal into /tmp/CTLFireability17125047046368601316.gal : 3 ms
[2025-06-01 00:47:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8711684378771119757.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17125047046368601316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8711684378771119757.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,20.4104,405568,2,119801,5,518455,6,0,448,703923,0
Converting to forward existential form...Done !
original formula: E(A(!((EG((((((((CAPACITE<1)||(NB_ATTENTE_A_7<1))||((ATTENTE_A<1)||(CONTROLEUR_0<1)))&&(((CAPACITE<1)||(NB_ATTENTE_A_10<1))||((ATTENTE_A<...13435
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,!((E(!(!(E(TRUE U !(((!(((((((NB_ATTENTE_B_9>=1)&&(ROUTE_B>=1))||((NB_ATTENTE_B_3>=1)&&...68484
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-01 00:48:12] [INFO ] Flatten gal took : 13 ms
[2025-06-01 00:48:12] [INFO ] Applying decomposition
[2025-06-01 00:48:12] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2637113274899092545.txt' '-o' '/tmp/graph2637113274899092545.bin' '-w' '/tmp/graph2637113274899092545.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2637113274899092545.bin' '-l' '-1' '-v' '-w' '/tmp/graph2637113274899092545.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:48:12] [INFO ] Decomposing Gal with order
[2025-06-01 00:48:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:48:12] [INFO ] Removed a total of 585 redundant transitions.
[2025-06-01 00:48:12] [INFO ] Flatten gal took : 36 ms
[2025-06-01 00:48:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 6 ms.
[2025-06-01 00:48:12] [INFO ] Time to serialize gal into /tmp/CTLFireability7372833578004398064.gal : 1 ms
[2025-06-01 00:48:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14457761921181945197.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7372833578004398064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14457761921181945197.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,2.7396,59760,1091,709,100381,12545,198,225944,124,77684,0
Converting to forward existential form...Done !
original formula: E(A(!((EG((((((((i0.u2.CAPACITE<1)||(i0.u0.NB_ATTENTE_A_7<1))||((i0.u0.ATTENTE_A<1)||(i1.u5.CONTROLEUR_0<1)))&&(((i0.u2.CAPACITE<1)||(i2....17329
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,!((E(!(!(E(TRUE U !(((!(((((((i1.u5.NB_ATTENTE_B_9>=1)&&(i1.u1.ROUTE_B>=1))||((i1.u1.NB...89930
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t24, t54, t86, t94, t146, t154, t179, t185, i0.u2.t10, i0.u2.t23, i2.t255, i2.t...266
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 265
Applied a total of 2 rules in 9 ms. Remains 45 /46 variables (removed 1) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:48:42] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2025-06-01 00:48:42] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:48:42] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:48:44] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 10053 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:49:00] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30353ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 30356ms
[2025-06-01 00:49:12] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:49:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:49:12] [INFO ] Implicit Places using invariants in 181 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 183 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 265/266 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30555 ms. Remains : 43/46 places, 265/266 transitions.
[2025-06-01 00:49:13] [INFO ] Flatten gal took : 12 ms
[2025-06-01 00:49:13] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:49:13] [INFO ] Input system was already deterministic with 265 transitions.
[2025-06-01 00:49:13] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:49:13] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:49:13] [INFO ] Time to serialize gal into /tmp/CTLFireability14882202340771150530.gal : 4 ms
[2025-06-01 00:49:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2503216754692463219.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14882202340771150530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2503216754692463219.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,27.3104,496396,2,57587,5,794249,6,0,439,987797,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-01 00:49:43] [INFO ] Flatten gal took : 9 ms
[2025-06-01 00:49:43] [INFO ] Applying decomposition
[2025-06-01 00:49:43] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5833244757987830320.txt' '-o' '/tmp/graph5833244757987830320.bin' '-w' '/tmp/graph5833244757987830320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5833244757987830320.bin' '-l' '-1' '-v' '-w' '/tmp/graph5833244757987830320.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:49:43] [INFO ] Decomposing Gal with order
[2025-06-01 00:49:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:49:43] [INFO ] Removed a total of 523 redundant transitions.
[2025-06-01 00:49:43] [INFO ] Flatten gal took : 31 ms
[2025-06-01 00:49:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 4 ms.
[2025-06-01 00:49:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15919474196089501974.gal : 1 ms
[2025-06-01 00:49:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15552475464950544033.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15919474196089501974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15552475464950544033.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,2.22315,59656,721,1005,78429,21326,145,303984,136,139498,0
Converting to forward existential form...Done !
original formula: AX(EG(E(!((((((((i1.u2.CHOIX_0<1)||(i2.u3.COMPTEUR_2<1))&&((i1.u2.CHOIX_0<1)||(i2.u3.COMPTEUR_3<1)))&&(((i1.u2.CHOIX_0<1)||(i2.u3.COMPTEU...1827
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(!((((((((i1.u2.CHOIX_0<1)||(i2.u3.COMPTEUR_2<1))&&((i1.u2.CHOIX_0<1)||(i2.u3.COMPTEUR_3<1)))...1874
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t23, t53, t76, t146, t187, t194, i1.u2.t10, i2.t254, i2.t253, i2.t54, Intersec...244
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 265
Applied a total of 2 rules in 3 ms. Remains 45 /46 variables (removed 1) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:50:13] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:50:13] [INFO ] Invariant cache hit.
[2025-06-01 00:50:13] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:50:14] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:50:19] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 12439 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32629ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 32630ms
[2025-06-01 00:50:45] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:50:46] [INFO ] Implicit Places using invariants in 111 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 265/266 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32751 ms. Remains : 43/46 places, 265/266 transitions.
[2025-06-01 00:50:46] [INFO ] Flatten gal took : 13 ms
[2025-06-01 00:50:46] [INFO ] Flatten gal took : 18 ms
[2025-06-01 00:50:46] [INFO ] Input system was already deterministic with 265 transitions.
[2025-06-01 00:50:46] [INFO ] Flatten gal took : 16 ms
[2025-06-01 00:50:46] [INFO ] Flatten gal took : 16 ms
[2025-06-01 00:50:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5061785435647847448.gal : 3 ms
[2025-06-01 00:50:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13327296992669174606.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5061785435647847448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13327296992669174606.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,24.5841,496496,2,57587,5,794249,6,0,439,987797,0
Converting to forward existential form...Done !
original formula: A(EX(!((((CHOIX_0>=1)&&(COMPTEUR_10>=1))||((CHOIX_1>=1)&&(COMPTEUR_10>=1))))) U (AX((A(EX((((CAPACITE>=10)&&(VIDANGE_1>=1))||((CAPACITE>=...10633
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((!((E(!(((((CHOIX_0>=1)&&(COMPTEUR_10>=1))||((CHOIX_1>=1)&&(COMPTEUR_10>=1)))||(((CAPAC...87670
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-01 00:51:16] [INFO ] Flatten gal took : 23 ms
[2025-06-01 00:51:16] [INFO ] Applying decomposition
[2025-06-01 00:51:16] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8444345160795071480.txt' '-o' '/tmp/graph8444345160795071480.bin' '-w' '/tmp/graph8444345160795071480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8444345160795071480.bin' '-l' '-1' '-v' '-w' '/tmp/graph8444345160795071480.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:51:16] [INFO ] Decomposing Gal with order
[2025-06-01 00:51:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:51:16] [INFO ] Removed a total of 523 redundant transitions.
[2025-06-01 00:51:16] [INFO ] Flatten gal took : 35 ms
[2025-06-01 00:51:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 4 ms.
[2025-06-01 00:51:16] [INFO ] Time to serialize gal into /tmp/CTLFireability1861433382828280607.gal : 1 ms
[2025-06-01 00:51:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3040402616111805296.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1861433382828280607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3040402616111805296.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,27.2758,292768,932,1190,90815,32939,143,2.85596e+06,136,607068,0
Converting to forward existential form...Done !
original formula: A(EX(!((((u2.CHOIX_0>=1)&&(i2.u0.COMPTEUR_10>=1))||((i1.u3.CHOIX_1>=1)&&(i2.u0.COMPTEUR_10>=1))))) U (AX((A(EX((((u2.CAPACITE>=10)&&(i2.u...13615
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((!((E(!(((((u2.CHOIX_0>=1)&&(i2.u0.COMPTEUR_10>=1))||((i1.u3.CHOIX_1>=1)&&(i2.u0.COMPTE...114746
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t23, t53, t54, t190, t194, t250, t254, u2.t10, i2.t148, i2.t68, Intersection w...238
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 24 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:51:46] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2025-06-01 00:51:46] [INFO ] Computed 7 invariants in 3 ms
[2025-06-01 00:51:46] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:51:48] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:51:55] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 5 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/132 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 13935 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34223ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 34225ms
[2025-06-01 00:52:20] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:52:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:52:20] [INFO ] Implicit Places using invariants in 122 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 45/46 places, 266/266 transitions.
Applied a total of 0 rules in 21 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 34407 ms. Remains : 45/46 places, 266/266 transitions.
[2025-06-01 00:52:20] [INFO ] Flatten gal took : 11 ms
[2025-06-01 00:52:20] [INFO ] Flatten gal took : 13 ms
[2025-06-01 00:52:20] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-01 00:52:20] [INFO ] Flatten gal took : 12 ms
[2025-06-01 00:52:20] [INFO ] Flatten gal took : 13 ms
[2025-06-01 00:52:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11895677687248181769.gal : 4 ms
[2025-06-01 00:52:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5144681859892259820.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11895677687248181769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5144681859892259820.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,16.5527,328152,2,121585,5,435998,6,0,448,533487,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-01 00:52:51] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:52:51] [INFO ] Applying decomposition
[2025-06-01 00:52:51] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17329895587273631234.txt' '-o' '/tmp/graph17329895587273631234.bin' '-w' '/tmp/graph17329895587273631234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17329895587273631234.bin' '-l' '-1' '-v' '-w' '/tmp/graph17329895587273631234.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:52:51] [INFO ] Decomposing Gal with order
[2025-06-01 00:52:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:52:51] [INFO ] Removed a total of 605 redundant transitions.
[2025-06-01 00:52:51] [INFO ] Flatten gal took : 41 ms
[2025-06-01 00:52:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 5 ms.
[2025-06-01 00:52:51] [INFO ] Time to serialize gal into /tmp/CTLFireability2283364686400820334.gal : 1 ms
[2025-06-01 00:52:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15529179258559333966.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2283364686400820334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15529179258559333966.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,1.43009,38928,883,595,59734,8805,169,142830,125,63219,0
Converting to forward existential form...Done !
original formula: AF(((((AF(((((((i0.u0.SUR_PONT_B<1)&&((i2.u5.CHOIX_0<1)||(i2.u3.COMPTEUR_2<1)))&&(((i2.u5.CHOIX_0<1)||(i2.u3.COMPTEUR_3<1))&&((i2.u5.CHOI...1981
=> equivalent forward existential formula: [FwdG(Init,!(((((!(EG(!(((((((i0.u0.SUR_PONT_B<1)&&((i2.u5.CHOIX_0<1)||(i2.u3.COMPTEUR_2<1)))&&(((i2.u5.CHOIX_0<...2032
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t24, t55, t92, t152, t209, t215, i0.u0.t10, i0.u0.t23, i2.t153, i2.t73, i2.t54,...254
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
dead was empty
(forward)formula 0,1,17.355,328992,1,0,471070,129996,915,1.65414e+06,779,952540,252115
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 265
Applied a total of 2 rules in 19 ms. Remains 45 /46 variables (removed 1) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:53:08] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2025-06-01 00:53:08] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:53:08] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:53:09] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:53:13] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 11599 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31783ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 31785ms
[2025-06-01 00:53:40] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:53:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:53:40] [INFO ] Implicit Places using invariants in 111 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 113 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/46 places, 265/266 transitions.
Applied a total of 0 rules in 14 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 31931 ms. Remains : 43/46 places, 265/266 transitions.
[2025-06-01 00:53:40] [INFO ] Flatten gal took : 11 ms
[2025-06-01 00:53:40] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:53:40] [INFO ] Input system was already deterministic with 265 transitions.
[2025-06-01 00:53:40] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:53:40] [INFO ] Flatten gal took : 15 ms
[2025-06-01 00:53:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17353639014125489064.gal : 3 ms
[2025-06-01 00:53:40] [INFO ] Time to serialize properties into /tmp/CTLFireability6080408183239704455.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17353639014125489064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6080408183239704455.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,164516,15.6249,307228,2,31504,5,558016,6,0,439,566927,0
Converting to forward existential form...Done !
original formula: AG(E((EG(AF((SUR_PONT_A>=1))) + !(EG(!((((((((CHOIX_0<1)||(COMPTEUR_2<1))&&((CHOIX_0<1)||(COMPTEUR_3<1)))&&(((CHOIX_0<1)||(COMPTEUR_0<1))...10199
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((EG(!(EG(!((SUR_PONT_A>=1))))) + !(EG(!((((((((CHOIX_0<1)||(COMPTEUR_2<1))&&((CHOIX_0<1)...10259
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56,...1342
Detected timeout of ITS tools.
[2025-06-01 00:54:10] [INFO ] Flatten gal took : 9 ms
[2025-06-01 00:54:10] [INFO ] Applying decomposition
[2025-06-01 00:54:10] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7940870702280638556.txt' '-o' '/tmp/graph7940870702280638556.bin' '-w' '/tmp/graph7940870702280638556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7940870702280638556.bin' '-l' '-1' '-v' '-w' '/tmp/graph7940870702280638556.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:54:10] [INFO ] Decomposing Gal with order
[2025-06-01 00:54:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:54:10] [INFO ] Removed a total of 604 redundant transitions.
[2025-06-01 00:54:10] [INFO ] Flatten gal took : 31 ms
[2025-06-01 00:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 8 ms.
[2025-06-01 00:54:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2569772044274277529.gal : 2 ms
[2025-06-01 00:54:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5835319963146539341.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2569772044274277529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5835319963146539341.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,164516,0.795736,21440,583,506,27811,5466,159,68745,118,22033,0
Converting to forward existential form...Done !
original formula: AG(E((EG(AF((i0.u2.SUR_PONT_A>=1))) + !(EG(!((((((((i1.u0.CHOIX_0<1)||(i1.u3.COMPTEUR_2<1))&&((i1.u0.CHOIX_0<1)||(i1.u3.COMPTEUR_3<1)))&&...13085
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((EG(!(EG(!((i0.u2.SUR_PONT_A>=1))))) + !(EG(!((((((((i1.u0.CHOIX_0<1)||(i1.u3.COMPTEUR_2...13145
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t13, t44, t108, t138, t191, t194, t211, t214, t255, t262, i0.u2.t10, i1.t43, I...251
(forward)formula 0,0,10.1808,200536,1,0,216001,82303,1294,1.26182e+06,706,421943,175548
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:54:21] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2025-06-01 00:54:21] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:54:21] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:54:22] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:54:29] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/132 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 14111 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34270ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 34271ms
[2025-06-01 00:54:55] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:54:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:54:55] [INFO ] Implicit Places using invariants in 134 ms returned [13, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 136 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34418 ms. Remains : 44/46 places, 266/266 transitions.
[2025-06-01 00:54:55] [INFO ] Flatten gal took : 11 ms
[2025-06-01 00:54:55] [INFO ] Flatten gal took : 12 ms
[2025-06-01 00:54:55] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-01 00:54:55] [INFO ] Flatten gal took : 60 ms
[2025-06-01 00:54:55] [INFO ] Flatten gal took : 12 ms
[2025-06-01 00:54:55] [INFO ] Time to serialize gal into /tmp/CTLFireability17115672139543114041.gal : 4 ms
[2025-06-01 00:54:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16332042662267038324.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17115672139543114041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16332042662267038324.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,19.4536,405872,2,55429,5,730037,6,0,444,742884,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-01 00:55:25] [INFO ] Flatten gal took : 8 ms
[2025-06-01 00:55:25] [INFO ] Applying decomposition
[2025-06-01 00:55:25] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11898945476539549378.txt' '-o' '/tmp/graph11898945476539549378.bin' '-w' '/tmp/graph11898945476539549378.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11898945476539549378.bin' '-l' '-1' '-v' '-w' '/tmp/graph11898945476539549378.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:55:25] [INFO ] Decomposing Gal with order
[2025-06-01 00:55:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:55:25] [INFO ] Removed a total of 454 redundant transitions.
[2025-06-01 00:55:25] [INFO ] Flatten gal took : 51 ms
[2025-06-01 00:55:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 3 ms.
[2025-06-01 00:55:25] [INFO ] Time to serialize gal into /tmp/CTLFireability837719768008380952.gal : 1 ms
[2025-06-01 00:55:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13901802316955750737.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability837719768008380952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13901802316955750737.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,2.64161,64580,687,1372,39339,26631,104,285123,140,444410,0
Converting to forward existential form...Done !
original formula: (EG(AX((u0.SUR_PONT_B<1))) + EX((EG(A(!((((((((u0.CHOIX_0<1)||(i2.u1.COMPTEUR_2<1))&&((u0.CHOIX_0<1)||(i2.u1.COMPTEUR_3<1)))&&(((u0.CHOIX...1423
=> equivalent forward existential formula: ([FwdG(Init,!(EX(!((u0.SUR_PONT_B<1)))))] != FALSE + [FwdG((EY(Init) * EG(!((E(!((u0.SUR_PONT_A>=1)) U (!(!(((((...1555
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t24, t54, t55, t60, t150, u0.t10, u0.t23, i2.t205, i2.t199, Intersection with ...234
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 00:55:55] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:55:55] [INFO ] Invariant cache hit.
[2025-06-01 00:55:55] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:55:57] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 74 constraints, problems are : Problem set: 0 solved, 263 unsolved in 10050 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/337 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:56:13] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30244ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 30245ms
[2025-06-01 00:56:26] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 00:56:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:56:26] [INFO ] Implicit Places using invariants in 107 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/46 places, 266/266 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30361 ms. Remains : 45/46 places, 266/266 transitions.
[2025-06-01 00:56:26] [INFO ] Flatten gal took : 10 ms
[2025-06-01 00:56:26] [INFO ] Flatten gal took : 18 ms
[2025-06-01 00:56:26] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-01 00:56:26] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:56:26] [INFO ] Flatten gal took : 22 ms
[2025-06-01 00:56:26] [INFO ] Time to serialize gal into /tmp/CTLFireability9690977928691653991.gal : 4 ms
[2025-06-01 00:56:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13889594150483342791.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9690977928691653991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13889594150483342791.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,18.7055,405608,2,119801,5,518455,6,0,448,703923,0
Converting to forward existential form...Done !
original formula: !(E(AX(EF((SUR_PONT_B>=1))) U EG((!(EX(!((((((((CAPACITE<1)||(NB_ATTENTE_A_7<1))||((ATTENTE_A<1)||(CONTROLEUR_0<1)))&&(((CAPACITE<1)||(NB...2231
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EX(!(E(TRUE U (SUR_PONT_B>=1)))))),(!(EX(!((((((((CAPACITE<1)||(NB_ATTENTE_A_7<1))||((ATTENTE_...1864
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 00:56:56] [INFO ] Flatten gal took : 8 ms
[2025-06-01 00:56:56] [INFO ] Applying decomposition
[2025-06-01 00:56:56] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6223411110928798129.txt' '-o' '/tmp/graph6223411110928798129.bin' '-w' '/tmp/graph6223411110928798129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6223411110928798129.bin' '-l' '-1' '-v' '-w' '/tmp/graph6223411110928798129.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:56:56] [INFO ] Decomposing Gal with order
[2025-06-01 00:56:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:56:56] [INFO ] Removed a total of 586 redundant transitions.
[2025-06-01 00:56:56] [INFO ] Flatten gal took : 29 ms
[2025-06-01 00:56:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 3 ms.
[2025-06-01 00:56:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17443674483358154564.gal : 1 ms
[2025-06-01 00:56:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7397120465056859024.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17443674483358154564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7397120465056859024.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,1.37332,37812,894,591,59501,8324,189,134182,125,56284,0
Converting to forward existential form...Done !
original formula: !(E(AX(EF((i0.u0.SUR_PONT_B>=1))) U EG((!(EX(!((((((((i0.u0.CAPACITE<1)||(i0.u1.NB_ATTENTE_A_7<1))||((i0.u1.ATTENTE_A<1)||(i1.u5.CONTROLE...2957
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EX(!(E(TRUE U (i0.u0.SUR_PONT_B>=1)))))),(!(EX(!((((((((i0.u0.CAPACITE<1)||(i0.u1.NB_ATTENTE_A...5018
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t24, t54, t57, t62, t147, t152, t216, t225, i0.u0.t10, i0.u0.t23, i2.t245, i2.t...266
dead was empty
(forward)formula 0,1,28.8563,483372,1,0,828205,110252,1005,2.0491e+06,759,697893,538632
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 265
Applied a total of 2 rules in 12 ms. Remains 45 /46 variables (removed 1) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:57:25] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2025-06-01 00:57:25] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:57:25] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:57:26] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 9734 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:57:42] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29899ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 29900ms
[2025-06-01 00:57:55] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:57:55] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-01 00:57:55] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 00:57:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-01 00:57:55] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 00:57:55] [INFO ] Redundant transitions in 22 ms returned []
Running 262 sub problems to find dead transitions.
[2025-06-01 00:57:55] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 00:57:55] [INFO ] Invariant cache hit.
[2025-06-01 00:57:55] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:57:56] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:58:01] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 12161 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 28102 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40473ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 40474ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/46 places, 265/266 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70561 ms. Remains : 45/46 places, 265/266 transitions.
[2025-06-01 00:58:36] [INFO ] Flatten gal took : 11 ms
[2025-06-01 00:58:36] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:58:36] [INFO ] Input system was already deterministic with 265 transitions.
[2025-06-01 00:58:36] [INFO ] Flatten gal took : 14 ms
[2025-06-01 00:58:36] [INFO ] Flatten gal took : 15 ms
[2025-06-01 00:58:36] [INFO ] Time to serialize gal into /tmp/CTLFireability2248548117612150881.gal : 3 ms
[2025-06-01 00:58:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12999489729718365847.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2248548117612150881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12999489729718365847.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-01 00:59:06] [INFO ] Flatten gal took : 10 ms
[2025-06-01 00:59:06] [INFO ] Applying decomposition
[2025-06-01 00:59:06] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph53587356517765083.txt' '-o' '/tmp/graph53587356517765083.bin' '-w' '/tmp/graph53587356517765083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph53587356517765083.bin' '-l' '-1' '-v' '-w' '/tmp/graph53587356517765083.weights' '-q' '0' '-e' '0.001'
[2025-06-01 00:59:06] [INFO ] Decomposing Gal with order
[2025-06-01 00:59:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 00:59:06] [INFO ] Removed a total of 496 redundant transitions.
[2025-06-01 00:59:06] [INFO ] Flatten gal took : 44 ms
[2025-06-01 00:59:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 2 ms.
[2025-06-01 00:59:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2748141501891896519.gal : 1 ms
[2025-06-01 00:59:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17862470984900309432.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2748141501891896519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17862470984900309432.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,1.36296,30860,5290,1118,45146,4579,152,117877,157,30634,0
Converting to forward existential form...Done !
original formula: !(A(((((!(AG((((i1.u2.CAPACITE>=10)&&(i0.u5.VIDANGE_1>=1))||((i1.u2.CAPACITE>=10)&&(u4.VIDANGE_0>=1))))) + (((i1.u2.CAPACITE>=1)&&(i0.u5....17207
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(((((((((((i0.u5.NB_ATTENTE_A_0>=1)&&(i0.u5.NB_ATTENTE_B_5>=1))&&((i0.u0.CONTROLEUR_0>=1)&&(i0...41548
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t23, t54, t185, t194, t225, t234, i0.t67, i0.t53, i1.u2.t10, Intersection with...235
(forward)formula 0,1,28.5429,380016,1,0,609059,31612,2109,1.3957e+06,1169,193642,825340
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 265
Applied a total of 2 rules in 21 ms. Remains 45 /46 variables (removed 1) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2025-06-01 00:59:35] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2025-06-01 00:59:35] [INFO ] Computed 7 invariants in 1 ms
[2025-06-01 00:59:35] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:59:36] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 00:59:40] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 11535 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31706ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 31707ms
[2025-06-01 01:00:06] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2025-06-01 01:00:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:00:06] [INFO ] Implicit Places using invariants in 90 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/46 places, 265/266 transitions.
Applied a total of 0 rules in 14 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 31837 ms. Remains : 43/46 places, 265/266 transitions.
[2025-06-01 01:00:06] [INFO ] Flatten gal took : 12 ms
[2025-06-01 01:00:06] [INFO ] Flatten gal took : 15 ms
[2025-06-01 01:00:06] [INFO ] Input system was already deterministic with 265 transitions.
[2025-06-01 01:00:06] [INFO ] Flatten gal took : 14 ms
[2025-06-01 01:00:06] [INFO ] Flatten gal took : 15 ms
[2025-06-01 01:00:06] [INFO ] Time to serialize gal into /tmp/CTLFireability16860092367737647019.gal : 3 ms
[2025-06-01 01:00:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12664348478296791852.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16860092367737647019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12664348478296791852.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,164516,16.7472,306080,2,31504,5,558016,6,0,439,566927,0
Converting to forward existential form...Done !
original formula: AF((EG(((SUR_PONT_A>=1)&&((((((((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_5>=1))&&((CONTROLEUR_0>=1)&&(COMPTEUR_6>=1)))||(((NB_ATTENTE_A_0>=1)...9953
=> equivalent forward existential formula: [FwdG(Init,!((EG(((SUR_PONT_A>=1)&&((((((((((NB_ATTENTE_A_0>=1)&&(NB_ATTENTE_B_5>=1))&&((CONTROLEUR_0>=1)&&(COMP...6430
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-01 01:00:36] [INFO ] Flatten gal took : 9 ms
[2025-06-01 01:00:36] [INFO ] Applying decomposition
[2025-06-01 01:00:37] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11413024874222820312.txt' '-o' '/tmp/graph11413024874222820312.bin' '-w' '/tmp/graph11413024874222820312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11413024874222820312.bin' '-l' '-1' '-v' '-w' '/tmp/graph11413024874222820312.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:00:37] [INFO ] Decomposing Gal with order
[2025-06-01 01:00:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:00:37] [INFO ] Removed a total of 523 redundant transitions.
[2025-06-01 01:00:37] [INFO ] Flatten gal took : 56 ms
[2025-06-01 01:00:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 3 ms.
[2025-06-01 01:00:37] [INFO ] Time to serialize gal into /tmp/CTLFireability1154641352087133555.gal : 2 ms
[2025-06-01 01:00:37] [INFO ] Time to serialize properties into /tmp/CTLFireability6400863953399396453.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1154641352087133555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6400863953399396453.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,164516,0.957379,31172,657,1034,38088,17031,146,112140,138,92073,0
Converting to forward existential form...Done !
original formula: AF((EG(((u0.SUR_PONT_A>=1)&&((((((((((i2.u4.NB_ATTENTE_A_0>=1)&&(i2.u2.NB_ATTENTE_B_5>=1))&&((i2.u4.CONTROLEUR_0>=1)&&(i1.u1.COMPTEUR_6>=...12728
=> equivalent forward existential formula: [FwdG(Init,!((EG(((u0.SUR_PONT_A>=1)&&((((((((((i2.u4.NB_ATTENTE_A_0>=1)&&(i2.u2.NB_ATTENTE_B_5>=1))&&((i2.u4.CO...12773
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t13, t43, t44, t45, t54, t135, t144, t255, t257, t263, u0.t10, i1.t164, i1.t161...255
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,20.0091,284564,1,0,330640,109528,1290,1.8533e+06,864,912424,319117
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 266/266 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2025-06-01 01:00:57] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2025-06-01 01:00:57] [INFO ] Computed 7 invariants in 9 ms
[2025-06-01 01:00:57] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:00:58] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 01:01:05] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 4 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/132 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 13854 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 132/132 variables, and 338 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34036ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 34037ms
[2025-06-01 01:01:31] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2025-06-01 01:01:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 01:01:31] [INFO ] Implicit Places using invariants in 86 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/46 places, 266/266 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34133 ms. Remains : 45/46 places, 266/266 transitions.
[2025-06-01 01:01:31] [INFO ] Flatten gal took : 11 ms
[2025-06-01 01:01:31] [INFO ] Flatten gal took : 13 ms
[2025-06-01 01:01:31] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-01 01:01:31] [INFO ] Flatten gal took : 13 ms
[2025-06-01 01:01:31] [INFO ] Flatten gal took : 13 ms
[2025-06-01 01:01:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9933128346311792020.gal : 3 ms
[2025-06-01 01:01:31] [INFO ] Time to serialize properties into /tmp/CTLFireability6528951555702610472.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9933128346311792020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6528951555702610472.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,18.7069,405612,2,119801,5,518455,6,0,448,703923,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-01 01:02:01] [INFO ] Flatten gal took : 8 ms
[2025-06-01 01:02:01] [INFO ] Applying decomposition
[2025-06-01 01:02:01] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5904505483648833680.txt' '-o' '/tmp/graph5904505483648833680.bin' '-w' '/tmp/graph5904505483648833680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5904505483648833680.bin' '-l' '-1' '-v' '-w' '/tmp/graph5904505483648833680.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:02:01] [INFO ] Decomposing Gal with order
[2025-06-01 01:02:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:02:01] [INFO ] Removed a total of 605 redundant transitions.
[2025-06-01 01:02:01] [INFO ] Flatten gal took : 24 ms
[2025-06-01 01:02:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 2 ms.
[2025-06-01 01:02:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14491749186072757630.gal : 1 ms
[2025-06-01 01:02:01] [INFO ] Time to serialize properties into /tmp/CTLFireability16464843842611833520.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14491749186072757630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16464843842611833520.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,0.589485,15712,732,591,22719,4410,151,23045,125,23833,0
Converting to forward existential form...Done !
original formula: AF(!(E(((((((u2.NB_ATTENTE_B_9>=1)&&(u2.ROUTE_B>=1))||((u2.NB_ATTENTE_B_3>=1)&&(u2.ROUTE_B>=1)))||(((u2.NB_ATTENTE_B_8>=1)&&(u2.ROUTE_B>=...1632
=> equivalent forward existential formula: [FwdG(Init,!(!(E(((((((u2.NB_ATTENTE_B_9>=1)&&(u2.ROUTE_B>=1))||((u2.NB_ATTENTE_B_3>=1)&&(u2.ROUTE_B>=1)))||(((u...1689
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t24, t55, t71, t151, t217, t225, t237, t245, i0.u0.t10, i0.u0.t23, i3.t54, Int...249
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
dead was empty
(forward)formula 0,1,7.0818,161368,1,0,275753,74612,847,367953,807,605484,251490
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
[2025-06-01 01:02:08] [INFO ] Flatten gal took : 35 ms
[2025-06-01 01:02:08] [INFO ] Flatten gal took : 35 ms
[2025-06-01 01:02:08] [INFO ] Applying decomposition
[2025-06-01 01:02:09] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5660140583318399734.txt' '-o' '/tmp/graph5660140583318399734.bin' '-w' '/tmp/graph5660140583318399734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5660140583318399734.bin' '-l' '-1' '-v' '-w' '/tmp/graph5660140583318399734.weights' '-q' '0' '-e' '0.001'
[2025-06-01 01:02:09] [INFO ] Decomposing Gal with order
[2025-06-01 01:02:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 01:02:09] [INFO ] Removed a total of 577 redundant transitions.
[2025-06-01 01:02:09] [INFO ] Flatten gal took : 74 ms
[2025-06-01 01:02:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 3 ms.
[2025-06-01 01:02:09] [INFO ] Time to serialize gal into /tmp/CTLFireability9792651344531793695.gal : 2 ms
[2025-06-01 01:02:09] [INFO ] Time to serialize properties into /tmp/CTLFireability14918239914256993882.ctl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9792651344531793695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14918239914256993882.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,1.09647,25276,783,456,32729,4060,184,101160,116,17498,0
Converting to forward existential form...Done !
original formula: AX(((A(AG((!(((((((i2.u5.NB_ATTENTE_B_9>=1)&&(i2.u3.ROUTE_B>=1))||((i2.u3.NB_ATTENTE_B_3>=1)&&(i2.u3.ROUTE_B>=1)))||(((i2.u5.NB_ATTENTE_B...5224
=> equivalent forward existential formula: ([((EY(Init) * !((!((E(!((((i0.u0.CAPACITE>=10)&&(i2.u5.VIDANGE_1>=1))||((i0.u0.CAPACITE>=10)&&(i1.u4.VIDANGE_0>...7495
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t24, t54, t92, t95, t152, t155, t219, t225, i0.u0.t10, i0.u0.t23, i1.t245, i1.t...266
(forward)formula 0,1,21.6776,277008,1,0,347447,53661,1272,1.80317e+06,774,316434,323696
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A(!(AF(((((((i1.u4.NB_ATTENTE_A_8>=1)&&(i0.u1.ROUTE_A>=1))||((i0.u1.NB_ATTENTE_A_7>=1)&&(i0.u1.ROUTE_A>=1)))||(((i1.u4.NB_ATTENTE_A_9>=1)...37066
=> equivalent forward existential formula: [((Init * !(EG(!(EG((((((((!(EX(!(E(TRUE U ((((((((((i1.u4.NB_ATTENTE_A_8>=1)&&(i1.u4.NB_ATTENTE_B_0>=1))&&((i1....85699
(forward)formula 1,0,24.9939,318480,1,0,389413,62463,2610,2.10658e+06,882,370196,363916
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((AX((((((((((i0.u0.SUR_PONT_A>=1)&&(((((((i0.u0.CAPACITE>=1)&&(i2.u5.NB_ATTENTE_B_9>=1))&&((i2.u3.ATTENTE_B>=1)&&(i1.u4.CONTROLEUR_1>=...14762
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (i0.u0.SUR_PONT_B>=1)) * !(EX(!((((((((((i0.u0.SUR_PONT_A>=1)&&(((((((i0.u0.CAPACITE>=1)&&(...14820
(forward)formula 2,0,25.0833,318480,1,0,389434,62463,2793,2.10669e+06,894,370196,364323
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(A(!((EG((((((((i0.u0.CAPACITE<1)||(i0.u1.NB_ATTENTE_A_7<1))||((i0.u1.ATTENTE_A<1)||(i2.u5.CONTROLEUR_0<1)))&&(((i0.u0.CAPACITE<1)||(i1....17329
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,!((E(!(!(E(TRUE U !(((!(((((((i2.u5.NB_ATTENTE_B_9>=1)&&(i2.u3.ROUTE_B>=1))||((i2.u3.NB...89930
(forward)formula 3,1,41.7603,515584,1,0,663613,86730,3025,3.28354e+06,923,523769,559446
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AX(EG(E(!((((((((i2.u5.CHOIX_0<1)||(i1.u2.COMPTEUR_2<1))&&((i2.u5.CHOIX_0<1)||(i1.u2.COMPTEUR_3<1)))&&(((i2.u5.CHOIX_0<1)||(i1.u2.COMPTEU...1827
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(!((((((((i2.u5.CHOIX_0<1)||(i1.u2.COMPTEUR_2<1))&&((i2.u5.CHOIX_0<1)||(i1.u2.COMPTEUR_3<1)))...1874
(forward)formula 4,1,41.9132,517120,1,0,665116,86774,3035,3.28687e+06,923,524128,564325
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A(EX(!((((i2.u5.CHOIX_0>=1)&&(i1.u2.COMPTEUR_10>=1))||((i1.u4.CHOIX_1>=1)&&(i1.u2.COMPTEUR_10>=1))))) U (AX((A(EX((((i0.u0.CAPACITE>=10)&...13633
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((!((E(!(((((i2.u5.CHOIX_0>=1)&&(i1.u2.COMPTEUR_10>=1))||((i1.u4.CHOIX_1>=1)&&(i1.u2.COM...114848
(forward)formula 5,1,43.4369,530304,1,0,686842,88793,3056,3.324e+06,923,531494,583907
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EG(AX((i0.u0.SUR_PONT_B<1))) + EX((EG(A(!((((((((i2.u5.CHOIX_0<1)||(i1.u2.COMPTEUR_2<1))&&((i2.u5.CHOIX_0<1)||(i1.u2.COMPTEUR_3<1)))&&((...1552
=> equivalent forward existential formula: ([FwdG(Init,!(EX(!((i0.u0.SUR_PONT_B<1)))))] != FALSE + [FwdG((EY(Init) * EG(!((E(!((i0.u0.SUR_PONT_A>=1)) U (!(...1690
dead was empty
(forward)formula 6,0,43.9575,536320,1,0,694998,88921,3080,3.33981e+06,923,532606,593681
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Total runtime 1436192 ms.
BK_STOP 1748739773518
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V10P10N10"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V10P10N10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-smll-174853764600170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V10P10N10.tgz
mv BridgeAndVehicles-COL-V10P10N10 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;