ton chain2 (K-LD feature benchmark)¶
| suite id | ld_ton_chain2 |
| domain | manufacturing |
| language | LD-textual |
| difficulty | easy |
| validation status | candidate |
| origin | authored |
| license | CC-BY-4.0 |
K-LD executable-semantics feature suite (rung10_wp2/family)
What is proved¶
From benchmarks/manufacturing/ld_ton_chain2/props.yaml. What each kind claims, and what it becomes on either route, is on The properties we prove.
| id | kind | claim | requirement |
|---|---|---|---|
P1 |
mutual_exclusion |
never true together: P1, P2 |
The two timed phases are mutually exclusive: a sequential chain never overlaps. |
Variants¶
| file | expected verdict | violates | method |
|---|---|---|---|
ton_chain2.ld |
SAFE | none | expert |
Files¶
| file | what it is | size | sha256 |
|---|---|---|---|
benchmark.yml |
benchmark metadata | 0.5 KB | b55c0ae6219f |
props.yaml |
property file | 0.2 KB | bbda16dff2a8 |
ton_chain2.ld |
ladder program, textual DSL | 0.2 KB | 3b87b6bd80cf |
Recorded runs¶
A task can carry two routes. ld is ESBMC's ladder front end reading the program directly. via C is the same solver reached through Beremiz and MatIEC, which is the only route that reaches ST, IL, FBD and SFC; see How ESBMC-PLC works.
No ESBMC run is recorded against this task yet. The lessons carry the recorded runs; see Reproducing to make your own.