Initial Problem

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

Preprocessing

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+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₀ for location l2

Found invariant 0 ≤ X₂ for location l6

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

Found invariant 0 ≤ X₂ ∧ X₁ ≤ 1+X₂ for location l8

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+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₀ for location l1

Found invariant 0 ≤ X₂ ∧ X₁ ≤ 1+X₂ for location l10

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+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₀ for location l4

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

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+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₀ for location l3

Problem after Preprocessing

Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l10, l2, l3, l4, l5, l6, l7, l8, l9
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l7(X₀, X₁, X₂, X₃)
t₁₀: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+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₆: l2(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+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₃) :|: 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+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₁₁: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₀) :|: 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+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₄: l5(X₀, X₁, X₂, X₃) → l2(X₃+1, X₁, X₂, X₃) :|: X₃+1 < X₁ ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 2+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁
t₅: l5(X₀, X₁, X₂, X₃) → l9(X₃+1, X₁, X₂, X₃) :|: X₁ ≤ X₃+1 ∧ 1+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 2+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁
t₂: l6(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₂) :|: X₂+1 < X₁ ∧ 0 ≤ X₂
t₃: l6(X₀, X₁, X₂, X₃) → l8(X₀, X₁, X₂, X₃) :|: X₁ ≤ 1+X₂ ∧ 0 ≤ X₂
t₁: l7(X₀, X₁, X₂, X₃) → l6(X₀, X₁, 0, X₃)
t₁₃: l8(X₀, X₁, X₂, X₃) → l10(X₀, X₁, X₂, X₃) :|: 0 ≤ X₂ ∧ X₁ ≤ 1+X₂
t₁₂: l9(X₀, X₁, X₂, X₃) → l6(X₀, X₁, X₂+1, X₃) :|: 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 2+X₂ ≤ X₁ ∧ 2+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀

Analysing control-flow refined program

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 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 1+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 2 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ X₁ ≤ 1+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 1+X₂ ≤ X₁ ∧ 1+X₂ ≤ X₀ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 3 ≤ X₀+X₂ ∧ X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l6___1

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 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 X₂ ≤ 0 ∧ 0 ≤ X₂ for location l6

Found invariant X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 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___9

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 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___2

Found invariant 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 4 ≤ X₁+X₃ ∧ 3 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 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_l1___3

Found invariant X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 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___11

Found invariant X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 2+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 2 ≤ X₁ for location n_l5___12

Found invariant 0 ≤ X₂ ∧ X₁ ≤ 1+X₂ for location l8

Found invariant 1+X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ 1 ≤ X₃ ∧ 1 ≤ X₂+X₃ ∧ 1+X₂ ≤ X₃ ∧ 3 ≤ X₁+X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ 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₀ for location n_l5___7

Found invariant 0 ≤ X₂ ∧ X₁ ≤ 1+X₂ for location l10

Found invariant X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 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

Found invariant X₃ ≤ X₂ ∧ 2+X₃ ≤ X₁ ∧ 1+X₃ ≤ X₀ ∧ 0 ≤ X₃ ∧ 0 ≤ X₂+X₃ ∧ X₂ ≤ X₃ ∧ 2 ≤ X₁+X₃ ∧ 1 ≤ X₀+X₃ ∧ X₀ ≤ 1+X₃ ∧ 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___10

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

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₃: 1 {O(1)}
t₁: 1 {O(1)}
t₁₃: 1 {O(1)}
t₁₂: inf {Infinity}

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₃: 1 {O(1)}
t₁: 1 {O(1)}
t₁₃: 1 {O(1)}
t₁₂: inf {Infinity}

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₁: 2⋅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₁: 2⋅X₁ {O(n)}
t₁₂, X₁: X₁ {O(n)}