Initial Problem

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

Preprocessing

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l2

Found invariant 1 ≤ X₀ for location l6

Found invariant X₁ ≤ X₀ ∧ 1 ≤ X₀ for location l7

Found invariant 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l5

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l1

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l4

Found invariant X₁ ≤ X₀ ∧ 1 ≤ X₀ for location l9

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l8(X₀, X₁, X₂, X₃)
t₆: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: 0 ≤ X₃ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₅: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₃+1 ≤ 0 ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₇: l2(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₂+1 ≤ E ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₈: l2(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: E ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₉: l3(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃-1) :|: 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₁₀: l4(X₀, X₁, X₂, X₃) → l6(X₀+1, X₁, X₂, X₃) :|: 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₄: l5(X₀, X₁, X₂, X₃) → l1(X₀, X₁, E, X₀-1) :|: 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀
t₂: l6(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₀+1 ≤ X₁ ∧ 1 ≤ X₀
t₃: l6(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀ ∧ 1 ≤ X₀
t₁₁: l7(X₀, X₁, X₂, X₃) → l9(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀ ∧ 1 ≤ X₀
t₁: l8(X₀, X₁, X₂, X₃) → l6(1, X₁, X₂, X₃)

Analysing control-flow refined program

Eliminate variables {NoDet0,X₂} that do not contribute to the problem

Found invariant 3+X₃ ≤ X₁ ∧ 2+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l2___6

Found invariant 3+X₃ ≤ X₁ ∧ 2+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l5___1

Found invariant 3+X₃ ≤ X₁ ∧ 2+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l3___4

Found invariant 2+X₃ ≤ X₁ ∧ 2+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l6___2

Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l6

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___11

Found invariant 3+X₃ ≤ X₁ ∧ 2+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ 3 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l4___3

Found invariant 3+X₃ ≤ X₁ ∧ 2+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l1___7

Found invariant 1+X₃ ≤ 0 ∧ 3+X₃ ≤ X₁ ∧ 2+X₃ ≤ X₀ ∧ 0 ≤ 1+X₃ ∧ 1 ≤ X₁+X₃ ∧ 0 ≤ X₀+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l4___5

Found invariant X₁ ≤ X₀ ∧ 1 ≤ X₀ for location l7

Found invariant 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ for location n_l5___12

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___9

Found invariant X₁ ≤ X₀ ∧ 1 ≤ X₀ for location l9

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l2___10

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 2 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 1+X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l4___8

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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