Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₂: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₀: l1(X₀, X₁, X₂) → l1(X₀-1, X₁, X₂-1) :|: 0 ≤ X₀ ∧ X₂ ≤ (X₁)³
t₁: l1(X₀, X₁, X₂) → l1(X₀, X₁+X₂, X₂-1) :|: 0 ≤ X₀ ∧ X₂ ≤ (X₁)³
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₂: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₀: l1(X₀, X₁, X₂) → l1(X₀-1, X₁, X₂-1) :|: 0 ≤ X₀ ∧ X₂ ≤ (X₁)³
t₁: l1(X₀, X₁, X₂) → l1(X₀, X₁+X₂, X₂-1) :|: 0 ≤ X₀ ∧ X₂ ≤ (X₁)³
Eliminate variables {X₁,X₂} that do not contribute to the problem
Found invariant 0 ≤ 1+X₀ for location n_l1___2
Found invariant 0 ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₂: 1 {O(1)}
t₀: inf {Infinity}
t₁: inf {Infinity}
Overall costbound: inf {Infinity}
t₂: 1 {O(1)}
t₀: inf {Infinity}
t₁: inf {Infinity}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}
t₂, X₂: X₂ {O(n)}
t₀, X₀: 2⋅X₀+1 {O(n)}
t₁, X₀: 2⋅X₀+1 {O(n)}