/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, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 452 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 111 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
(12) IRSwT
(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(14) IRSwT
(15) IRSwTChainingProof [EQUIVALENT, 0 ms]
(16) IRSwT
(17) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
(18) IRSwT
(19) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(20) IRSwT
(21) TempFilterProof [SOUND, 19 ms]
(22) IntTRS
(23) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(24) YES


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

(0)
Obligation:
need to prove termination of the following program:
public class Et1 {
    public static void main(String[] args) {
		Random.args = args;
	    int a = - Random.random(); 
	   	int b = - Random.random();	
	   	while (a > b) {
	   		b = b + a;
 			a = a + 1;
	   	}
    }
}


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

  public static int random() {
      if (index >= args.length)
	  return 0;

      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 Et1 {
    public static void main(String[] args) {
		Random.args = args;
	    int a = - Random.random(); 
	   	int b = - Random.random();	
	   	while (a > b) {
	   		b = b + a;
 			a = a + 1;
	   	}
    }
}


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

  public static int random() {
      if (index >= args.length)
	  return 0;

      String string = args[index];
      index++;
      return string.length();
  }
}



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

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

(4)
Obligation:
Termination Graph based on JBC Program:
Et1.main([Ljava/lang/String;)V: Graph of 226 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: Et1.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 14 IRulesP rules:
f911_0_main_Load(EOS(STATIC_911), i184, i185, i184) -> f933_0_main_LE(EOS(STATIC_933), i184, i185, i184, i185) :|: TRUE
f933_0_main_LE(EOS(STATIC_933), i184, i185, i184, i185) -> f938_0_main_LE(EOS(STATIC_938), i184, i185, i184, i185) :|: i184 > i185
f938_0_main_LE(EOS(STATIC_938), i184, i185, i184, i185) -> f953_0_main_Load(EOS(STATIC_953), i184, i185) :|: i184 > i185
f953_0_main_Load(EOS(STATIC_953), i184, i185) -> f955_0_main_Load(EOS(STATIC_955), i184, i185) :|: TRUE
f955_0_main_Load(EOS(STATIC_955), i184, i185) -> f956_0_main_IntArithmetic(EOS(STATIC_956), i184, i185, i184) :|: TRUE
f956_0_main_IntArithmetic(EOS(STATIC_956), i184, i185, i184) -> f957_0_main_Store(EOS(STATIC_957), i184, i185 + i184) :|: TRUE
f957_0_main_Store(EOS(STATIC_957), i184, i214) -> f958_0_main_Load(EOS(STATIC_958), i184, i214) :|: TRUE
f958_0_main_Load(EOS(STATIC_958), i184, i214) -> f959_0_main_ConstantStackPush(EOS(STATIC_959), i214, i184) :|: TRUE
f959_0_main_ConstantStackPush(EOS(STATIC_959), i214, i184) -> f960_0_main_IntArithmetic(EOS(STATIC_960), i214, i184, 1) :|: TRUE
f960_0_main_IntArithmetic(EOS(STATIC_960), i214, i184, matching1) -> f961_0_main_Store(EOS(STATIC_961), i214, i184 + 1) :|: TRUE && matching1 = 1
f961_0_main_Store(EOS(STATIC_961), i214, i215) -> f962_0_main_JMP(EOS(STATIC_962), i215, i214) :|: TRUE
f962_0_main_JMP(EOS(STATIC_962), i215, i214) -> f982_0_main_Load(EOS(STATIC_982), i215, i214) :|: TRUE
f982_0_main_Load(EOS(STATIC_982), i215, i214) -> f906_0_main_Load(EOS(STATIC_906), i215, i214) :|: TRUE
f906_0_main_Load(EOS(STATIC_906), i184, i185) -> f911_0_main_Load(EOS(STATIC_911), i184, i185, i184) :|: TRUE
Combined rules. Obtained 1 IRulesP rules:
f911_0_main_Load(EOS(STATIC_911), i184:0, i185:0, i184:0) -> f911_0_main_Load(EOS(STATIC_911), i184:0 + 1, i185:0 + i184:0, i184:0 + 1) :|: i185:0 < i184:0
Filtered constant ground arguments:
   f911_0_main_Load(x1, x2, x3, x4) -> f911_0_main_Load(x2, x3, x4)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f911_0_main_Load(x1, x2, x3) -> f911_0_main_Load(x2, x3)
Finished conversion. Obtained 1 rules.P rules:
f911_0_main_Load(i185:0, i184:0) -> f911_0_main_Load(i185:0 + i184:0, i184:0 + 1) :|: i185:0 < i184:0

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

(8)
Obligation:
Rules:
f911_0_main_Load(i185:0, i184:0) -> f911_0_main_Load(i185:0 + i184:0, i184:0 + 1) :|: i185:0 < i184:0

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

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

(10)
Obligation:
Rules:
f911_0_main_Load(i185:0, i184:0) -> f911_0_main_Load(arith, arith1) :|: i185:0 < i184:0 && arith = i185:0 + i184:0 && arith1 = i184:0 + 1

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

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f911_0_main_Load(i185:0, i184:0) -> f911_0_main_Load(arith, arith1) :|: i185:0 < i184:0 && arith = i185:0 + i184:0 && arith1 = i184:0 + 1

Arcs:
(1) -> (1)

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

(12)
Obligation:

Termination digraph:
Nodes:
(1) f911_0_main_Load(i185:0, i184:0) -> f911_0_main_Load(arith, arith1) :|: i185:0 < i184:0 && arith = i185:0 + i184:0 && arith1 = i184:0 + 1

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(14)
Obligation:
Rules:
f911_0_main_Load(i185:0:0, i184:0:0) -> f911_0_main_Load(i185:0:0 + i184:0:0, i184:0:0 + 1) :|: i185:0:0 < i184:0:0

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

(15) IRSwTChainingProof (EQUIVALENT)
Chaining!
----------------------------------------

(16)
Obligation:
Rules:
f911_0_main_Load(x, x1) -> f911_0_main_Load(x + 2 * x1 + 1, x1 + 2) :|: TRUE && x + -1 * x1 <= -1 && x <= 0

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

(17) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f911_0_main_Load(x, x1) -> f911_0_main_Load(x + 2 * x1 + 1, x1 + 2) :|: TRUE && x + -1 * x1 <= -1 && x <= 0

Arcs:
(1) -> (1)

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

(18)
Obligation:

Termination digraph:
Nodes:
(1) f911_0_main_Load(x, x1) -> f911_0_main_Load(x + 2 * x1 + 1, x1 + 2) :|: TRUE && x + -1 * x1 <= -1 && x <= 0

Arcs:
(1) -> (1)

This digraph is fully evaluated!

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

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

(20)
Obligation:
Rules:
f911_0_main_Load(x:0, x1:0) -> f911_0_main_Load(x:0 + 2 * x1:0 + 1, x1:0 + 2) :|: x:0 < 1 && x:0 + -1 * x1:0 <= -1

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

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

(22)
Obligation:
Rules:
f911_0_main_Load(x:0, x1:0) -> f911_0_main_Load(c, c1) :|: c1 = x1:0 + 2 && c = x:0 + 2 * x1:0 + 1 && (x:0 < 1 && x:0 + -1 * x1:0 <= -1)

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

(23) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f911_0_main_Load(x, x1)] = 1 - 2*x - 2*x1 + x1^2

The following rules are decreasing:
f911_0_main_Load(x:0, x1:0) -> f911_0_main_Load(c, c1) :|: c1 = x1:0 + 2 && c = x:0 + 2 * x1:0 + 1 && (x:0 < 1 && x:0 + -1 * x1:0 <= -1)
The following rules are bounded:
f911_0_main_Load(x:0, x1:0) -> f911_0_main_Load(c, c1) :|: c1 = x1:0 + 2 && c = x:0 + 2 * x1:0 + 1 && (x:0 < 1 && x:0 + -1 * x1:0 <= -1)

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

(24)
YES