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


termination of the given Bare JBC problem could be proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 95 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 312 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 22 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 7 ms]
(12) IRSwT
(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(14) IRSwT
(15) TempFilterProof [SOUND, 41 ms]
(16) IntTRS
(17) RankingReductionPairProof [EQUIVALENT, 0 ms]
(18) YES


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

(0)
Obligation:
need to prove termination of the following program:
public class MinusBuiltIn{

  public static void main(String[] args) {
    Random.args = args;
    int x = Random.random();
    int y = Random.random();
    int res = 0;



    while (x > y) {

      y++;
      res++;

    }
  }

}



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:
public class MinusBuiltIn{

  public static void main(String[] args) {
    Random.args = args;
    int x = Random.random();
    int y = Random.random();
    int res = 0;



    while (x > y) {

      y++;
      res++;

    }
  }

}



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:
MinusBuiltIn.main([Ljava/lang/String;)V: Graph of 180 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: MinusBuiltIn.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:
f513_0_main_Load(EOS(STATIC_513), i79, i80, i79) -> f514_0_main_LE(EOS(STATIC_514), i79, i80, i79, i80) :|: TRUE
f514_0_main_LE(EOS(STATIC_514), i79, i80, i79, i80) -> f523_0_main_LE(EOS(STATIC_523), i79, i80, i79, i80) :|: i79 > i80
f523_0_main_LE(EOS(STATIC_523), i79, i80, i79, i80) -> f528_0_main_Inc(EOS(STATIC_528), i79, i80) :|: i79 > i80
f528_0_main_Inc(EOS(STATIC_528), i79, i80) -> f532_0_main_Inc(EOS(STATIC_532), i79, i80 + 1) :|: TRUE
f532_0_main_Inc(EOS(STATIC_532), i79, i90) -> f535_0_main_JMP(EOS(STATIC_535), i79, i90) :|: TRUE
f535_0_main_JMP(EOS(STATIC_535), i79, i90) -> f552_0_main_Load(EOS(STATIC_552), i79, i90) :|: TRUE
f552_0_main_Load(EOS(STATIC_552), i79, i90) -> f511_0_main_Load(EOS(STATIC_511), i79, i90) :|: TRUE
f511_0_main_Load(EOS(STATIC_511), i79, i80) -> f513_0_main_Load(EOS(STATIC_513), i79, i80, i79) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f513_0_main_Load(EOS(STATIC_513), i79:0, i80:0, i79:0) -> f513_0_main_Load(EOS(STATIC_513), i79:0, i80:0 + 1, i79:0) :|: i80:0 < i79:0
Filtered constant ground arguments:
   f513_0_main_Load(x1, x2, x3, x4) -> f513_0_main_Load(x2, x3, x4)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f513_0_main_Load(x1, x2, x3) -> f513_0_main_Load(x2, x3)
Finished conversion. Obtained 1 rules.P rules:
f513_0_main_Load(i80:0, i79:0) -> f513_0_main_Load(i80:0 + 1, i79:0) :|: i80:0 < i79:0

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

(8)
Obligation:
Rules:
f513_0_main_Load(i80:0, i79:0) -> f513_0_main_Load(i80:0 + 1, i79:0) :|: i80:0 < i79:0

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

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

(10)
Obligation:
Rules:
f513_0_main_Load(i80:0, i79:0) -> f513_0_main_Load(arith, i79:0) :|: i80:0 < i79:0 && arith = i80:0 + 1

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

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f513_0_main_Load(i80:0, i79:0) -> f513_0_main_Load(arith, i79:0) :|: i80:0 < i79:0 && arith = i80:0 + 1

Arcs:
(1) -> (1)

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

(12)
Obligation:

Termination digraph:
Nodes:
(1) f513_0_main_Load(i80:0, i79:0) -> f513_0_main_Load(arith, i79:0) :|: i80:0 < i79:0 && arith = i80:0 + 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(14)
Obligation:
Rules:
f513_0_main_Load(i80:0:0, i79:0:0) -> f513_0_main_Load(i80:0:0 + 1, i79:0:0) :|: i80:0:0 < i79:0:0

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

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

(16)
Obligation:
Rules:
f513_0_main_Load(i80:0:0, i79:0:0) -> f513_0_main_Load(c, i79:0:0) :|: c = i80:0:0 + 1 && i80:0:0 < i79:0:0

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

(17) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f513_0_main_Load ] = -1*f513_0_main_Load_1 + f513_0_main_Load_2

The following rules are decreasing:
f513_0_main_Load(i80:0:0, i79:0:0) -> f513_0_main_Load(c, i79:0:0) :|: c = i80:0:0 + 1 && i80:0:0 < i79:0:0

The following rules are bounded:
f513_0_main_Load(i80:0:0, i79:0:0) -> f513_0_main_Load(c, i79:0:0) :|: c = i80:0:0 + 1 && i80:0:0 < i79:0:0


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

(18)
YES