Initial Problem

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l10, l11, l12, l13, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅)
t₁₀: l10(X₀, X₁, X₂, X₃, X₄, X₅) → l11(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ 100 ∧ X₁ ≤ X₂
t₁₁: l10(X₀, X₁, X₂, X₃, X₄, X₅) → l12(X₀, X₁, X₂, X₃, X₄, X₅) :|: 100 < X₀
t₁₂: l10(X₀, X₁, X₂, X₃, X₄, X₅) → l12(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ < X₁
t₁₃: l11(X₀, X₁, X₂, X₃, X₄, X₅) → l10(X₁, X₀+1, X₂-1, X₃, X₄, X₅)
t₁₄: l12(X₀, X₁, X₂, X₃, X₄, X₅) → l13(X₀, X₁, X₂, X₃, X₄, X₅)
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅)
t₂: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁, X₂, X₃, X₄, X₅)
t₄: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
t₅: l5(X₀, X₁, X₂, X₃, X₄, X₅) → l6(X₀, X₁, X₂, X₃, X₄, X₅)
t₆: l6(X₀, X₁, X₂, X₃, X₄, X₅) → l7(X₀, X₁, X₂, X₃, X₄, X₅)
t₇: l7(X₀, X₁, X₂, X₃, X₄, X₅) → l8(X₀, X₁, X₂, X₃, X₄, X₅)
t₈: l8(X₀, X₁, X₂, X₃, X₄, X₅) → l9(X₀, X₁, X₂, X₃, X₄, X₅)
t₉: l9(X₀, X₁, X₂, X₃, X₄, X₅) → l10(X₃, X₄, X₅, X₃, X₄, X₅)

Preprocessing

Found invariant X₂ ≤ X₅ ∧ X₁ ≤ X₅ ∧ X₁ ≤ X₂ ∧ X₀ ≤ 100 for location l11

Found invariant X₂ ≤ X₅ for location l12

Found invariant X₂ ≤ X₅ for location l13

Found invariant X₂ ≤ X₅ for location l10

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l10, l11, l12, l13, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅)
t₁₀: l10(X₀, X₁, X₂, X₃, X₄, X₅) → l11(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ 100 ∧ X₁ ≤ X₂ ∧ X₂ ≤ X₅
t₁₁: l10(X₀, X₁, X₂, X₃, X₄, X₅) → l12(X₀, X₁, X₂, X₃, X₄, X₅) :|: 100 < X₀ ∧ X₂ ≤ X₅
t₁₂: l10(X₀, X₁, X₂, X₃, X₄, X₅) → l12(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ < X₁ ∧ X₂ ≤ X₅
t₁₃: l11(X₀, X₁, X₂, X₃, X₄, X₅) → l10(X₁, X₀+1, X₂-1, X₃, X₄, X₅) :|: X₂ ≤ X₅ ∧ X₁ ≤ X₅ ∧ X₁ ≤ X₂ ∧ X₀ ≤ 100
t₁₄: l12(X₀, X₁, X₂, X₃, X₄, X₅) → l13(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ ≤ X₅
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅)
t₂: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁, X₂, X₃, X₄, X₅)
t₄: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
t₅: l5(X₀, X₁, X₂, X₃, X₄, X₅) → l6(X₀, X₁, X₂, X₃, X₄, X₅)
t₆: l6(X₀, X₁, X₂, X₃, X₄, X₅) → l7(X₀, X₁, X₂, X₃, X₄, X₅)
t₇: l7(X₀, X₁, X₂, X₃, X₄, X₅) → l8(X₀, X₁, X₂, X₃, X₄, X₅)
t₈: l8(X₀, X₁, X₂, X₃, X₄, X₅) → l9(X₀, X₁, X₂, X₃, X₄, X₅)
t₉: l9(X₀, X₁, X₂, X₃, X₄, X₅) → l10(X₃, X₄, X₅, X₃, X₄, X₅)

Analysing control-flow refined program

Found invariant X₄ ≤ X₅ ∧ 1+X₂ ≤ X₅ ∧ X₀ ≤ X₅ ∧ X₃ ≤ 100 ∧ X₁+X₃ ≤ 201 ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 101 for location n_l10___2

Found invariant X₂ ≤ X₅ for location l12

Found invariant X₂ ≤ X₅ for location l13

Found invariant X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃ for location l10

Found invariant X₅ ≤ X₂ ∧ X₄ ≤ X₅ ∧ X₂ ≤ X₅ ∧ X₁ ≤ X₅ ∧ X₄ ≤ X₂ ∧ X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₃ ≤ 100 ∧ X₃ ≤ X₀ ∧ X₀+X₃ ≤ 200 ∧ X₀ ≤ X₃ ∧ X₁ ≤ X₂ ∧ X₀ ≤ 100 for location n_l11___3

Found invariant X₄ ≤ X₅ ∧ 1+X₂ ≤ X₅ ∧ 1+X₁ ≤ X₅ ∧ X₀ ≤ X₅ ∧ X₃ ≤ 100 ∧ X₁+X₃ ≤ 201 ∧ X₀+X₃ ≤ 200 ∧ X₁ ≤ X₂ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ 101 ∧ X₀+X₁ ≤ 201 ∧ X₀ ≤ 100 for location n_l11___1

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₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₄: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
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₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₄: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 1 {O(1)}
t₆: 1 {O(1)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
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₂: 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₅: 2⋅X₅ {O(n)}
t₁₂, X₃: 2⋅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₅: X₅ {O(n)}
t₁₄, X₃: 4⋅X₃ {O(n)}
t₁₄, X₄: 4⋅X₄ {O(n)}
t₁₄, X₅: 4⋅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₁: 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₃: 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₅: 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₁: 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₃: 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₅: X₅ {O(n)}