Termination proof of /tmp/tmpI

Termination of the given JBC could be proven:

0 JBC

↳1 JBCToGraph (⇒, 60 ms)

↳2 JBCTerminationGraph

↳3 TerminationGraphToSCCProof (⇒, 0 ms)

↳4 JBCTerminationSCC

↳5 SCCToIDPv1Proof (⇒, 140 ms)

↳6 IDP

↳7 IDPNonInfProof (⇒, 3530 ms)

↳8 IDP

↳9 IDependencyGraphProof (⇔, 0 ms)

↳10 TRUE

(0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_16 (Sun Microsystems Inc.) Main-Class: PastaA10

/**
 * Example taken from "A Term Rewriting Approach to the Automated Termination
 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
 * and converted to Java.
 */

public class PastaA10 {
    public static void main(String[] args) {
        Random.args = args;
        int x = Random.random();
        int y = Random.random();

        while (x != y) {
            if (x > y) {
                y++;
            } else {
                x++;
            }
        }
    }
}


public class Random {
  static String[] args;
  static int index = 0;

  public static int random() {
    String string = args[index];
    index++;
    return string.length();
  }
}

(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

Termination Graph based on JBC Program:
PastaA10.main([Ljava/lang/String;)V: Graph of 182 nodes with 1 SCC.

(3) TerminationGraphToSCCProof (SOUND transformation)

Splitted TerminationGraph to 1 SCCs.

(4) Obligation:

SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: PastaA10.main([Ljava/lang/String;)V
SCC calls the following helper methods:
Performed SCC analyses: UsedFieldsAnalysis

(5) SCCToIDPv1Proof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Log:

Generated 16 rules for P and 0 rules for R.

P rules:
303_0_main_Load(EOS(STATIC_303), i18, i46, i18) → 306_0_main_EQ(EOS(STATIC_306), i18, i46, i18, i46)
306_0_main_EQ(EOS(STATIC_306), i18, i46, i18, i46) → 319_0_main_EQ(EOS(STATIC_319), i18, i46, i18, i46)
319_0_main_EQ(EOS(STATIC_319), i18, i46, i18, i46) → 328_0_main_Load(EOS(STATIC_328), i18, i46) | !(=(i18, i46))
328_0_main_Load(EOS(STATIC_328), i18, i46) → 338_0_main_Load(EOS(STATIC_338), i18, i46, i18)
338_0_main_Load(EOS(STATIC_338), i18, i46, i18) → 347_0_main_LE(EOS(STATIC_347), i18, i46, i18, i46)
347_0_main_LE(EOS(STATIC_347), i18, i46, i18, i46) → 356_0_main_LE(EOS(STATIC_356), i18, i46, i18, i46)
347_0_main_LE(EOS(STATIC_347), i18, i46, i18, i46) → 358_0_main_LE(EOS(STATIC_358), i18, i46, i18, i46)
356_0_main_LE(EOS(STATIC_356), i18, i46, i18, i46) → 367_0_main_Inc(EOS(STATIC_367), i18, i46) | <=(i18, i46)
367_0_main_Inc(EOS(STATIC_367), i18, i46) → 377_0_main_JMP(EOS(STATIC_377), +(i18, 1), i46) | >=(i18, 0)
377_0_main_JMP(EOS(STATIC_377), i54, i46) → 399_0_main_Load(EOS(STATIC_399), i54, i46)
399_0_main_Load(EOS(STATIC_399), i54, i46) → 299_0_main_Load(EOS(STATIC_299), i54, i46)
299_0_main_Load(EOS(STATIC_299), i18, i46) → 303_0_main_Load(EOS(STATIC_303), i18, i46, i18)
358_0_main_LE(EOS(STATIC_358), i18, i46, i18, i46) → 369_0_main_Inc(EOS(STATIC_369), i18, i46) | >(i18, i46)
369_0_main_Inc(EOS(STATIC_369), i18, i46) → 379_0_main_JMP(EOS(STATIC_379), i18, +(i46, 1)) | >=(i46, 0)
379_0_main_JMP(EOS(STATIC_379), i18, i55) → 403_0_main_Load(EOS(STATIC_403), i18, i55)
403_0_main_Load(EOS(STATIC_403), i18, i55) → 299_0_main_Load(EOS(STATIC_299), i18, i55)
R rules:

Combined rules. Obtained 2 conditional rules for P and 0 conditional rules for R.

P rules:
303_0_main_Load(EOS(STATIC_303), x0, x1, x0) → 303_0_main_Load(EOS(STATIC_303), +(x0, 1), x1, +(x0, 1)) | &&(>(x1, x0), >(+(x0, 1), 0))
303_0_main_Load(EOS(STATIC_303), x0, x1, x0) → 303_0_main_Load(EOS(STATIC_303), x0, +(x1, 1), x0) | &&(>(+(x1, 1), 0), <(x1, x0))
R rules:

Filtered ground terms:

303_0_main_Load(x1, x2, x3, x4) → 303_0_main_Load(x2, x3, x4)
EOS(x1) → EOS
Cond_303_0_main_Load1(x1, x2, x3, x4, x5) → Cond_303_0_main_Load1(x1, x3, x4, x5)
Cond_303_0_main_Load(x1, x2, x3, x4, x5) → Cond_303_0_main_Load(x1, x3, x4, x5)

Filtered duplicate args:

303_0_main_Load(x1, x2, x3) → 303_0_main_Load(x2, x3)
Cond_303_0_main_Load(x1, x2, x3, x4) → Cond_303_0_main_Load(x1, x3, x4)
Cond_303_0_main_Load1(x1, x2, x3, x4) → Cond_303_0_main_Load1(x1, x3, x4)

Combined rules. Obtained 2 conditional rules for P and 0 conditional rules for R.

P rules:
303_0_main_Load(x1, x0) → 303_0_main_Load(x1, +(x0, 1)) | &&(>(x1, x0), >(x0, -1))
303_0_main_Load(x1, x0) → 303_0_main_Load(+(x1, 1), x0) | &&(>(x1, -1), <(x1, x0))
R rules:

Finished conversion. Obtained 4 rules for P and 0 rules for R. System has predefined symbols.

P rules:
303_0_MAIN_LOAD(x1, x0) → COND_303_0_MAIN_LOAD(&&(>(x1, x0), >(x0, -1)), x1, x0)
COND_303_0_MAIN_LOAD(TRUE, x1, x0) → 303_0_MAIN_LOAD(x1, +(x0, 1))
303_0_MAIN_LOAD(x1, x0) → COND_303_0_MAIN_LOAD1(&&(>(x1, -1), <(x1, x0)), x1, x0)
COND_303_0_MAIN_LOAD1(TRUE, x1, x0) → 303_0_MAIN_LOAD(+(x1, 1), x0)
R rules:

(6) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 303_0_MAIN_LOAD(x1[0], x0[0]) → COND_303_0_MAIN_LOAD(x1[0] > x0[0] && x0[0] > -1, x1[0], x0[0])
(1): COND_303_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 303_0_MAIN_LOAD(x1[1], x0[1] + 1)
(2): 303_0_MAIN_LOAD(x1[2], x0[2]) → COND_303_0_MAIN_LOAD1(x1[2] > -1 && x1[2] < x0[2], x1[2], x0[2])
(3): COND_303_0_MAIN_LOAD1(TRUE, x1[3], x0[3]) → 303_0_MAIN_LOAD(x1[3] + 1, x0[3])

(0) -> (1), if (x1[0] > x0[0] && x0[0] > -1 ∧x1[0] →^* x1[1]∧x0[0] →^* x0[1])

(1) -> (0), if (x1[1] →^* x1[0]∧x0[1] + 1 →^* x0[0])

(1) -> (2), if (x1[1] →^* x1[2]∧x0[1] + 1 →^* x0[2])

(2) -> (3), if (x1[2] > -1 && x1[2] < x0[2] ∧x1[2] →^* x1[3]∧x0[2] →^* x0[3])

(3) -> (0), if (x1[3] + 1 →^* x1[0]∧x0[3] →^* x0[0])

(3) -> (2), if (x1[3] + 1 →^* x1[2]∧x0[3] →^* x0[2])

The set Q is empty.

(7) IDPNonInfProof (SOUND transformation)

Used the following options for this NonInfProof:
IDPGPoloSolver: Range: [(-1,2)] IsNat: false Interpretation Shape Heuristic: aprove.DPFramework.IDPProblem.Processors.nonInf.poly.IdpCand1ShapeHeuristic@56468968 Constraint Generator: NonInfConstraintGenerator: PathGenerator: MetricPathGenerator: Max Left Steps: 2 Max Right Steps: 0

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair 303_0_MAIN_LOAD(x1, x0) → COND_303_0_MAIN_LOAD(&&(>(x1, x0), >(x0, -1)), x1, x0) the following chains were created:

We consider the chain 303_0_MAIN_LOAD(x1[0], x0[0]) → COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0]), COND_303_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 303_0_MAIN_LOAD(x1[1], +(x0[1], 1)) which results in the following constraint:
(1)    (&&(>(x1[0], x0[0]), >(x0[0], -1))=TRUE∧x1[0]=x1[1]∧x0[0]=x0[1] ⇒ 303_0_MAIN_LOAD(x1[0], x0[0])≥NonInfC∧303_0_MAIN_LOAD(x1[0], x0[0])≥COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])∧(U^Increasing(COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])), ≥))

