Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: H, I
Locations: l0, l1, l2
Transitions:
t₂: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, X₂, X₃, X₄, H, H)
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l1(X₀, X₁, H, I, X₄, X₅, X₆) :|: 1+X₁ ≤ X₀
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → l2(X₀, X₁, H, X₃, I, X₅, X₆) :|: X₀ ≤ X₁
Eliminate variables {H,I,X₂,X₃,X₄,X₅,X₆} that do not contribute to the problem
Found invariant X₀ ≤ X₁ 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₁) :|: 1+X₁ ≤ X₀
t₁₀: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ X₁
Found invariant X₀ ≤ X₁ for location l2
Found invariant X₀ ≤ X₁ for location l2
Found invariant 1+X₁ ≤ X₀ for location n_l1___1
Found invariant X₀ ≤ X₁ for location l2
Found invariant 1+X₁ ≤ X₀ for location n_l1___1
Overall timebound:inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}
Overall costbound: inf {Infinity}
t₈: 1 {O(1)}
t₉: inf {Infinity}
t₁₀: 1 {O(1)}
t₈, X₀: X₀ {O(n)}
t₈, X₁: X₁ {O(n)}
t₉, X₀: X₀ {O(n)}
t₉, X₁: X₁ {O(n)}
t₁₀, X₀: X₀ {O(n)}
t₁₀, X₁: X₁ {O(n)}