Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₂: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: 0 ≤ X₀
t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ < 0
t₁: l2(X₀, X₁, X₂) → l1(X₂, X₁, X₂)
t₄: l3(X₀, X₁, X₂) → l1(X₀+X₁, X₁, X₂)
t₅: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₂)

Preprocessing

Found invariant 1+X₀ ≤ 0 for location l5

Found invariant 1+X₀ ≤ 0 for location l4

Found invariant 0 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₂: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: 0 ≤ X₀
t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ < 0
t₁: l2(X₀, X₁, X₂) → l1(X₂, X₁, X₂)
t₄: l3(X₀, X₁, X₂) → l1(X₀+X₁, X₁, X₂) :|: 0 ≤ X₀
t₅: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₂) :|: 1+X₀ ≤ 0

Chain transitions t₄: l3→l1 and t₃: l1→l4 to t₃₆: l3→l4

Chain transitions t₁: l2→l1 and t₃: l1→l4 to t₃₇: l2→l4

Chain transitions t₁: l2→l1 and t₂: l1→l3 to t₃₈: l2→l3

Chain transitions t₄: l3→l1 and t₂: l1→l3 to t₃₉: l3→l3

Analysing control-flow refined program

Found invariant 1+X₀ ≤ 0 for location l5

Found invariant 0 ≤ X₂ for location l3

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

Analysing control-flow refined program

Found invariant X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l3___3

Found invariant 0 ≤ X₂ ∧ X₁ ≤ X₀ for location n_l1___2

Found invariant X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 for location l5

Found invariant X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l1

Found invariant X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 for location l4

Found invariant 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₀ for location n_l3___1

CFR did not improve the program. Rolling back

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: inf {Infinity}
t₅: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: inf {Infinity}
t₃: 1 {O(1)}
t₄: inf {Infinity}
t₅: 1 {O(1)}

Sizebounds

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)}
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)}
t₅, X₁: 2⋅X₁ {O(n)}
t₅, X₂: 2⋅X₂ {O(n)}