We simplified constraint (1) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (>(x1[0], x0[0])=TRUE∧>(x0[0], -1)=TRUE ⇒ 303_0_MAIN_LOAD(x1[0], x0[0])≥NonInfC∧303_0_MAIN_LOAD(x1[0], x0[0])≥COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])∧(U^Increasing(COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x1[0] + [-1] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])), ≥)∧[(-1)bni_14 + (-1)Bound*bni_14] + [bni_14]max{[-1]x0[0] + x1[0], x0[0] + [-1]x1[0]} ≥ 0∧[(-1)bso_15] + max{[-1]x0[0] + x1[0], x0[0] + [-1]x1[0]} + [-1]max{[-1]x0[0] + x1[0], x0[0] + [-1]x1[0]} ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x1[0] + [-1] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])), ≥)∧[(-1)bni_14 + (-1)Bound*bni_14] + [bni_14]max{[-1]x0[0] + x1[0], x0[0] + [-1]x1[0]} ≥ 0∧[(-1)bso_15] + max{[-1]x0[0] + x1[0], x0[0] + [-1]x1[0]} + [-1]max{[-1]x0[0] + x1[0], x0[0] + [-1]x1[0]} ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (x1[0] + [-1] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧[-2]x0[0] + [2]x1[0] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])), ≥)∧[(-1)bni_14 + (-1)Bound*bni_14] + [(-1)bni_14]x0[0] + [bni_14]x1[0] ≥ 0∧[(-1)bso_15] ≥ 0)

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    (x1[0] ≥ 0∧x0[0] ≥ 0∧[2] + [2]x1[0] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])), ≥)∧[(-1)Bound*bni_14] + [bni_14]x1[0] ≥ 0∧[(-1)bso_15] ≥ 0)

