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₀) :|: X₀+1 ≤ X₁ ∧ 1 ≤ X₀
t₀: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 0
t₁: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ X₀
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₀) :|: X₀+1 ≤ X₁ ∧ 1 ≤ X₀
t₀: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 0
t₁: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ X₀
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: 2⋅X₀+2⋅X₁+5 {O(n)}
Overall timebound:2⋅X₀+2⋅X₁+8 {O(n)}
t₃: 1 {O(1)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 2⋅X₀+2⋅X₁+5 {O(n)}
Overall costbound: 2⋅X₀+2⋅X₁+8 {O(n)}
t₃: 1 {O(1)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 2⋅X₀+2⋅X₁+5 {O(n)}
t₃, X₀: X₀ {O(n)}
t₃, X₁: X₁ {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: 2⋅X₀ {O(n)}
t₁, X₁: 2⋅X₁ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}