/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


termination of the given Bare JBC problem could be proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 94 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 387 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 92 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 26 ms]
(12) AND
    (13) IRSwT
        (14) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (15) IRSwT
        (16) TempFilterProof [SOUND, 5 ms]
        (17) IntTRS
        (18) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (19) YES
    (20) IRSwT
        (21) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (22) IRSwT
        (23) TempFilterProof [SOUND, 36 ms]
        (24) IntTRS
        (25) RankingReductionPairProof [EQUIVALENT, 0 ms]
        (26) YES


----------------------------------------

(0)
Obligation:
need to prove termination of the following program:
/**
 * 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 PastaB10 {
    public static void main(String[] args) {
        Random.args = args;
        int x = Random.random();
        int y = Random.random();

        while (x + y > 0) {
            if (x > 0) {
                x--;
            } else if (y > 0) {
                y--;
            } else {
                continue;
            }            
        }
    }
}


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

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



----------------------------------------

(1) BareJBCToJBCProof (EQUIVALENT)
initialized classpath
----------------------------------------

(2)
Obligation:
need to prove termination of the following program:
/**
 * 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 PastaB10 {
    public static void main(String[] args) {
        Random.args = args;
        int x = Random.random();
        int y = Random.random();

        while (x + y > 0) {
            if (x > 0) {
                x--;
            } else if (y > 0) {
                y--;
            } else {
                continue;
            }            
        }
    }
}


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

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



----------------------------------------

(3) JBCToGraph (EQUIVALENT)
Constructed TerminationGraph.
----------------------------------------

(4)
Obligation:
Termination Graph based on JBC Program:
PastaB10.main([Ljava/lang/String;)V: Graph of 187 nodes with 1 SCC.





----------------------------------------

(5) TerminationGraphToSCCProof (SOUND)
Splitted TerminationGraph to 1 SCCs.
----------------------------------------

(6)
Obligation:
SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: PastaB10.main([Ljava/lang/String;)V
SCC calls the following helper methods: 
Performed SCC analyses:
*Used field analysis yielded the following read fields:

*Marker field analysis yielded the following relations that could be markers:

----------------------------------------

(7) SCCToIRSProof (SOUND)
Transformed FIGraph SCCs to intTRSs. Log: 
Generated rules. Obtained 22 IRulesP rules:
f367_0_main_Load(EOS(STATIC_367), i19, i50, i19) -> f377_0_main_IntArithmetic(EOS(STATIC_377), i19, i50, i19, i50) :|: TRUE
f377_0_main_IntArithmetic(EOS(STATIC_377), i19, i50, i19, i50) -> f390_0_main_LE(EOS(STATIC_390), i19, i50, i19 + i50) :|: i19 >= 0 && i50 >= 0
f390_0_main_LE(EOS(STATIC_390), i19, i50, i64) -> f404_0_main_LE(EOS(STATIC_404), i19, i50, i64) :|: TRUE
f404_0_main_LE(EOS(STATIC_404), i19, i50, i64) -> f419_0_main_Load(EOS(STATIC_419), i19, i50) :|: i64 > 0
f419_0_main_Load(EOS(STATIC_419), i19, i50) -> f434_0_main_LE(EOS(STATIC_434), i19, i50, i19) :|: TRUE
f434_0_main_LE(EOS(STATIC_434), matching1, i50, matching2) -> f445_0_main_LE(EOS(STATIC_445), 0, i50, 0) :|: TRUE && matching1 = 0 && matching2 = 0
f434_0_main_LE(EOS(STATIC_434), i71, i50, i71) -> f446_0_main_LE(EOS(STATIC_446), i71, i50, i71) :|: TRUE
f445_0_main_LE(EOS(STATIC_445), matching1, i50, matching2) -> f455_0_main_Load(EOS(STATIC_455), 0, i50) :|: 0 <= 0 && matching1 = 0 && matching2 = 0
f455_0_main_Load(EOS(STATIC_455), matching1, i50) -> f468_0_main_LE(EOS(STATIC_468), 0, i50, i50) :|: TRUE && matching1 = 0
f468_0_main_LE(EOS(STATIC_468), matching1, matching2, matching3) -> f484_0_main_LE(EOS(STATIC_484), 0, 0, 0) :|: TRUE && matching1 = 0 && matching2 = 0 && matching3 = 0
f468_0_main_LE(EOS(STATIC_468), matching1, i77, i77) -> f485_0_main_LE(EOS(STATIC_485), 0, i77, i77) :|: TRUE && matching1 = 0
f484_0_main_LE(EOS(STATIC_484), matching1, matching2, matching3) -> f1172_0_main_Load(EOS(STATIC_1172), 0, 0) :|: 0 <= 0 && matching1 = 0 && matching2 = 0 && matching3 = 0
f1172_0_main_Load(EOS(STATIC_1172), matching1, matching2) -> f353_0_main_Load(EOS(STATIC_353), 0, 0) :|: TRUE && matching1 = 0 && matching2 = 0
f353_0_main_Load(EOS(STATIC_353), i19, i50) -> f367_0_main_Load(EOS(STATIC_367), i19, i50, i19) :|: TRUE
f485_0_main_LE(EOS(STATIC_485), matching1, i77, i77) -> f1173_0_main_Inc(EOS(STATIC_1173), 0, i77) :|: i77 > 0 && matching1 = 0
f1173_0_main_Inc(EOS(STATIC_1173), matching1, i77) -> f6000_0_main_JMP(EOS(STATIC_6000), 0, i77 + -1) :|: TRUE && matching1 = 0
f6000_0_main_JMP(EOS(STATIC_6000), matching1, i915) -> f6087_0_main_Load(EOS(STATIC_6087), 0, i915) :|: TRUE && matching1 = 0
f6087_0_main_Load(EOS(STATIC_6087), matching1, i915) -> f353_0_main_Load(EOS(STATIC_353), 0, i915) :|: TRUE && matching1 = 0
f446_0_main_LE(EOS(STATIC_446), i71, i50, i71) -> f458_0_main_Inc(EOS(STATIC_458), i71, i50) :|: i71 > 0
f458_0_main_Inc(EOS(STATIC_458), i71, i50) -> f471_0_main_JMP(EOS(STATIC_471), i71 + -1, i50) :|: TRUE
f471_0_main_JMP(EOS(STATIC_471), i73, i50) -> f558_0_main_Load(EOS(STATIC_558), i73, i50) :|: TRUE
f558_0_main_Load(EOS(STATIC_558), i73, i50) -> f353_0_main_Load(EOS(STATIC_353), i73, i50) :|: TRUE
Combined rules. Obtained 2 IRulesP rules:
f367_0_main_Load(EOS(STATIC_367), i19:0, i50:0, i19:0) -> f367_0_main_Load(EOS(STATIC_367), i19:0 - 1, i50:0, i19:0 - 1) :|: i19:0 > 0 && i19:0 + i50:0 > 0 && i50:0 > -1
f367_0_main_Load(EOS(STATIC_367), 0, i50:0, 0) -> f367_0_main_Load(EOS(STATIC_367), 0, i50:0 - 1, 0) :|: i50:0 > 0
Filtered constant ground arguments:
   f367_0_main_Load(x1, x2, x3, x4) -> f367_0_main_Load(x2, x3, x4)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f367_0_main_Load(x1, x2, x3) -> f367_0_main_Load(x2, x3)
Finished conversion. Obtained 2 rules.P rules:
f367_0_main_Load(i50:0, i19:0) -> f367_0_main_Load(i50:0, i19:0 - 1) :|: i19:0 + i50:0 > 0 && i50:0 > -1 && i19:0 > 0
f367_0_main_Load(i50:0, cons_0) -> f367_0_main_Load(i50:0 - 1, 0) :|: i50:0 > 0 && cons_0 = 0

----------------------------------------

(8)
Obligation:
Rules:
f367_0_main_Load(i50:0, i19:0) -> f367_0_main_Load(i50:0, i19:0 - 1) :|: i19:0 + i50:0 > 0 && i50:0 > -1 && i19:0 > 0
f367_0_main_Load(x, x1) -> f367_0_main_Load(x - 1, 0) :|: x > 0 && x1 = 0

----------------------------------------

(9) IRSFormatTransformerProof (EQUIVALENT)
Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
----------------------------------------

(10)
Obligation:
Rules:
f367_0_main_Load(i50:0, i19:0) -> f367_0_main_Load(i50:0, arith) :|: i19:0 + i50:0 > 0 && i50:0 > -1 && i19:0 > 0 && arith = i19:0 - 1
f367_0_main_Load(x2, x3) -> f367_0_main_Load(x4, 0) :|: x2 > 0 && x3 = 0 && x4 = x2 - 1

----------------------------------------

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f367_0_main_Load(i50:0, i19:0) -> f367_0_main_Load(i50:0, arith) :|: i19:0 + i50:0 > 0 && i50:0 > -1 && i19:0 > 0 && arith = i19:0 - 1
(2) f367_0_main_Load(x2, x3) -> f367_0_main_Load(x4, 0) :|: x2 > 0 && x3 = 0 && x4 = x2 - 1

Arcs:
(1) -> (1), (2)
(2) -> (2)

This digraph is fully evaluated!
----------------------------------------

(12)
Complex Obligation (AND)

----------------------------------------

(13)
Obligation:

Termination digraph:
Nodes:
(1) f367_0_main_Load(i50:0, i19:0) -> f367_0_main_Load(i50:0, arith) :|: i19:0 + i50:0 > 0 && i50:0 > -1 && i19:0 > 0 && arith = i19:0 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

----------------------------------------

(14) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(15)
Obligation:
Rules:
f367_0_main_Load(i50:0:0, i19:0:0) -> f367_0_main_Load(i50:0:0, i19:0:0 - 1) :|: i19:0:0 + i50:0:0 > 0 && i50:0:0 > -1 && i19:0:0 > 0

----------------------------------------

(16) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f367_0_main_Load(INTEGER, INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(17)
Obligation:
Rules:
f367_0_main_Load(i50:0:0, i19:0:0) -> f367_0_main_Load(i50:0:0, c) :|: c = i19:0:0 - 1 && (i19:0:0 + i50:0:0 > 0 && i50:0:0 > -1 && i19:0:0 > 0)

----------------------------------------

(18) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f367_0_main_Load(x, x1)] = x + x1

The following rules are decreasing:
f367_0_main_Load(i50:0:0, i19:0:0) -> f367_0_main_Load(i50:0:0, c) :|: c = i19:0:0 - 1 && (i19:0:0 + i50:0:0 > 0 && i50:0:0 > -1 && i19:0:0 > 0)
The following rules are bounded:
f367_0_main_Load(i50:0:0, i19:0:0) -> f367_0_main_Load(i50:0:0, c) :|: c = i19:0:0 - 1 && (i19:0:0 + i50:0:0 > 0 && i50:0:0 > -1 && i19:0:0 > 0)

----------------------------------------

(19)
YES

----------------------------------------

(20)
Obligation:

Termination digraph:
Nodes:
(1) f367_0_main_Load(x2, x3) -> f367_0_main_Load(x4, 0) :|: x2 > 0 && x3 = 0 && x4 = x2 - 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

----------------------------------------

(21) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(22)
Obligation:
Rules:
f367_0_main_Load(x2:0, cons_0) -> f367_0_main_Load(x2:0 - 1, 0) :|: x2:0 > 0 && cons_0 = 0

----------------------------------------

(23) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f367_0_main_Load(INTEGER, VARIABLE)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(24)
Obligation:
Rules:
f367_0_main_Load(x2:0, c) -> f367_0_main_Load(c1, c2) :|: c2 = 0 && (c1 = x2:0 - 1 && c = 0) && (x2:0 > 0 && cons_0 = 0)

----------------------------------------

(25) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f367_0_main_Load ] = f367_0_main_Load_1

The following rules are decreasing:
f367_0_main_Load(x2:0, c) -> f367_0_main_Load(c1, c2) :|: c2 = 0 && (c1 = x2:0 - 1 && c = 0) && (x2:0 > 0 && cons_0 = 0)

The following rules are bounded:
f367_0_main_Load(x2:0, c) -> f367_0_main_Load(c1, c2) :|: c2 = 0 && (c1 = x2:0 - 1 && c = 0) && (x2:0 > 0 && cons_0 = 0)


----------------------------------------

(26)
YES