We simplified constraint (6) using rule (IDP_POLY_GCD) which results in the following new constraint:
(7)    (x1[0] ≥ 0∧x0[0] ≥ 0∧[1] + x1[0] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])), ≥)∧[(-1)Bound*bni_14] + [bni_14]x1[0] ≥ 0∧[(-1)bso_15] ≥ 0)

For Pair COND_303_0_MAIN_LOAD(TRUE, x1, x0) → 303_0_MAIN_LOAD(x1, +(x0, 1)) the following chains were created:

We consider the chain COND_303_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 303_0_MAIN_LOAD(x1[1], +(x0[1], 1)), 303_0_MAIN_LOAD(x1[0], x0[0]) → COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0]), COND_303_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 303_0_MAIN_LOAD(x1[1], +(x0[1], 1)) which results in the following constraint:
(8)    (x1[1]=x1[0]∧+(x0[1], 1)=x0[0]∧&&(>(x1[0], x0[0]), >(x0[0], -1))=TRUE∧x1[0]=x1[1]1∧x0[0]=x0[1]1 ⇒ COND_303_0_MAIN_LOAD(TRUE, x1[1]1, x0[1]1)≥NonInfC∧COND_303_0_MAIN_LOAD(TRUE, x1[1]1, x0[1]1)≥303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))∧(U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥))

We simplified constraint (8) using rules (III), (IDP_BOOLEAN) which results in the following new constraint:
(9)    (>(x1[0], +(x0[1], 1))=TRUE∧>(+(x0[1], 1), -1)=TRUE ⇒ COND_303_0_MAIN_LOAD(TRUE, x1[0], +(x0[1], 1))≥NonInfC∧COND_303_0_MAIN_LOAD(TRUE, x1[0], +(x0[1], 1))≥303_0_MAIN_LOAD(x1[0], +(+(x0[1], 1), 1))∧(U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥))

We simplified constraint (9) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(10)    (x1[0] + [-2] + [-1]x0[1] ≥ 0∧x0[1] + [1] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥)∧[(-1)bni_16 + (-1)Bound*bni_16] + [bni_16]max{[-1] + [-1]x0[1] + x1[0], [1] + x0[1] + [-1]x1[0]} ≥ 0∧[(-1)bso_17] + max{[-1] + [-1]x0[1] + x1[0], [1] + x0[1] + [-1]x1[0]} + [-1]max{[-2] + [-1]x0[1] + x1[0], [2] + x0[1] + [-1]x1[0]} ≥ 0)

We simplified constraint (10) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(11)    (x1[0] + [-2] + [-1]x0[1] ≥ 0∧x0[1] + [1] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥)∧[(-1)bni_16 + (-1)Bound*bni_16] + [bni_16]max{[-1] + [-1]x0[1] + x1[0], [1] + x0[1] + [-1]x1[0]} ≥ 0∧[(-1)bso_17] + max{[-1] + [-1]x0[1] + x1[0], [1] + x0[1] + [-1]x1[0]} + [-1]max{[-2] + [-1]x0[1] + x1[0], [2] + x0[1] + [-1]x1[0]} ≥ 0)

