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
Found invariant X₀ ≤ 0 for location l2
Termination: true
Formula:
relevant size-bounds w.r.t. t₇:
X₀: X₀ {O(n)}
X₂: X₂ {O(n)}
Runtime-bound of t₇: 1 {O(1)}
Results in: 4⋅X₀+4⋅X₂+7 {O(n)}
Overall timebound:4⋅X₀+4⋅X₂+9 {O(n)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₉: 4⋅X₀+4⋅X₂+7 {O(n)}
Overall costbound: 4⋅X₀+4⋅X₂+9 {O(n)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₉: 4⋅X₀+4⋅X₂+7 {O(n)}
t₇, X₀: X₀ {O(n)}
t₇, X₂: X₂ {O(n)}
t₈, X₀: 16⋅X₀⋅X₀+24⋅X₂⋅X₂+40⋅X₀⋅X₂+62⋅X₀+76⋅X₂+56 {O(n^2)}
t₈, X₂: 4⋅X₀+6⋅X₂+7 {O(n)}
t₉, X₀: 16⋅X₀⋅X₀+24⋅X₂⋅X₂+40⋅X₀⋅X₂+61⋅X₀+76⋅X₂+56 {O(n^2)}
t₉, X₂: 4⋅X₀+5⋅X₂+7 {O(n)}