Start: eval_t47_start
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: eval_t47_bb0_in, eval_t47_bb1_in, eval_t47_bb2_in, eval_t47_bb3_in, eval_t47_start, eval_t47_stop
Transitions:
t₁: eval_t47_bb0_in(X₀, X₁, X₂) → eval_t47_bb1_in(X₂, 1, X₂)
t₂: eval_t47_bb1_in(X₀, X₁, X₂) → eval_t47_bb2_in(X₀, X₁, X₂) :|: 1 ≤ X₁
t₃: eval_t47_bb1_in(X₀, X₁, X₂) → eval_t47_bb3_in(X₀, X₁, X₂) :|: X₁ ≤ 0
t₄: eval_t47_bb2_in(X₀, X₁, X₂) → eval_t47_bb1_in(X₀-1, 1, X₂) :|: 1 ≤ X₀
t₅: eval_t47_bb2_in(X₀, X₁, X₂) → eval_t47_bb1_in(X₀, 1, X₂) :|: 1 ≤ X₀ ∧ X₀ ≤ 0
t₆: eval_t47_bb2_in(X₀, X₁, X₂) → eval_t47_bb1_in(X₀-1, 0, X₂) :|: 1 ≤ X₀ ∧ X₀ ≤ 0
t₇: eval_t47_bb2_in(X₀, X₁, X₂) → eval_t47_bb1_in(X₀, 0, X₂) :|: X₀ ≤ 0
t₈: eval_t47_bb3_in(X₀, X₁, X₂) → eval_t47_stop(X₀, X₁, X₂)
t₀: eval_t47_start(X₀, X₁, X₂) → eval_t47_bb0_in(X₀, X₁, X₂)
Cut unsatisfiable transition [t₅: eval_t47_bb2_in→eval_t47_bb1_in; t₆: eval_t47_bb2_in→eval_t47_bb1_in]
Found invariant X₀ ≤ X₂ ∧ X₁ ≤ 0 ∧ 0 ≤ X₁ for location eval_t47_stop
Found invariant X₀ ≤ X₂ ∧ X₁ ≤ 0 ∧ 0 ≤ X₁ for location eval_t47_bb3_in
Found invariant X₀ ≤ X₂ ∧ X₁ ≤ 1 ∧ 0 ≤ X₁ for location eval_t47_bb1_in
Found invariant X₀ ≤ X₂ ∧ X₁ ≤ 1 ∧ 1 ≤ X₁ for location eval_t47_bb2_in
Start: eval_t47_start
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: eval_t47_bb0_in, eval_t47_bb1_in, eval_t47_bb2_in, eval_t47_bb3_in, eval_t47_start, eval_t47_stop
Transitions:
t₁: eval_t47_bb0_in(X₀, X₁, X₂) → eval_t47_bb1_in(X₂, 1, X₂)
t₂: eval_t47_bb1_in(X₀, X₁, X₂) → eval_t47_bb2_in(X₀, X₁, X₂) :|: 1 ≤ X₁ ∧ X₁ ≤ 1 ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁
t₃: eval_t47_bb1_in(X₀, X₁, X₂) → eval_t47_bb3_in(X₀, X₁, X₂) :|: X₁ ≤ 0 ∧ X₁ ≤ 1 ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁
t₄: eval_t47_bb2_in(X₀, X₁, X₂) → eval_t47_bb1_in(X₀-1, 1, X₂) :|: 1 ≤ X₀ ∧ X₁ ≤ 1 ∧ 1 ≤ X₁ ∧ X₀ ≤ X₂
t₇: eval_t47_bb2_in(X₀, X₁, X₂) → eval_t47_bb1_in(X₀, 0, X₂) :|: X₀ ≤ 0 ∧ X₁ ≤ 1 ∧ 1 ≤ X₁ ∧ X₀ ≤ X₂
t₈: eval_t47_bb3_in(X₀, X₁, X₂) → eval_t47_stop(X₀, X₁, X₂) :|: X₀ ≤ X₂ ∧ 0 ≤ X₁ ∧ X₁ ≤ 0
t₀: eval_t47_start(X₀, X₁, X₂) → eval_t47_bb0_in(X₀, X₁, X₂)
new bound:
X₂ {O(n)}
MPRF:
• eval_t47_bb1_in: [X₀]
• eval_t47_bb2_in: [X₀]
new bound:
1 {O(1)}
MPRF:
• eval_t47_bb1_in: [X₁]
• eval_t47_bb2_in: [1]
knowledge_propagation leads to new time bound X₂+1 {O(n)} for transition t₂: eval_t47_bb1_in(X₀, X₁, X₂) → eval_t47_bb2_in(X₀, X₁, X₂) :|: 1 ≤ X₁ ∧ X₁ ≤ 1 ∧ X₀ ≤ X₂ ∧ 0 ≤ X₁
Overall timebound:2⋅X₂+6 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₂+1 {O(n)}
t₃: 1 {O(1)}
t₄: X₂ {O(n)}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
Overall costbound: 2⋅X₂+6 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₂+1 {O(n)}
t₃: 1 {O(1)}
t₄: X₂ {O(n)}
t₇: 1 {O(1)}
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₁: 1 {O(1)}
t₁, X₂: 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₁: 0 {O(1)}
t₃, X₂: 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₁: 0 {O(1)}
t₇, X₂: X₂ {O(n)}
t₈, X₀: X₂ {O(n)}
t₈, X₁: 0 {O(1)}
t₈, X₂: X₂ {O(n)}