We simplified constraint (11) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(12)    (x1[0] + [-2] + [-1]x0[1] ≥ 0∧x0[1] + [1] ≥ 0∧[-2] + [-2]x0[1] + [2]x1[0] ≥ 0∧[-4] + [-2]x0[1] + [2]x1[0] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥)∧[(-2)bni_16 + (-1)Bound*bni_16] + [(-1)bni_16]x0[1] + [bni_16]x1[0] ≥ 0∧[1 + (-1)bso_17] ≥ 0)

We simplified constraint (12) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(13)    (x1[0] ≥ 0∧x0[1] + [1] ≥ 0∧[2] + [2]x1[0] ≥ 0∧[2]x1[0] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥)∧[(-1)Bound*bni_16] + [bni_16]x1[0] ≥ 0∧[1 + (-1)bso_17] ≥ 0)

We simplified constraint (13) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(14)    (x1[0] ≥ 0∧x0[1] + [1] ≥ 0∧[2] + [2]x1[0] ≥ 0∧[2]x1[0] ≥ 0∧x0[1] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥)∧[(-1)Bound*bni_16] + [bni_16]x1[0] ≥ 0∧[1 + (-1)bso_17] ≥ 0)

(15)    (x1[0] ≥ 0∧[-1]x0[1] + [1] ≥ 0∧[2] + [2]x1[0] ≥ 0∧[2]x1[0] ≥ 0∧x0[1] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥)∧[(-1)Bound*bni_16] + [bni_16]x1[0] ≥ 0∧[1 + (-1)bso_17] ≥ 0)

We simplified constraint (14) using rule (IDP_POLY_GCD) which results in the following new constraint:
(16)    (x1[0] ≥ 0∧x0[1] + [1] ≥ 0∧x0[1] ≥ 0∧[1] + x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥)∧[(-1)Bound*bni_16] + [bni_16]x1[0] ≥ 0∧[1 + (-1)bso_17] ≥ 0)

We simplified constraint (15) using rule (IDP_POLY_GCD) which results in the following new constraint:
(17)    (x1[0] ≥ 0∧[-1]x0[1] + [1] ≥ 0∧x0[1] ≥ 0∧[1] + x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥)∧[(-1)Bound*bni_16] + [bni_16]x1[0] ≥ 0∧[1 + (-1)bso_17] ≥ 0)
We consider the chain COND_303_0_MAIN_LOAD1(TRUE, x1[3], x0[3]) → 303_0_MAIN_LOAD(+(x1[3], 1), x0[3]), 303_0_MAIN_LOAD(x1[0], x0[0]) → COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0]), COND_303_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 303_0_MAIN_LOAD(x1[1], +(x0[1], 1)) which results in the following constraint:
(18)    (+(x1[3], 1)=x1[0]∧x0[3]=x0[0]∧&&(>(x1[0], x0[0]), >(x0[0], -1))=TRUE∧x1[0]=x1[1]∧x0[0]=x0[1] ⇒ COND_303_0_MAIN_LOAD(TRUE, x1[1], x0[1])≥NonInfC∧COND_303_0_MAIN_LOAD(TRUE, x1[1], x0[1])≥303_0_MAIN_LOAD(x1[1], +(x0[1], 1))∧(U^Increasing(303_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥))

We simplified constraint (18) using rules (III), (IDP_BOOLEAN) which results in the following new constraint:
(19)    (>(+(x1[3], 1), x0[0])=TRUE∧>(x0[0], -1)=TRUE ⇒ COND_303_0_MAIN_LOAD(TRUE, +(x1[3], 1), x0[0])≥NonInfC∧COND_303_0_MAIN_LOAD(TRUE, +(x1[3], 1), x0[0])≥303_0_MAIN_LOAD(+(x1[3], 1), +(x0[0], 1))∧(U^Increasing(303_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥))

We simplified constraint (19) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(20)    (x1[3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[(-1)bni_16 + (-1)Bound*bni_16] + [bni_16]max{[1] + [-1]x0[0] + x1[3], [-1] + x0[0] + [-1]x1[3]} ≥ 0∧[(-1)bso_17] + max{[1] + [-1]x0[0] + x1[3], [-1] + x0[0] + [-1]x1[3]} + [-1]max{[-1]x0[0] + x1[3], x0[0] + [-1]x1[3]} ≥ 0)

We simplified constraint (20) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(21)    (x1[3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[(-1)bni_16 + (-1)Bound*bni_16] + [bni_16]max{[1] + [-1]x0[0] + x1[3], [-1] + x0[0] + [-1]x1[3]} ≥ 0∧[(-1)bso_17] + max{[1] + [-1]x0[0] + x1[3], [-1] + x0[0] + [-1]x1[3]} + [-1]max{[-1]x0[0] + x1[3], x0[0] + [-1]x1[3]} ≥ 0)

We simplified constraint (21) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(22)    (x1[3] + [-1]x0[0] ≥ 0∧x0[0] ≥ 0∧[2] + [-2]x0[0] + [2]x1[3] ≥ 0∧[-2]x0[0] + [2]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[(-1)Bound*bni_16] + [(-1)bni_16]x0[0] + [bni_16]x1[3] ≥ 0∧[1 + (-1)bso_17] ≥ 0)

We simplified constraint (22) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(23)    (x1[3] ≥ 0∧x0[0] ≥ 0∧[2] + [2]x1[3] ≥ 0∧[2]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[(-1)Bound*bni_16] + [bni_16]x1[3] ≥ 0∧[1 + (-1)bso_17] ≥ 0)

We simplified constraint (23) using rule (IDP_POLY_GCD) which results in the following new constraint:
(24)    (x1[3] ≥ 0∧x0[0] ≥ 0∧[1] + x1[3] ≥ 0∧x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[(-1)Bound*bni_16] + [bni_16]x1[3] ≥ 0∧[1 + (-1)bso_17] ≥ 0)

For Pair 303_0_MAIN_LOAD(x1, x0) → COND_303_0_MAIN_LOAD1(&&(>(x1, -1), <(x1, x0)), x1, x0) the following chains were created:

We consider the chain 303_0_MAIN_LOAD(x1[2], x0[2]) → COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2]), COND_303_0_MAIN_LOAD1(TRUE, x1[3], x0[3]) → 303_0_MAIN_LOAD(+(x1[3], 1), x0[3]) which results in the following constraint:
(25)    (&&(>(x1[2], -1), <(x1[2], x0[2]))=TRUE∧x1[2]=x1[3]∧x0[2]=x0[3] ⇒ 303_0_MAIN_LOAD(x1[2], x0[2])≥NonInfC∧303_0_MAIN_LOAD(x1[2], x0[2])≥COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])∧(U^Increasing(COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])), ≥))

