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


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


YES
proof of /export/starexec/sandbox/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, 97 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 296 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 40 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 14 ms]
(12) IRSwT
(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(14) IRSwT
(15) TempFilterProof [SOUND, 17 ms]
(16) IntTRS
(17) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(18) 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 PastaA8 {
    public static void main(String[] args) {
        Random.args = args;
        int x = Random.random();
        int y = Random.random();

        while (x > y) {
            x++;
            y += 2;
        }
    }
}


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

        while (x > y) {
            x++;
            y += 2;
        }
    }
}


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:
PastaA8.main([Ljava/lang/String;)V: Graph of 175 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: PastaA8.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 8 IRulesP rules:
f282_0_main_Load(EOS(STATIC_282), i19, i42, i19) -> f285_0_main_LE(EOS(STATIC_285), i19, i42, i19, i42) :|: TRUE
f285_0_main_LE(EOS(STATIC_285), i19, i42, i19, i42) -> f290_0_main_LE(EOS(STATIC_290), i19, i42, i19, i42) :|: i19 > i42
f290_0_main_LE(EOS(STATIC_290), i19, i42, i19, i42) -> f298_0_main_Inc(EOS(STATIC_298), i19, i42) :|: i19 > i42
f298_0_main_Inc(EOS(STATIC_298), i19, i42) -> f309_0_main_Inc(EOS(STATIC_309), i19 + 1, i42) :|: TRUE
f309_0_main_Inc(EOS(STATIC_309), i46, i42) -> f315_0_main_JMP(EOS(STATIC_315), i46, i42 + 2) :|: TRUE
f315_0_main_JMP(EOS(STATIC_315), i46, i47) -> f356_0_main_Load(EOS(STATIC_356), i46, i47) :|: TRUE
f356_0_main_Load(EOS(STATIC_356), i46, i47) -> f279_0_main_Load(EOS(STATIC_279), i46, i47) :|: TRUE
f279_0_main_Load(EOS(STATIC_279), i19, i42) -> f282_0_main_Load(EOS(STATIC_282), i19, i42, i19) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f282_0_main_Load(EOS(STATIC_282), i19:0, i42:0, i19:0) -> f282_0_main_Load(EOS(STATIC_282), i19:0 + 1, i42:0 + 2, i19:0 + 1) :|: i42:0 < i19:0
Filtered constant ground arguments:
   f282_0_main_Load(x1, x2, x3, x4) -> f282_0_main_Load(x2, x3, x4)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f282_0_main_Load(x1, x2, x3) -> f282_0_main_Load(x2, x3)
Finished conversion. Obtained 1 rules.P rules:
f282_0_main_Load(i42:0, i19:0) -> f282_0_main_Load(i42:0 + 2, i19:0 + 1) :|: i42:0 < i19:0

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

(8)
Obligation:
Rules:
f282_0_main_Load(i42:0, i19:0) -> f282_0_main_Load(i42:0 + 2, i19:0 + 1) :|: i42:0 < i19:0

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

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

(10)
Obligation:
Rules:
f282_0_main_Load(i42:0, i19:0) -> f282_0_main_Load(arith, arith1) :|: i42:0 < i19:0 && arith = i42:0 + 2 && arith1 = i19:0 + 1

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

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f282_0_main_Load(i42:0, i19:0) -> f282_0_main_Load(arith, arith1) :|: i42:0 < i19:0 && arith = i42:0 + 2 && arith1 = i19:0 + 1

Arcs:
(1) -> (1)

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

(12)
Obligation:

Termination digraph:
Nodes:
(1) f282_0_main_Load(i42:0, i19:0) -> f282_0_main_Load(arith, arith1) :|: i42:0 < i19:0 && arith = i42:0 + 2 && arith1 = i19:0 + 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(14)
Obligation:
Rules:
f282_0_main_Load(i42:0:0, i19:0:0) -> f282_0_main_Load(i42:0:0 + 2, i19:0:0 + 1) :|: i42:0:0 < i19:0:0

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

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

(16)
Obligation:
Rules:
f282_0_main_Load(i42:0:0, i19:0:0) -> f282_0_main_Load(c, c1) :|: c1 = i19:0:0 + 1 && c = i42:0:0 + 2 && i42:0:0 < i19:0:0

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

(17) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f282_0_main_Load(x, x1)] = -x + x1

The following rules are decreasing:
f282_0_main_Load(i42:0:0, i19:0:0) -> f282_0_main_Load(c, c1) :|: c1 = i19:0:0 + 1 && c = i42:0:0 + 2 && i42:0:0 < i19:0:0
The following rules are bounded:
f282_0_main_Load(i42:0:0, i19:0:0) -> f282_0_main_Load(c, c1) :|: c1 = i19:0:0 + 1 && c = i42:0:0 + 2 && i42:0:0 < i19:0:0

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

(18)
YES