Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁) → l1(0, X₁)
t₁: l1(X₀, X₁) → l1(X₀+1, X₁-1) :|: 1 ≤ X₁
t₂: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ 0
Eliminate variables {X₀} that do not contribute to the problem
Found invariant X₁ ≤ 0 for location l2
Start: l0
Program_Vars: X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₇: l0(X₁) → l1(X₁)
t₈: l1(X₁) → l1(X₁-1) :|: 1 ≤ X₁
t₉: l1(X₁) → l2(X₁) :|: X₁ ≤ 0
Found invariant X₁ ≤ 0 for location l2
Termination: true
Formula:
relevant size-bounds w.r.t. t₇:
X₁: X₁ {O(n)}
Runtime-bound of t₇: 1 {O(1)}
Results in: 2⋅X₁+4 {O(n)}
Overall timebound:2⋅X₁+6 {O(n)}
t₇: 1 {O(1)}
t₈: 2⋅X₁+4 {O(n)}
t₉: 1 {O(1)}
Overall costbound: 2⋅X₁+6 {O(n)}
t₇: 1 {O(1)}
t₈: 2⋅X₁+4 {O(n)}
t₉: 1 {O(1)}
t₇, X₁: X₁ {O(n)}
t₈, X₁: X₁ {O(n)}
t₉, X₁: 2⋅X₁ {O(n)}