We simplified constraint (25) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(26)    (>(x1[2], -1)=TRUE∧<(x1[2], x0[2])=TRUE ⇒ 303_0_MAIN_LOAD(x1[2], x0[2])≥NonInfC∧303_0_MAIN_LOAD(x1[2], x0[2])≥COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])∧(U^Increasing(COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])), ≥))

We simplified constraint (26) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(27)    (x1[2] ≥ 0∧x0[2] + [-1] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])), ≥)∧[(-1)bni_18 + (-1)Bound*bni_18] + [bni_18]max{[-1]x0[2] + x1[2], x0[2] + [-1]x1[2]} ≥ 0∧[(-1)bso_19] + max{[-1]x0[2] + x1[2], x0[2] + [-1]x1[2]} + [-1]max{[-1]x0[2] + x1[2], x0[2] + [-1]x1[2]} ≥ 0)

We simplified constraint (27) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(28)    (x1[2] ≥ 0∧x0[2] + [-1] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])), ≥)∧[(-1)bni_18 + (-1)Bound*bni_18] + [bni_18]max{[-1]x0[2] + x1[2], x0[2] + [-1]x1[2]} ≥ 0∧[(-1)bso_19] + max{[-1]x0[2] + x1[2], x0[2] + [-1]x1[2]} + [-1]max{[-1]x0[2] + x1[2], x0[2] + [-1]x1[2]} ≥ 0)

We simplified constraint (28) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(29)    (x1[2] ≥ 0∧x0[2] + [-1] + [-1]x1[2] ≥ 0∧[-1] + [2]x0[2] + [-2]x1[2] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])), ≥)∧[(-1)bni_18 + (-1)Bound*bni_18] + [bni_18]x0[2] + [(-1)bni_18]x1[2] ≥ 0∧[(-1)bso_19] ≥ 0)

We simplified constraint (29) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(30)    (x1[2] ≥ 0∧x0[2] ≥ 0∧[1] + [2]x0[2] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])), ≥)∧[(-1)Bound*bni_18] + [bni_18]x0[2] ≥ 0∧[(-1)bso_19] ≥ 0)

For Pair COND_303_0_MAIN_LOAD1(TRUE, x1, x0) → 303_0_MAIN_LOAD(+(x1, 1), x0) the following chains were created:

We consider the chain COND_303_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 303_0_MAIN_LOAD(x1[1], +(x0[1], 1)), 303_0_MAIN_LOAD(x1[2], x0[2]) → COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2]), COND_303_0_MAIN_LOAD1(TRUE, x1[3], x0[3]) → 303_0_MAIN_LOAD(+(x1[3], 1), x0[3]) which results in the following constraint:
(31)    (x1[1]=x1[2]∧+(x0[1], 1)=x0[2]∧&&(>(x1[2], -1), <(x1[2], x0[2]))=TRUE∧x1[2]=x1[3]∧x0[2]=x0[3] ⇒ COND_303_0_MAIN_LOAD1(TRUE, x1[3], x0[3])≥NonInfC∧COND_303_0_MAIN_LOAD1(TRUE, x1[3], x0[3])≥303_0_MAIN_LOAD(+(x1[3], 1), x0[3])∧(U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥))

