Initial Problem

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

Preprocessing

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

Found invariant 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location l6

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

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

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

Problem after Preprocessing

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

MPRF for transition t₂₂: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: 0 < X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ of depth 1:

new bound:

X₂+1 {O(n)}

MPRF for transition t₂₈: l4(X₀, X₁, X₂, X₃) → l1(X₀-1, X₁, X₂, X₃) :|: 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₀ of depth 1:

new bound:

X₂ {O(n)}

MPRF for transition t₃₀: l5(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₁ < X₃ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ of depth 1:

new bound:

X₃+1 {O(n)}

MPRF for transition t₃₁: l6(X₀, X₁, X₂, X₃) → l5(X₀, X₁+1, X₂, X₃) :|: 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 1 ≤ X₁+X₃ ∧ 1+X₁ ≤ X₃ ∧ 1 ≤ X₀+X₃ ∧ 1+X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ 1 ≤ X₀+X₂ ∧ 1+X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ of depth 1:

new bound:

X₃ {O(n)}

All Bounds

Timebounds

Overall timebound:2⋅X₂+2⋅X₃+9 {O(n)}
t₂₁: 1 {O(1)}
t₂₂: X₂+1 {O(n)}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: X₂ {O(n)}
t₂₉: 1 {O(1)}
t₃₀: X₃+1 {O(n)}
t₃₁: X₃ {O(n)}

Costbounds

Overall costbound: 2⋅X₂+2⋅X₃+9 {O(n)}
t₂₁: 1 {O(1)}
t₂₂: X₂+1 {O(n)}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: X₂ {O(n)}
t₂₉: 1 {O(1)}
t₃₀: X₃+1 {O(n)}
t₃₁: X₃ {O(n)}

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₀: 0 {O(1)}
t₂₃, X₁: 0 {O(1)}
t₂₃, X₂: X₂ {O(n)}
t₂₃, X₃: X₃ {O(n)}
t₂₄, X₀: 2⋅X₀ {O(n)}
t₂₄, X₁: 2⋅X₁+X₃ {O(n)}
t₂₄, X₂: 3⋅X₂ {O(n)}
t₂₄, X₃: 3⋅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₀: 0 {O(1)}
t₂₉, X₁: X₃ {O(n)}
t₂₉, X₂: X₂ {O(n)}
t₂₉, X₃: X₃ {O(n)}
t₃₀, X₀: 0 {O(1)}
t₃₀, X₁: X₃ {O(n)}
t₃₀, X₂: X₂ {O(n)}
t₃₀, X₃: X₃ {O(n)}
t₃₁, X₀: 0 {O(1)}
t₃₁, X₁: X₃ {O(n)}
t₃₁, X₂: X₂ {O(n)}
t₃₁, X₃: X₃ {O(n)}