Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁) :|: 0 < X₀
t₁: l1(X₀, X₁) → l1(3⋅X₀, 2⋅X₁) :|: X₀ < 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₁) :|: 0 < X₀
t₁: l1(X₀, X₁) → l1(3⋅X₀, 2⋅X₁) :|: X₀ < X₁ ∧ 1 ≤ X₀
cycle: [t₁: l1→l1]
Termination: true
Formula:
Overall timebound:2⋅X₁+5 {O(n)}
t₀: 1 {O(1)}
t₁: 2⋅X₁+4 {O(n)}
Overall costbound: 2⋅X₁+5 {O(n)}
t₀: 1 {O(1)}
t₁: 2⋅X₁+4 {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: 3^(2⋅X₁+4)⋅X₀ {O(EXP)}
t₁, X₁: 2^(2⋅X₁+4)⋅X₁ {O(EXP)}