We simplified constraint (31) using rules (III), (IDP_BOOLEAN) which results in the following new constraint:
(32)    (>(x1[2], -1)=TRUE∧<(x1[2], +(x0[1], 1))=TRUE ⇒ COND_303_0_MAIN_LOAD1(TRUE, x1[2], +(x0[1], 1))≥NonInfC∧COND_303_0_MAIN_LOAD1(TRUE, x1[2], +(x0[1], 1))≥303_0_MAIN_LOAD(+(x1[2], 1), +(x0[1], 1))∧(U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥))

We simplified constraint (32) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(33)    (x1[2] ≥ 0∧x0[1] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥)∧[(-1)bni_20 + (-1)Bound*bni_20] + [bni_20]max{[-1] + [-1]x0[1] + x1[2], [1] + x0[1] + [-1]x1[2]} ≥ 0∧[(-1)bso_21] + max{[-1] + [-1]x0[1] + x1[2], [1] + x0[1] + [-1]x1[2]} + [-1]max{[-1]x0[1] + x1[2], x0[1] + [-1]x1[2]} ≥ 0)

We simplified constraint (33) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(34)    (x1[2] ≥ 0∧x0[1] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥)∧[(-1)bni_20 + (-1)Bound*bni_20] + [bni_20]max{[-1] + [-1]x0[1] + x1[2], [1] + x0[1] + [-1]x1[2]} ≥ 0∧[(-1)bso_21] + max{[-1] + [-1]x0[1] + x1[2], [1] + x0[1] + [-1]x1[2]} + [-1]max{[-1]x0[1] + x1[2], x0[1] + [-1]x1[2]} ≥ 0)

We simplified constraint (34) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraints:
(35)    (x1[2] ≥ 0∧x0[1] + [-1]x1[2] ≥ 0∧[1] + [2]x0[1] + [-2]x1[2] ≥ 0∧[-2]x0[1] + [2]x1[2] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥)∧[(-1)Bound*bni_20] + [bni_20]x0[1] + [(-1)bni_20]x1[2] ≥ 0∧[1 + (-1)bso_21] + [2]x0[1] + [-2]x1[2] ≥ 0)

(36)    (x1[2] ≥ 0∧x0[1] + [-1]x1[2] ≥ 0∧[1] + [2]x0[1] + [-2]x1[2] ≥ 0∧[-1] + [2]x0[1] + [-2]x1[2] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥)∧[(-1)Bound*bni_20] + [bni_20]x0[1] + [(-1)bni_20]x1[2] ≥ 0∧[1 + (-1)bso_21] ≥ 0)

We simplified constraint (35) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(37)    (x0[1] + x1[2] ≥ 0∧[-1]x1[2] ≥ 0∧[1] + [-2]x1[2] ≥ 0∧[2]x1[2] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥)∧[(-1)Bound*bni_20] + [(-1)bni_20]x1[2] ≥ 0∧[1 + (-1)bso_21] + [-2]x1[2] ≥ 0)

We simplified constraint (36) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(38)    (x1[2] ≥ 0∧x0[1] ≥ 0∧[1] + [2]x0[1] ≥ 0∧[-1] + [2]x0[1] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥)∧[(-1)Bound*bni_20] + [bni_20]x0[1] ≥ 0∧[1 + (-1)bso_21] ≥ 0)

We simplified constraint (37) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(39)    (x0[1] ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥)∧[(-1)Bound*bni_20] ≥ 0∧[1 + (-1)bso_21] ≥ 0)
We consider the chain COND_303_0_MAIN_LOAD1(TRUE, x1[3], x0[3]) → 303_0_MAIN_LOAD(+(x1[3], 1), x0[3]), 303_0_MAIN_LOAD(x1[2], x0[2]) → COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2]), COND_303_0_MAIN_LOAD1(TRUE, x1[3], x0[3]) → 303_0_MAIN_LOAD(+(x1[3], 1), x0[3]) which results in the following constraint:
(40)    (+(x1[3], 1)=x1[2]∧x0[3]=x0[2]∧&&(>(x1[2], -1), <(x1[2], x0[2]))=TRUE∧x1[2]=x1[3]1∧x0[2]=x0[3]1 ⇒ COND_303_0_MAIN_LOAD1(TRUE, x1[3]1, x0[3]1)≥NonInfC∧COND_303_0_MAIN_LOAD1(TRUE, x1[3]1, x0[3]1)≥303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)∧(U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥))

