/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


termination of the given Bare JBC problem could be proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 325 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 101 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
(12) TRUE


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

(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 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) 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 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();
  }
}



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

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

(4)
Obligation:
Termination Graph based on JBC Program:
PastaB3.main([Ljava/lang/String;)V: Graph of 183 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: PastaB3.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 10 IRulesP rules:
f378_0_main_Load(EOS(STATIC_378), i45, i49, i45) -> f380_0_main_LE(EOS(STATIC_380), i45, i49, i45, i49) :|: TRUE
f380_0_main_LE(EOS(STATIC_380), i45, i49, i45, i49) -> f385_0_main_LE(EOS(STATIC_385), i45, i49, i45, i49) :|: i45 > i49
f385_0_main_LE(EOS(STATIC_385), i45, i49, i45, i49) -> f396_0_main_Load(EOS(STATIC_396), i45, i49) :|: i45 > i49
f396_0_main_Load(EOS(STATIC_396), i45, i49) -> f401_0_main_Load(EOS(STATIC_401), i45, i49, i45) :|: TRUE
f401_0_main_Load(EOS(STATIC_401), i45, i49, i45) -> f402_0_main_IntArithmetic(EOS(STATIC_402), i45, i45, i49) :|: TRUE
f402_0_main_IntArithmetic(EOS(STATIC_402), i45, i45, i49) -> f403_0_main_Store(EOS(STATIC_403), i45, i45 + i49) :|: i45 > 0 && i49 >= 0
f403_0_main_Store(EOS(STATIC_403), i45, i52) -> f404_0_main_JMP(EOS(STATIC_404), i45, i52) :|: TRUE
f404_0_main_JMP(EOS(STATIC_404), i45, i52) -> f417_0_main_Load(EOS(STATIC_417), i45, i52) :|: TRUE
f417_0_main_Load(EOS(STATIC_417), i45, i52) -> f375_0_main_Load(EOS(STATIC_375), i45, i52) :|: TRUE
f375_0_main_Load(EOS(STATIC_375), i45, i49) -> f378_0_main_Load(EOS(STATIC_378), i45, i49, i45) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f378_0_main_Load(EOS(STATIC_378), i45:0, i49:0, i45:0) -> f378_0_main_Load(EOS(STATIC_378), i45:0, i45:0 + i49:0, i45:0) :|: i49:0 < i45:0 && i45:0 > 0 && i49:0 > -1
Filtered constant ground arguments:
   f378_0_main_Load(x1, x2, x3, x4) -> f378_0_main_Load(x2, x3, x4)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f378_0_main_Load(x1, x2, x3) -> f378_0_main_Load(x2, x3)
Finished conversion. Obtained 1 rules.P rules:
f378_0_main_Load(i49:0, i45:0) -> f378_0_main_Load(i45:0 + i49:0, i45:0) :|: i45:0 > 0 && i49:0 > -1 && i49:0 < i45:0

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

(8)
Obligation:
Rules:
f378_0_main_Load(i49:0, i45:0) -> f378_0_main_Load(i45:0 + i49:0, i45:0) :|: i45:0 > 0 && i49:0 > -1 && i49:0 < i45:0

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

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

(10)
Obligation:
Rules:
f378_0_main_Load(i49:0, i45:0) -> f378_0_main_Load(arith, i45:0) :|: i45:0 > 0 && i49:0 > -1 && i49:0 < i45:0 && arith = i45:0 + i49:0

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

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f378_0_main_Load(i49:0, i45:0) -> f378_0_main_Load(arith, i45:0) :|: i45:0 > 0 && i49:0 > -1 && i49:0 < i45:0 && arith = i45:0 + i49:0

No arcs!

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

(12)
TRUE