Initial Problem

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₃) → l2(X₀, X₁, X₂, X₃)
t₂: l1(X₀, X₁, X₂, X₃) → l3(1, X₁, X₂, X₃) :|: X₁ ≤ X₃
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₃ < X₁
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₀, 1, X₂, X₃)
t₅: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₂ < X₀
t₄: l3(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₀ ≤ X₂
t₈: l4(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃)
t₇: l5(X₀, X₁, X₂, X₃) → l1(X₀, X₁+1, X₂, X₃)
t₆: l6(X₀, X₁, X₂, X₃) → l3(X₀+1, X₁, X₂, X₃)

Preprocessing

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

Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₁ for location l7

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

Found invariant 1 ≤ X₁ for location l1

Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₁ for location l4

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

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₃) → l2(X₀, X₁, X₂, X₃)
t₂: l1(X₀, X₁, X₂, X₃) → l3(1, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1 ≤ X₁
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₃ < X₁ ∧ 1 ≤ X₁
t₁: l2(X₀, X₁, X₂, X₃) → l1(X₀, 1, X₂, X₃)
t₅: l3(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₂ < X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₄: l3(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂, X₃) :|: X₀ ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₈: l4(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃) :|: 1+X₃ ≤ X₁ ∧ 1 ≤ X₁
t₇: l5(X₀, X₁, X₂, X₃) → l1(X₀, X₁+1, X₂, X₃) :|: 1 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀
t₆: l6(X₀, X₁, X₂, X₃) → l3(X₀+1, X₁, X₂, X₃) :|: 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀

MPRF for transition t₂: l1(X₀, X₁, X₂, X₃) → l3(1, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1 ≤ X₁ of depth 1:

new bound:

X₃+2 {O(n)}

MPRF:

l5 [X₃-X₁ ]
l1 [X₃+1-X₁ ]
l6 [X₃-X₁ ]
l3 [X₃-X₁ ]

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

new bound:

X₃+2 {O(n)}

MPRF:

l5 [X₃-X₁ ]
l1 [X₃+1-X₁ ]
l6 [X₃+1-X₁ ]
l3 [X₃+1-X₁ ]

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

new bound:

X₃+2 {O(n)}

MPRF:

l5 [X₃+1-X₁ ]
l1 [X₃+1-X₁ ]
l6 [X₃+1-X₁ ]
l3 [X₃+1-X₁ ]

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

new bound:

X₂⋅X₃+3⋅X₂ {O(n^2)}

MPRF:

l1 [X₂ ]
l5 [X₂-X₀ ]
l6 [X₂-X₀ ]
l3 [X₂+1-X₀ ]

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

new bound:

X₂⋅X₃+3⋅X₂ {O(n^2)}

MPRF:

l1 [X₂ ]
l5 [X₂-X₀ ]
l6 [X₂+1-X₀ ]
l3 [X₂+1-X₀ ]

Analysing control-flow refined program

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

Found invariant 1 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 3 ≤ X₀+X₃ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l6___1

Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₁ for location l7

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

Found invariant 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 3 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l3___2

Found invariant 1 ≤ X₁ for location l1

Found invariant 1+X₃ ≤ X₁ ∧ 1 ≤ X₁ for location l4

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

knowledge_propagation leads to new time bound X₃+2 {O(n)} for transition t₆₁: l3(X₀, X₁, X₂, X₃) → n_l6___3(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₁ ≤ X₃ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀

knowledge_propagation leads to new time bound X₃+2 {O(n)} for transition t₆₃: n_l6___3(X₀, X₁, X₂, X₃) → n_l3___2(X₀+1, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1 ≤ X₂ ∧ 1 ≤ X₁ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀

MPRF for transition t₆₀: n_l3___2(X₀, X₁, X₂, X₃) → n_l6___1(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ 2 ≤ X₀ ∧ 1 ≤ X₁ ∧ X₀ ≤ 1+X₂ ∧ X₁ ≤ X₃ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 3 ≤ X₀+X₃ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₀ ≤ 1+X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ of depth 1:

new bound:

X₂⋅X₃+2⋅X₂+3⋅X₃+6 {O(n^2)}

MPRF:

l3 [0 ]
n_l6___3 [0 ]
l1 [0 ]
l5 [0 ]
n_l6___1 [X₂-X₀ ]
n_l3___2 [X₂+1-X₀ ]

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

new bound:

X₃+2 {O(n)}

MPRF:

l3 [X₃+1-X₁ ]
l1 [X₃+1-X₁ ]
l5 [X₃-X₁ ]
n_l6___1 [X₃+1-X₁ ]
n_l6___3 [X₀+X₃-X₁ ]
n_l3___2 [X₃+1-X₁ ]

MPRF for transition t₆₂: n_l6___1(X₀, X₁, X₂, X₃) → n_l3___2(X₀+1, X₁, X₂, X₃) :|: X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀ ∧ 1 ≤ X₁ ∧ 1 ≤ X₀ ∧ X₁ ≤ X₃ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₃ ∧ 3 ≤ X₂+X₃ ∧ 2 ≤ X₁+X₃ ∧ X₁ ≤ X₃ ∧ 3 ≤ X₀+X₃ ∧ 2 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 4 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ of depth 1:

new bound:

X₂⋅X₃+2⋅X₂+3⋅X₃+6 {O(n^2)}

MPRF:

l3 [0 ]
n_l6___3 [0 ]
l1 [0 ]
l5 [0 ]
n_l6___1 [X₂+1-X₀ ]
n_l3___2 [X₂+1-X₀ ]

CFR did not improve the program. Rolling back

All Bounds

Timebounds

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

Costbounds

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

Sizebounds

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