We simplified constraint (40) using rules (III), (IDP_BOOLEAN) which results in the following new constraint:
(41)    (>(+(x1[3], 1), -1)=TRUE∧<(+(x1[3], 1), x0[2])=TRUE ⇒ COND_303_0_MAIN_LOAD1(TRUE, +(x1[3], 1), x0[2])≥NonInfC∧COND_303_0_MAIN_LOAD1(TRUE, +(x1[3], 1), x0[2])≥303_0_MAIN_LOAD(+(+(x1[3], 1), 1), x0[2])∧(U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥))

We simplified constraint (41) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(42)    (x1[3] + [1] ≥ 0∧x0[2] + [-2] + [-1]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-1)bni_20 + (-1)Bound*bni_20] + [bni_20]max{[1] + [-1]x0[2] + x1[3], [-1] + x0[2] + [-1]x1[3]} ≥ 0∧[(-1)bso_21] + max{[1] + [-1]x0[2] + x1[3], [-1] + x0[2] + [-1]x1[3]} + [-1]max{[2] + [-1]x0[2] + x1[3], [-2] + x0[2] + [-1]x1[3]} ≥ 0)

We simplified constraint (42) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(43)    (x1[3] + [1] ≥ 0∧x0[2] + [-2] + [-1]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-1)bni_20 + (-1)Bound*bni_20] + [bni_20]max{[1] + [-1]x0[2] + x1[3], [-1] + x0[2] + [-1]x1[3]} ≥ 0∧[(-1)bso_21] + max{[1] + [-1]x0[2] + x1[3], [-1] + x0[2] + [-1]x1[3]} + [-1]max{[2] + [-1]x0[2] + x1[3], [-2] + x0[2] + [-1]x1[3]} ≥ 0)

We simplified constraint (43) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraints:
(44)    (x1[3] + [1] ≥ 0∧x0[2] + [-2] + [-1]x1[3] ≥ 0∧[-3] + [2]x0[2] + [-2]x1[3] ≥ 0∧[4] + [-2]x0[2] + [2]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-2)bni_20 + (-1)Bound*bni_20] + [bni_20]x0[2] + [(-1)bni_20]x1[3] ≥ 0∧[-3 + (-1)bso_21] + [2]x0[2] + [-2]x1[3] ≥ 0)

(45)    (x1[3] + [1] ≥ 0∧x0[2] + [-2] + [-1]x1[3] ≥ 0∧[-3] + [2]x0[2] + [-2]x1[3] ≥ 0∧[-5] + [2]x0[2] + [-2]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-2)bni_20 + (-1)Bound*bni_20] + [bni_20]x0[2] + [(-1)bni_20]x1[3] ≥ 0∧[1 + (-1)bso_21] ≥ 0)

We simplified constraint (44) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(46)    (x0[2] + [-1] + [-1]x1[3] ≥ 0∧x1[3] ≥ 0∧[1] + [2]x1[3] ≥ 0∧[-2]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-1)Bound*bni_20] + [bni_20]x1[3] ≥ 0∧[1 + (-1)bso_21] + [2]x1[3] ≥ 0)

We simplified constraint (45) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(47)    (x0[2] + [-1] + [-1]x1[3] ≥ 0∧x1[3] ≥ 0∧[1] + [2]x1[3] ≥ 0∧[-1] + [2]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-1)Bound*bni_20] + [bni_20]x1[3] ≥ 0∧[1 + (-1)bso_21] ≥ 0)

We simplified constraint (46) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(48)    (x0[2] + [-1]x1[3] ≥ 0∧x1[3] ≥ 0∧[1] + [2]x1[3] ≥ 0∧[-2]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-1)Bound*bni_20] + [bni_20]x1[3] ≥ 0∧[1 + (-1)bso_21] + [2]x1[3] ≥ 0)

We simplified constraint (48) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(49)    (x0[2] ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-1)Bound*bni_20] ≥ 0∧[1 + (-1)bso_21] ≥ 0)

We simplified constraint (47) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(50)    (x0[2] ≥ 0∧x1[3] ≥ 0∧[1] + [2]x1[3] ≥ 0∧[-1] + [2]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-1)Bound*bni_20] + [bni_20]x1[3] ≥ 0∧[1 + (-1)bso_21] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

