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₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 < X₀
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₁, X₃, X₄, X₅) :|: X₀ ≤ 0
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₃, X₄, X₂, X₃, X₄, X₅)
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀-1, X₁+(X₅)³, X₂, X₃, X₄, X₅)
t₅: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 < X₂
t₆: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l6(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ ≤ 0
t₇: l5(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂-1, X₃, X₄, X₅)
t₈: l6(X₀, X₁, X₂, X₃, X₄, X₅) → l7(X₀, X₁, X₂, X₃, X₄, X₅)
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0 for location l6
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0 for location l7
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 for location l5
Found invariant X₀ ≤ X₃ for location l1
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₀ ≤ 0 for location l4
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location l3
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₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 < X₀ ∧ X₀ ≤ X₃
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₁, X₃, X₄, X₅) :|: X₀ ≤ 0 ∧ X₀ ≤ X₃
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₃, X₄, X₂, X₃, X₄, X₅)
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀-1, X₁+(X₅)³, X₂, X₃, X₄, X₅) :|: 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀
t₅: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅) :|: 0 < X₂ ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₀ ≤ 0
t₆: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l6(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ ≤ 0 ∧ X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₀ ≤ 0
t₇: l5(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂-1, X₃, X₄, X₅) :|: X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0
t₈: l6(X₀, X₁, X₂, X₃, X₄, X₅) → l7(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0 for location l6
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0 for location l7
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 for location l5
Found invariant X₀ ≤ X₃ for location l1
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₀ ≤ 0 for location l4
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location l3
Termination: true
Formula:
relevant size-bounds w.r.t. t₁:
X₀: X₃ {O(n)}
Runtime-bound of t₁: 1 {O(1)}
Results in: 2⋅X₃+4 {O(n)}
relevant size-bounds w.r.t. t₁:
X₀: X₃ {O(n)}
Runtime-bound of t₁: 1 {O(1)}
Results in: 2⋅X₃+4 {O(n)}
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0 for location l6
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0 for location l7
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 for location l5
Found invariant X₀ ≤ X₃ for location l1
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₀ ≤ 0 for location l4
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location l3
Found invariant X₀ ≤ X₃ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 2+X₀ ≤ X₁ ∧ X₀ ≤ 0 for location n_l5___1
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0 for location l6
Found invariant X₀ ≤ X₃ ∧ 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 for location n_l4___2
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0 for location l7
Found invariant X₀ ≤ X₃ for location l1
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₂ ∧ X₀ ≤ 0 for location l4
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location l3
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 for location n_l5___3
Found invariant X₀ ≤ X₃ ∧ 1+X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 3 ≤ X₁+X₂ ∧ 1+X₀ ≤ X₂ ∧ 2 ≤ X₁ ∧ 2+X₀ ≤ X₁ ∧ X₀ ≤ 0 for location n_l5___1
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0 for location l6
Found invariant X₀ ≤ X₃ ∧ 1+X₂ ≤ X₁ ∧ 0 ≤ X₂ ∧ 1 ≤ X₁+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 for location n_l4___2
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ 0 ∧ X₂ ≤ X₁ ∧ X₀+X₂ ≤ 0 ∧ X₀ ≤ 0 for location l7
Found invariant X₀ ≤ X₃ for location l1
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ X₁ ≤ X₂ ∧ X₀ ≤ 0 for location l4
Found invariant 1 ≤ X₃ ∧ 2 ≤ X₀+X₃ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₀ for location l3
Found invariant X₀ ≤ X₃ ∧ X₂ ≤ X₁ ∧ 1 ≤ X₂ ∧ 2 ≤ X₁+X₂ ∧ X₁ ≤ X₂ ∧ 1+X₀ ≤ X₂ ∧ 1 ≤ X₁ ∧ 1+X₀ ≤ X₁ ∧ X₀ ≤ 0 for location n_l5___3
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₂: 2⋅X₃+4 {O(n)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
t₄: 2⋅X₃+4 {O(n)}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₇: inf {Infinity}
t₈: 1 {O(1)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₂: 2⋅X₃+4 {O(n)}
t₃: 1 {O(1)}
t₁: 1 {O(1)}
t₄: 2⋅X₃+4 {O(n)}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₇: inf {Infinity}
t₈: 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₂: 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₄: 2⋅X₄ {O(n)}
t₃, X₅: 2⋅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₀: 2⋅X₃ {O(n)}
t₅, X₃: 2⋅X₃ {O(n)}
t₅, X₄: 2⋅X₄ {O(n)}
t₅, X₅: 2⋅X₅ {O(n)}
t₆, X₀: 4⋅X₃ {O(n)}
t₆, X₃: 4⋅X₃ {O(n)}
t₆, X₄: 4⋅X₄ {O(n)}
t₆, X₅: 4⋅X₅ {O(n)}
t₇, X₀: 2⋅X₃ {O(n)}
t₇, X₃: 2⋅X₃ {O(n)}
t₇, X₄: 2⋅X₄ {O(n)}
t₇, X₅: 2⋅X₅ {O(n)}
t₈, X₀: 4⋅X₃ {O(n)}
t₈, X₃: 4⋅X₃ {O(n)}
t₈, X₄: 4⋅X₄ {O(n)}
t₈, X₅: 4⋅X₅ {O(n)}