Initial Problem
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂+X₃, X₃-1) :|: 0 < X₃
t₂: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₃ ≤ 0
t₃: l2(X₀, X₁, X₂, X₃) → l3(X₂, X₂, X₂, X₃) :|: 0 < X₂
t₅: l3(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂-1, X₃) :|: X₀ ≤ 0
t₄: l3(X₀, X₁, X₂, X₃) → l3(X₀+X₁, X₁-1, X₂, X₃) :|: 0 < X₀
Preprocessing
Found invariant X₃ ≤ 0 for location l2
Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₂ ∧ X₁ ≤ X₀ for location l3
Problem after Preprocessing
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂+X₃, X₃-1) :|: 0 < X₃
t₂: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃) :|: X₃ ≤ 0
t₃: l2(X₀, X₁, X₂, X₃) → l3(X₂, X₂, X₂, X₃) :|: 0 < X₂ ∧ X₃ ≤ 0
t₅: l3(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂-1, X₃) :|: X₀ ≤ 0 ∧ X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₂ ∧ X₁ ≤ X₀
t₄: l3(X₀, X₁, X₂, X₃) → l3(X₀+X₁, X₁-1, X₂, X₃) :|: 0 < X₀ ∧ X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₂ ∧ X₁ ≤ X₀
MPRF for transition t₁: l1(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂+X₃, X₃-1) :|: 0 < X₃ of depth 1:
new bound:
X₃ {O(n)}
MPRF:
l1 [X₃ ]
MPRF for transition t₃: l2(X₀, X₁, X₂, X₃) → l3(X₂, X₂, X₂, X₃) :|: 0 < X₂ ∧ X₃ ≤ 0 of depth 1:
new bound:
2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
MPRF:
l3 [X₂-1 ]
l2 [X₂ ]
MPRF for transition t₅: l3(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂-1, X₃) :|: X₀ ≤ 0 ∧ X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₂ ∧ X₁ ≤ X₂ ∧ X₁ ≤ X₀ of depth 1:
new bound:
2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
MPRF:
l3 [X₂ ]
l2 [X₂ ]
Analysing control-flow refined program
Found invariant X₃ ≤ 0 for location l2
Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ for location n_l3___3
Found invariant X₃ ≤ 0 ∧ X₃ ≤ X₂ ∧ 2+X₁+X₃ ≤ 0 ∧ X₀+X₃ ≤ 0 ∧ 0 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ 2+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 2+X₀+X₁ ≤ 0 ∧ X₀ ≤ 0 for location n_l2___1
Found invariant X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₂ ∧ 1+X₁ ≤ X₂ ∧ 2+X₁ ≤ X₀ for location n_l3___2
MPRF for transition t₅₄: n_l2___1(X₀, X₁, X₂, X₃) → n_l3___3(X₂, X₂, X₂, X₃) :|: X₃ ≤ 0 ∧ X₃ ≤ 0 ∧ 0 ≤ X₂ ∧ X₃ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀ ≤ 0 ∧ 0 < X₂ ∧ X₃ ≤ 0 ∧ X₃ ≤ 0 ∧ X₃ ≤ X₂ ∧ 2+X₁+X₃ ≤ 0 ∧ X₀+X₃ ≤ 0 ∧ 0 ≤ X₂ ∧ 2+X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ 2+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 2+X₀+X₁ ≤ 0 ∧ X₀ ≤ 0 of depth 1:
new bound:
2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
MPRF:
n_l2___1 [X₂+1 ]
n_l3___3 [X₁ ]
n_l3___2 [X₂ ]
MPRF for transition t₅₆: n_l3___2(X₀, X₁, X₂, X₃) → n_l2___1(X₀, X₁, X₂-1, X₃) :|: X₁ ≤ X₀ ∧ X₃ ≤ 0 ∧ 1 ≤ X₂ ∧ X₁ ≤ X₂ ∧ 1 ≤ X₂ ∧ X₃ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀ ≤ 0 ∧ X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1 ≤ X₂ ∧ 1+X₁ ≤ X₂ ∧ 2+X₁ ≤ X₀ of depth 1:
new bound:
2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
MPRF:
n_l2___1 [X₂ ]
n_l3___3 [X₂ ]
n_l3___2 [X₂ ]
MPRF for transition t₅₈: n_l3___3(X₀, X₁, X₂, X₃) → n_l3___2(X₀+X₁, X₁-1, X₂, X₃) :|: X₁ ≤ X₀ ∧ X₃ ≤ 0 ∧ X₁ ≤ X₂ ∧ 0 < X₀ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₂ ∧ 0 < X₀ ∧ X₃ ≤ 0 ∧ X₁ ≤ X₂ ∧ X₃ ≤ 0 ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ X₂ ≤ X₁ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 2 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 1 ≤ X₀ of depth 1:
new bound:
4⋅X₃⋅X₃+4⋅X₂+4⋅X₃+1 {O(n^2)}
MPRF:
n_l2___1 [2⋅X₂-1 ]
n_l3___3 [2⋅X₁-1 ]
n_l3___2 [2⋅X₂-3 ]
CFR did not improve the program. Rolling back
All Bounds
Timebounds
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₁: X₃ {O(n)}
t₂: 1 {O(1)}
t₃: 2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
t₄: inf {Infinity}
t₅: 2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
Costbounds
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₁: X₃ {O(n)}
t₂: 1 {O(1)}
t₃: 2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
t₄: inf {Infinity}
t₅: 2⋅X₃⋅X₃+2⋅X₂+2⋅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₀: X₀ {O(n)}
t₁, X₁: X₁ {O(n)}
t₁, X₂: 2⋅X₃⋅X₃+2⋅X₃+X₂ {O(n^2)}
t₁, X₃: X₃ {O(n)}
t₂, X₀: 2⋅X₀ {O(n)}
t₂, X₁: 2⋅X₁ {O(n)}
t₂, X₂: 2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
t₂, X₃: 2⋅X₃ {O(n)}
t₃, X₀: 4⋅X₃⋅X₃+4⋅X₂+4⋅X₃ {O(n^2)}
t₃, X₁: 4⋅X₃⋅X₃+4⋅X₂+4⋅X₃ {O(n^2)}
t₃, X₂: 2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
t₃, X₃: 2⋅X₃ {O(n)}
t₄, X₂: 2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
t₄, X₃: 2⋅X₃ {O(n)}
t₅, X₂: 2⋅X₃⋅X₃+2⋅X₂+2⋅X₃ {O(n^2)}
t₅, X₃: 2⋅X₃ {O(n)}