# LTS Termination Proof

by T2Cert

## Input

Integer Transition System
• Initial Location: 2
• Transitions: (pre-variables and post-variables)  0 0 1: 0 ≤ 0 ∧ 0 ≤ 0 ∧ x_promoted_1_post ≤ 0 ∧ − x_promoted_1_post ≤ 0 ∧ x_promoted_1_0 − x_promoted_1_post ≤ 0 ∧ − x_promoted_1_0 + x_promoted_1_post ≤ 0 2 1 0: 0 ≤ 0 ∧ 0 ≤ 0 ∧ − x_promoted_1_post + x_promoted_1_post ≤ 0 ∧ x_promoted_1_post − x_promoted_1_post ≤ 0 ∧ − x_promoted_1_0 + x_promoted_1_0 ≤ 0 ∧ x_promoted_1_0 − x_promoted_1_0 ≤ 0

## Proof

The following invariants are asserted.

 0: TRUE 1: x_promoted_1_0 ≤ 0 ∧ − x_promoted_1_0 ≤ 0 ∧ x_promoted_1_post ≤ 0 ∧ − x_promoted_1_post ≤ 0 2: TRUE

The invariants are proved as follows.

### IMPACT Invariant Proof

• nodes (location) invariant:  0 (0) TRUE 1 (1) x_promoted_1_0 ≤ 0 ∧ − x_promoted_1_0 ≤ 0 ∧ x_promoted_1_post ≤ 0 ∧ − x_promoted_1_post ≤ 0 2 (2) TRUE
• initial node: 2
• cover edges:
• transition edges:  0 0 1 2 1 0

### 2 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
and for every transition t, a duplicate t is considered.

### 3 Transition Removal

We remove transitions 0, 1 using the following ranking functions, which are bounded by −8.

 2: 0 0: 0 1: 0 2: −4 0: −5 1: −6

### 4 SCC Decomposition

There exist no SCC in the program graph.

T2Cert

• version: 1.0