Tree
Program Position
a := *;
(?a > 0; t := 0)
++ (b := 3; ?a + b < x)
++ (b := 5)
++ (?x > 2; b := 7);
{x' = v, v' = a}
Proof Progress
[*] | [:=] | [++] | [?] | [:=] | |
---|---|---|---|---|---|
Current | |||||
Alternative 1 | |||||
Alternative 2 |