303_0_MAIN_LOAD(x1, x0) → COND_303_0_MAIN_LOAD(&&(>(x1, x0), >(x0, -1)), x1, x0)
- (x1[0] ≥ 0∧x0[0] ≥ 0∧[1] + x1[0] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])), ≥)∧[(-1)Bound*bni_14] + [bni_14]x1[0] ≥ 0∧[(-1)bso_15] ≥ 0)
COND_303_0_MAIN_LOAD(TRUE, x1, x0) → 303_0_MAIN_LOAD(x1, +(x0, 1))
- (x1[0] ≥ 0∧x0[1] + [1] ≥ 0∧x0[1] ≥ 0∧[1] + x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥)∧[(-1)Bound*bni_16] + [bni_16]x1[0] ≥ 0∧[1 + (-1)bso_17] ≥ 0)
- (x1[0] ≥ 0∧[-1]x0[1] + [1] ≥ 0∧x0[1] ≥ 0∧[1] + x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1]1, +(x0[1]1, 1))), ≥)∧[(-1)Bound*bni_16] + [bni_16]x1[0] ≥ 0∧[1 + (-1)bso_17] ≥ 0)
- (x1[3] ≥ 0∧x0[0] ≥ 0∧[1] + x1[3] ≥ 0∧x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(x1[1], +(x0[1], 1))), ≥)∧[(-1)Bound*bni_16] + [bni_16]x1[3] ≥ 0∧[1 + (-1)bso_17] ≥ 0)
303_0_MAIN_LOAD(x1, x0) → COND_303_0_MAIN_LOAD1(&&(>(x1, -1), <(x1, x0)), x1, x0)
- (x1[2] ≥ 0∧x0[2] ≥ 0∧[1] + [2]x0[2] ≥ 0 ⇒ (U^Increasing(COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])), ≥)∧[(-1)Bound*bni_18] + [bni_18]x0[2] ≥ 0∧[(-1)bso_19] ≥ 0)
COND_303_0_MAIN_LOAD1(TRUE, x1, x0) → 303_0_MAIN_LOAD(+(x1, 1), x0)
- (x0[1] ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥)∧[(-1)Bound*bni_20] ≥ 0∧[1 + (-1)bso_21] ≥ 0)
- (x1[2] ≥ 0∧x0[1] ≥ 0∧[1] + [2]x0[1] ≥ 0∧[-1] + [2]x0[1] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3], 1), x0[3])), ≥)∧[(-1)Bound*bni_20] + [bni_20]x0[1] ≥ 0∧[1 + (-1)bso_21] ≥ 0)
- (x0[2] ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-1)Bound*bni_20] ≥ 0∧[1 + (-1)bso_21] ≥ 0)
- (x0[2] ≥ 0∧x1[3] ≥ 0∧[1] + [2]x1[3] ≥ 0∧[-1] + [2]x1[3] ≥ 0 ⇒ (U^Increasing(303_0_MAIN_LOAD(+(x1[3]1, 1), x0[3]1)), ≥)∧[(-1)Bound*bni_20] + [bni_20]x1[3] ≥ 0∧[1 + (-1)bso_21] ≥ 0)

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation over integers[POLO]:

POL(TRUE) = 0
POL(FALSE) = 0
POL(303_0_MAIN_LOAD(x₁, x₂)) = [-1] + max{[-1]x₂ + x₁, x₂ + [-1]x₁}
POL(COND_303_0_MAIN_LOAD(x₁, x₂, x₃)) = [-1] + max{[-1]x₃ + x₂, x₃ + [-1]x₂}
POL(&&(x₁, x₂)) = [-1]
POL(>(x₁, x₂)) = [-1]
POL(-1) = [-1]
POL(+(x₁, x₂)) = x₁ + x₂
POL(1) = [1]
POL(COND_303_0_MAIN_LOAD1(x₁, x₂, x₃)) = [-1] + max{[-1]x₃ + x₂, x₃ + [-1]x₂}
POL(<(x₁, x₂)) = [-1]

The following pairs are in P_>:

COND_303_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 303_0_MAIN_LOAD(x1[1], +(x0[1], 1))
COND_303_0_MAIN_LOAD1(TRUE, x1[3], x0[3]) → 303_0_MAIN_LOAD(+(x1[3], 1), x0[3])

The following pairs are in P_bound:

303_0_MAIN_LOAD(x1[0], x0[0]) → COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])
COND_303_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 303_0_MAIN_LOAD(x1[1], +(x0[1], 1))
303_0_MAIN_LOAD(x1[2], x0[2]) → COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])
COND_303_0_MAIN_LOAD1(TRUE, x1[3], x0[3]) → 303_0_MAIN_LOAD(+(x1[3], 1), x0[3])

The following pairs are in P_≥:

303_0_MAIN_LOAD(x1[0], x0[0]) → COND_303_0_MAIN_LOAD(&&(>(x1[0], x0[0]), >(x0[0], -1)), x1[0], x0[0])
303_0_MAIN_LOAD(x1[2], x0[2]) → COND_303_0_MAIN_LOAD1(&&(>(x1[2], -1), <(x1[2], x0[2])), x1[2], x0[2])

There are no usable rules.

(8) Obligation: