### (0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_16 (Sun Microsystems Inc.) Main-Class: PastaB4
`/** * 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 PastaB4 {    public static void main(String[] args) {        Random.args = args;        int x = Random.random();        int y = Random.random();        while (x > y) {            int t = x;            x = y;            y = t;        }    }}public class Random {  static String[] args;  static int index = 0;  public static int random() {    String string = args[index];    index++;    return string.length();  }}`

### (1) JBC2FIG (SOUND transformation)

Constructed FIGraph.

### (2) Obligation:

FIGraph based on JBC Program:
Graph of 189 nodes with 1 SCC.

### (3) FIGtoITRSProof (SOUND transformation)

Transformed FIGraph to ITRS rules

### (4) Obligation:

ITRS 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 TRS R consists of the following rules:
The set Q consists of the following terms:

### (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:

Integer

The ITRS R consists of the following rules:

The integer pair graph contains the following rules and edges:

(0) -> (1), if ((i14[0]* i14[1])∧(i20[0]* i20[1])∧(i14[0] > i20[0]* TRUE))

(1) -> (0), if ((i20[1]* i14[0])∧(i14[1]* i20[0]))

The set Q consists of the following terms:

### (7) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

### (8) 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:

Integer

R is empty.

The integer pair graph contains the following rules and edges:

(0) -> (1), if ((i14[0]* i14[1])∧(i20[0]* i20[1])∧(i14[0] > i20[0]* TRUE))

(1) -> (0), if ((i20[1]* i14[0])∧(i14[1]* i20[0]))

The set Q consists of the following terms:

### (9) IDPNonInfProof (SOUND transformation)

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 LOAD681(i14, i20) → COND_LOAD681(>(i14, i20), i14, i20) the following chains were created:

We simplified constraint (1) using rules (III), (IV) which results in the following new constraint:

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:

