Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: l0, l1, l2
Transitions:
t₂: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l1(X₀+X₂, X₁, X₂-1) :|: 1 ≤ X₀
t₀: l1(X₀, X₁, X₂) → l2(X₀, D, X₂) :|: X₀ ≤ 0
Eliminate variables {D,X₁} that do not contribute to the problem
Found invariant X₀ ≤ 0 for location l2
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₆: l0(X₀, X₁) → l1(X₀, X₁)
t₇: l1(X₀, X₁) → l1(X₀+X₁, X₁-1) :|: 1 ≤ X₀
t₈: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 0
new bound:
8⋅X₀+8⋅X₁+9 {O(n)}
Overall timebound:8⋅X₀+8⋅X₁+11 {O(n)}
t₆: 1 {O(1)}
t₇: 8⋅X₀+8⋅X₁+9 {O(n)}
t₈: 1 {O(1)}
Overall costbound: 8⋅X₀+8⋅X₁+11 {O(n)}
t₆: 1 {O(1)}
t₇: 8⋅X₀+8⋅X₁+9 {O(n)}
t₈: 1 {O(1)}
t₆, X₀: X₀ {O(n)}
t₆, X₁: X₁ {O(n)}
t₇, X₀: 144⋅X₀⋅X₁+64⋅X₀⋅X₀+80⋅X₁⋅X₁+153⋅X₀+172⋅X₁+90 {O(n^2)}
t₇, X₁: 8⋅X₀+9⋅X₁+9 {O(n)}
t₈, X₀: 144⋅X₀⋅X₁+64⋅X₀⋅X₀+80⋅X₁⋅X₁+154⋅X₀+172⋅X₁+90 {O(n^2)}
t₈, X₁: 10⋅X₁+8⋅X₀+9 {O(n)}