Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁) :|: 1 ≤ X₀
t₁: l1(X₀, X₁) → l1(1+X₀, X₁-X₀) :|: 1 ≤ X₁
Found invariant 1 ≤ X₀ for location l1
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁) :|: 1 ≤ X₀
t₁: l1(X₀, X₁) → l1(1+X₀, X₁-X₀) :|: 1 ≤ X₁ ∧ 1 ≤ X₀
Found invariant 1 ≤ X₀ for location l1
Termination: true
Formula:
relevant size-bounds w.r.t. t₀:
X₁: X₁ {O(n)}
Runtime-bound of t₀: 1 {O(1)}
Results in: 4⋅X₁+7 {O(n)}
Overall timebound:4⋅X₁+8 {O(n)}
t₀: 1 {O(1)}
t₁: 4⋅X₁+7 {O(n)}
Overall costbound: 4⋅X₁+8 {O(n)}
t₀: 1 {O(1)}
t₁: 4⋅X₁+7 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: 4⋅X₁+X₀+7 {O(n)}
t₁, X₁: 2⋅X₀+5⋅X₁+7 {O(n)}