Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(2⋅X₀+X₁, X₂, X₂+1, X₃) :|: 0 ≤ X₀+X₁ ∧ X₀ ≤ X₃
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(2⋅X₀+X₁, X₂, X₂+1, X₃) :|: 0 ≤ X₀+X₁ ∧ X₀ ≤ X₃
Found invariant X₂ ≤ 1+X₁ ∧ 1+X₁ ≤ X₂ for location n_l1___2
Found invariant 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₂ ≤ 1+X₁ ∧ 1+X₁ ≤ X₂ for location n_l1___1
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: inf {Infinity}
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)}