(3)    (i14[0] + [-1] + [-1]i20[0] ≥ 0 ⇒ (UIncreasing(COND_LOAD681(>(i14[0], i20[0]), i14[0], i20[0])), ≥)∧[(-1)bni_11 + (-1)Bound*bni_11] + [(-1)bni_11]i20[0] + [bni_11]i14[0] ≥ 0∧[-1 + (-1)bso_12] + [-2]i20[0] + [2]i14[0] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:

(4)    (i14[0] + [-1] + [-1]i20[0] ≥ 0 ⇒ (UIncreasing(COND_LOAD681(>(i14[0], i20[0]), i14[0], i20[0])), ≥)∧[(-1)bni_11 + (-1)Bound*bni_11] + [(-1)bni_11]i20[0] + [bni_11]i14[0] ≥ 0∧[-1 + (-1)bso_12] + [-2]i20[0] + [2]i14[0] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:

(5)    (i14[0] + [-1] + [-1]i20[0] ≥ 0 ⇒ (UIncreasing(COND_LOAD681(>(i14[0], i20[0]), i14[0], i20[0])), ≥)∧[(-1)bni_11 + (-1)Bound*bni_11] + [(-1)bni_11]i20[0] + [bni_11]i14[0] ≥ 0∧[-1 + (-1)bso_12] + [-2]i20[0] + [2]i14[0] ≥ 0)

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:

(6)    (i14[0] ≥ 0 ⇒ (UIncreasing(COND_LOAD681(>(i14[0], i20[0]), i14[0], i20[0])), ≥)∧[(-1)Bound*bni_11] + [bni_11]i14[0] ≥ 0∧[1 + (-1)bso_12] + [2]i14[0] ≥ 0)

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraints:

(7)    (i14[0] ≥ 0∧i20[0] ≥ 0 ⇒ (UIncreasing(COND_LOAD681(>(i14[0], i20[0]), i14[0], i20[0])), ≥)∧[(-1)Bound*bni_11] + [bni_11]i14[0] ≥ 0∧[1 + (-1)bso_12] + [2]i14[0] ≥ 0)

(8)    (i14[0] ≥ 0∧i20[0] ≥ 0 ⇒ (UIncreasing(COND_LOAD681(>(i14[0], i20[0]), i14[0], i20[0])), ≥)∧[(-1)Bound*bni_11] + [bni_11]i14[0] ≥ 0∧[1 + (-1)bso_12] + [2]i14[0] ≥ 0)

For Pair COND_LOAD681(TRUE, i14, i20) → LOAD681(i20, i14) the following chains were created:

We simplified constraint (9) using rules (III), (IV) which results in the following new constraint:

We simplified constraint (10) using rule (POLY_CONSTRAINTS) which results in the following new constraint:

(11)    (i14[0] + [-1] + [-1]i20[0] ≥ 0 ⇒ (UIncreasing(LOAD681(i20[1], i14[1])), ≥)∧[(-1)Bound*bni_13] + [bni_13]i20[0] + [(-1)bni_13]i14[0] ≥ 0∧[1 + (-1)bso_14] ≥ 0)

We simplified constraint (11) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:

(12)    (i14[0] + [-1] + [-1]i20[0] ≥ 0 ⇒ (UIncreasing(LOAD681(i20[1], i14[1])), ≥)∧[(-1)Bound*bni_13] + [bni_13]i20[0] + [(-1)bni_13]i14[0] ≥ 0∧[1 + (-1)bso_14] ≥ 0)

We simplified constraint (12) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:

(13)    (i14[0] + [-1] + [-1]i20[0] ≥ 0 ⇒ (UIncreasing(LOAD681(i20[1], i14[1])), ≥)∧[(-1)Bound*bni_13] + [bni_13]i20[0] + [(-1)bni_13]i14[0] ≥ 0∧[1 + (-1)bso_14] ≥ 0)

We simplified constraint (13) using rule (IDP_SMT_SPLIT) which results in the following new constraint:

(14)    (i14[0] ≥ 0 ⇒ (UIncreasing(LOAD681(i20[1], i14[1])), ≥)∧[(-1)Bound*bni_13 + (-1)bni_13] + [(-1)bni_13]i14[0] ≥ 0∧[1 + (-1)bso_14] ≥ 0)

We simplified constraint (14) using rule (IDP_SMT_SPLIT) which results in the following new constraints:

(15)    (i14[0] ≥ 0∧i20[0] ≥ 0 ⇒ (UIncreasing(LOAD681(i20[1], i14[1])), ≥)∧[(-1)Bound*bni_13 + (-1)bni_13] + [(-1)bni_13]i14[0] ≥ 0∧[1 + (-1)bso_14] ≥ 0)

(16)    (i14[0] ≥ 0∧i20[0] ≥ 0 ⇒ (UIncreasing(LOAD681(i20[1], i14[1])), ≥)∧[(-1)Bound*bni_13 + (-1)bni_13] + [(-1)bni_13]i14[0] ≥ 0∧[1 + (-1)bso_14] ≥ 0)

To summarize, we get the following constraints P for the following pairs.
• (i14[0] ≥ 0∧i20[0] ≥ 0 ⇒ (UIncreasing(COND_LOAD681(>(i14[0], i20[0]), i14[0], i20[0])), ≥)∧[(-1)Bound*bni_11] + [bni_11]i14[0] ≥ 0∧[1 + (-1)bso_12] + [2]i14[0] ≥ 0)
• (i14[0] ≥ 0∧i20[0] ≥ 0 ⇒ (UIncreasing(COND_LOAD681(>(i14[0], i20[0]), i14[0], i20[0])), ≥)∧[(-1)Bound*bni_11] + [bni_11]i14[0] ≥ 0∧[1 + (-1)bso_12] + [2]i14[0] ≥ 0)

• (i14[0] ≥ 0∧i20[0] ≥ 0 ⇒ (UIncreasing(LOAD681(i20[1], i14[1])), ≥)∧[(-1)Bound*bni_13 + (-1)bni_13] + [(-1)bni_13]i14[0] ≥ 0∧[1 + (-1)bso_14] ≥ 0)
• (i14[0] ≥ 0∧i20[0] ≥ 0 ⇒ (UIncreasing(LOAD681(i20[1], i14[1])), ≥)∧[(-1)Bound*bni_13 + (-1)bni_13] + [(-1)bni_13]i14[0] ≥ 0∧[1 + (-1)bso_14] ≥ 0)

The constraints for P> respective Pbound 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 Pbound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation over integers[POLO]:

POL(TRUE) = 0
POL(FALSE) = 0
POL(LOAD681(x1, x2)) = [-1] + [-1]x2 + x1
POL(COND_LOAD681(x1, x2, x3)) = x3 + [-1]x2
POL(>(x1, x2)) = [1]

The following pairs are in P>:

The following pairs are in Pbound:

The following pairs are in P:
none

There are no usable rules.

### (11) 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:
none

R is empty.

The integer pair graph is empty.

The set Q consists of the following terms:

### (12) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs.

### (14) 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:
none

R is empty.

The integer pair graph contains the following rules and edges: