Termination proof of /tmp/tmpCLRSEJ/PastaB3.jar

Termination of the given JBC could be proven:

0 JBC

↳1 JBCToGraph (⇒, 260 ms)

↳2 JBCTerminationGraph

↳3 TerminationGraphToSCCProof (⇒, 0 ms)

↳4 JBCTerminationSCC

↳5 SCCToIDPv1Proof (⇒, 60 ms)

↳6 IDP

↳7 IDPNonInfProof (⇒, 190 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: PastaB3

/**
 * 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 PastaB3 {
    public static void main(String[] args) {
        Random.args = args;
        int x = Random.random();
        int y = Random.random();

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


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:
PastaB3.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: PastaB3.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 10 rules for P and 0 rules for R.

P rules:
332_0_main_Load(EOS(STATIC_332), i51, i47, i51) → 339_0_main_LE(EOS(STATIC_339), i51, i47, i51, i47)
339_0_main_LE(EOS(STATIC_339), i51, i47, i51, i47) → 348_0_main_LE(EOS(STATIC_348), i51, i47, i51, i47)
348_0_main_LE(EOS(STATIC_348), i51, i47, i51, i47) → 367_0_main_Load(EOS(STATIC_367), i51, i47) | >(i51, i47)
367_0_main_Load(EOS(STATIC_367), i51, i47) → 378_0_main_Load(EOS(STATIC_378), i51, i47, i51)
378_0_main_Load(EOS(STATIC_378), i51, i47, i51) → 386_0_main_IntArithmetic(EOS(STATIC_386), i51, i51, i47)
386_0_main_IntArithmetic(EOS(STATIC_386), i51, i51, i47) → 399_0_main_Store(EOS(STATIC_399), i51, +(i51, i47)) | &&(>(i51, 0), >=(i47, 0))
399_0_main_Store(EOS(STATIC_399), i51, i56) → 409_0_main_JMP(EOS(STATIC_409), i51, i56)
409_0_main_JMP(EOS(STATIC_409), i51, i56) → 435_0_main_Load(EOS(STATIC_435), i51, i56)
435_0_main_Load(EOS(STATIC_435), i51, i56) → 322_0_main_Load(EOS(STATIC_322), i51, i56)
322_0_main_Load(EOS(STATIC_322), i51, i47) → 332_0_main_Load(EOS(STATIC_332), i51, i47, i51)
R rules:

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

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

Filtered ground terms:

332_0_main_Load(x1, x2, x3, x4) → 332_0_main_Load(x2, x3, x4)
EOS(x1) → EOS
Cond_332_0_main_Load(x1, x2, x3, x4, x5) → Cond_332_0_main_Load(x1, x3, x4, x5)

Filtered duplicate args:

332_0_main_Load(x1, x2, x3) → 332_0_main_Load(x2, x3)
Cond_332_0_main_Load(x1, x2, x3, x4) → Cond_332_0_main_Load(x1, x3, x4)

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

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

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

P rules:
332_0_MAIN_LOAD(x1, x0) → COND_332_0_MAIN_LOAD(&&(&&(>(x1, -1), <(x1, x0)), >(x0, 0)), x1, x0)
COND_332_0_MAIN_LOAD(TRUE, x1, x0) → 332_0_MAIN_LOAD(+(x0, x1), 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): 332_0_MAIN_LOAD(x1[0], x0[0]) → COND_332_0_MAIN_LOAD(x1[0] > -1 && x1[0] < x0[0] && x0[0] > 0, x1[0], x0[0])
(1): COND_332_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 332_0_MAIN_LOAD(x0[1] + x1[1], x0[1])

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

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

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.IdpDefaultShapeHeuristic@5ec60ee2 Constraint Generator: NonInfConstraintGenerator: PathGenerator: MetricPathGenerator: Max Left Steps: 1 Max Right Steps: 1

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 332_0_MAIN_LOAD(x1, x0) → COND_332_0_MAIN_LOAD(&&(&&(>(x1, -1), <(x1, x0)), >(x0, 0)), x1, x0) the following chains were created:

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

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

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x0[0] + [-1] ≥ 0∧x1[0] ≥ 0∧x0[0] + [-1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(COND_332_0_MAIN_LOAD(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), >(x0[0], 0)), x1[0], x0[0])), ≥)∧[(-1)bni_13 + (-1)Bound*bni_13] + [bni_13]x0[0] + [(-1)bni_13]x1[0] ≥ 0∧[(-1)bso_14] + x0[0] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x0[0] + [-1] ≥ 0∧x1[0] ≥ 0∧x0[0] + [-1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(COND_332_0_MAIN_LOAD(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), >(x0[0], 0)), x1[0], x0[0])), ≥)∧[(-1)bni_13 + (-1)Bound*bni_13] + [bni_13]x0[0] + [(-1)bni_13]x1[0] ≥ 0∧[(-1)bso_14] + x0[0] ≥ 0)

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

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

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(7)    (x1[0] + x0[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_332_0_MAIN_LOAD(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), >(x0[0], 0)), x1[0], x0[0])), ≥)∧[(-1)Bound*bni_13] + [bni_13]x0[0] ≥ 0∧[1 + (-1)bso_14] + x1[0] + x0[0] ≥ 0)

For Pair COND_332_0_MAIN_LOAD(TRUE, x1, x0) → 332_0_MAIN_LOAD(+(x0, x1), x0) the following chains were created:

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

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

We simplified constraint (9) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(10)    (x0[0] + [-1] ≥ 0∧x1[0] ≥ 0∧x0[0] + [-1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(332_0_MAIN_LOAD(+(x0[1], x1[1]), x0[1])), ≥)∧[(-1)bni_15 + (-1)Bound*bni_15] + [(-1)bni_15]x1[0] ≥ 0∧[(-1)bso_16] ≥ 0)

We simplified constraint (10) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(11)    (x0[0] + [-1] ≥ 0∧x1[0] ≥ 0∧x0[0] + [-1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(332_0_MAIN_LOAD(+(x0[1], x1[1]), x0[1])), ≥)∧[(-1)bni_15 + (-1)Bound*bni_15] + [(-1)bni_15]x1[0] ≥ 0∧[(-1)bso_16] ≥ 0)

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

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

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

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

332_0_MAIN_LOAD(x1, x0) → COND_332_0_MAIN_LOAD(&&(&&(>(x1, -1), <(x1, x0)), >(x0, 0)), x1, x0)
- (x1[0] + x0[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_332_0_MAIN_LOAD(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), >(x0[0], 0)), x1[0], x0[0])), ≥)∧[(-1)Bound*bni_13] + [bni_13]x0[0] ≥ 0∧[1 + (-1)bso_14] + x1[0] + x0[0] ≥ 0)
COND_332_0_MAIN_LOAD(TRUE, x1, x0) → 332_0_MAIN_LOAD(+(x0, x1), x0)
- (x1[0] + x0[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(332_0_MAIN_LOAD(+(x0[1], x1[1]), x0[1])), ≥)∧[(-1)bni_15 + (-1)Bound*bni_15] + [(-1)bni_15]x1[0] ≥ 0∧[(-1)bso_16] ≥ 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(332_0_MAIN_LOAD(x₁, x₂)) = [-1] + x₂ + [-1]x₁
POL(COND_332_0_MAIN_LOAD(x₁, x₂, x₃)) = [-1] + [-1]x₂ + [-1]x₁
POL(&&(x₁, x₂)) = 0
POL(>(x₁, x₂)) = [-1]
POL(-1) = [-1]
POL(<(x₁, x₂)) = [-1]
POL(0) = 0
POL(+(x₁, x₂)) = x₁ + x₂

The following pairs are in P_>:

332_0_MAIN_LOAD(x1[0], x0[0]) → COND_332_0_MAIN_LOAD(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), >(x0[0], 0)), x1[0], x0[0])

The following pairs are in P_bound:

332_0_MAIN_LOAD(x1[0], x0[0]) → COND_332_0_MAIN_LOAD(&&(&&(>(x1[0], -1), <(x1[0], x0[0])), >(x0[0], 0)), x1[0], x0[0])

The following pairs are in P_≥:

COND_332_0_MAIN_LOAD(TRUE, x1[1], x0[1]) → 332_0_MAIN_LOAD(+(x0[1], x1[1]), x0[1])

At least the following rules have been oriented under context sensitive arithmetic replacement:

&&(TRUE, TRUE)¹ ↔ TRUE¹
&&(TRUE, FALSE)¹ ↔ FALSE¹
&&(FALSE, TRUE)¹ ↔ FALSE¹
&&(FALSE, FALSE)¹ ↔ FALSE¹

(8) Obligation: