5.72/2.36	YES
5.72/2.37	proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
5.72/2.37	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
5.72/2.37	
5.72/2.37	
5.72/2.37	termination of the given Bare JBC problem could be proven:
5.72/2.37	
5.72/2.37	(0) Bare JBC problem
5.72/2.37	(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
5.72/2.37	(2) JBC problem
5.72/2.37	(3) JBCToGraph [EQUIVALENT, 290 ms]
5.72/2.37	(4) JBCTerminationGraph
5.72/2.37	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
5.72/2.37	(6) JBCTerminationSCC
5.72/2.37	(7) SCCToIRSProof [SOUND, 98 ms]
5.72/2.37	(8) IRSwT
5.72/2.37	(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
5.72/2.37	(10) IRSwT
5.72/2.37	(11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
5.72/2.37	(12) IRSwT
5.72/2.37	(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
5.72/2.37	(14) IRSwT
5.72/2.37	(15) TempFilterProof [SOUND, 23 ms]
5.72/2.37	(16) IntTRS
5.72/2.37	(17) PolynomialOrderProcessor [EQUIVALENT, 2 ms]
5.72/2.37	(18) YES
5.72/2.37	
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(0)
5.72/2.37	Obligation:
5.72/2.37	need to prove termination of the following program:
5.72/2.37	/**
5.72/2.37	 * Example taken from "A Term Rewriting Approach to the Automated Termination
5.72/2.37	 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
5.72/2.37	 * and converted to Java.
5.72/2.37	 */
5.72/2.37	
5.72/2.37	public class PastaA9 {
5.72/2.37	    public static void main(String[] args) {
5.72/2.37	        Random.args = args;
5.72/2.37	        int x = Random.random();
5.72/2.37	        int y = Random.random();
5.72/2.37	        int z = Random.random();
5.72/2.37	
5.72/2.37	        if (y > 0) {
5.72/2.37	            while (x >= z) {
5.72/2.37	                z += y;
5.72/2.37	            }
5.72/2.37	        }
5.72/2.37	    }
5.72/2.37	}
5.72/2.37	
5.72/2.37	
5.72/2.37	public class Random {
5.72/2.37	  static String[] args;
5.72/2.37	  static int index = 0;
5.72/2.37	
5.72/2.37	  public static int random() {
5.72/2.37	    String string = args[index];
5.72/2.37	    index++;
5.72/2.37	    return string.length();
5.72/2.37	  }
5.72/2.37	}
5.72/2.37	
5.72/2.37	
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(1) BareJBCToJBCProof (EQUIVALENT)
5.72/2.37	initialized classpath
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(2)
5.72/2.37	Obligation:
5.72/2.37	need to prove termination of the following program:
5.72/2.37	/**
5.72/2.37	 * Example taken from "A Term Rewriting Approach to the Automated Termination
5.72/2.37	 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
5.72/2.37	 * and converted to Java.
5.72/2.37	 */
5.72/2.37	
5.72/2.37	public class PastaA9 {
5.72/2.37	    public static void main(String[] args) {
5.72/2.37	        Random.args = args;
5.72/2.37	        int x = Random.random();
5.72/2.37	        int y = Random.random();
5.72/2.37	        int z = Random.random();
5.72/2.37	
5.72/2.37	        if (y > 0) {
5.72/2.37	            while (x >= z) {
5.72/2.37	                z += y;
5.72/2.37	            }
5.72/2.37	        }
5.72/2.37	    }
5.72/2.37	}
5.72/2.37	
5.72/2.37	
5.72/2.37	public class Random {
5.72/2.37	  static String[] args;
5.72/2.37	  static int index = 0;
5.72/2.37	
5.72/2.37	  public static int random() {
5.72/2.37	    String string = args[index];
5.72/2.37	    index++;
5.72/2.37	    return string.length();
5.72/2.37	  }
5.72/2.37	}
5.72/2.37	
5.72/2.37	
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(3) JBCToGraph (EQUIVALENT)
5.72/2.37	Constructed TerminationGraph.
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(4)
5.72/2.37	Obligation:
5.72/2.37	Termination Graph based on JBC Program:
5.72/2.37	PastaA9.main([Ljava/lang/String;)V: Graph of 249 nodes with 1 SCC.
5.72/2.37	
5.72/2.37	
5.72/2.37	
5.72/2.37	
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(5) TerminationGraphToSCCProof (SOUND)
5.72/2.37	Splitted TerminationGraph to 1 SCCs.
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(6)
5.72/2.37	Obligation:
5.72/2.37	SCC of termination graph based on JBC Program.
5.72/2.37	SCC contains nodes from the following methods: PastaA9.main([Ljava/lang/String;)V
5.72/2.37	SCC calls the following helper methods: 
5.72/2.37	Performed SCC analyses:
5.72/2.37	*Used field analysis yielded the following read fields:
5.72/2.37	
5.72/2.37	*Marker field analysis yielded the following relations that could be markers:
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(7) SCCToIRSProof (SOUND)
5.72/2.37	Transformed FIGraph SCCs to intTRSs. Log: 
5.72/2.37	Generated rules. Obtained 10 IRulesP rules:
5.72/2.37	f448_0_main_LT(EOS(STATIC_448), i14, i74, i72, i14, i72) -> f478_0_main_Load(EOS(STATIC_478), i14, i74, i72) :|: i14 >= i72
5.72/2.37	f478_0_main_Load(EOS(STATIC_478), i14, i74, i72) -> f484_0_main_Load(EOS(STATIC_484), i14, i74, i72) :|: TRUE
5.72/2.37	f484_0_main_Load(EOS(STATIC_484), i14, i74, i72) -> f488_0_main_IntArithmetic(EOS(STATIC_488), i14, i74, i72, i74) :|: TRUE
5.72/2.37	f488_0_main_IntArithmetic(EOS(STATIC_488), i14, i74, i72, i74) -> f498_0_main_Store(EOS(STATIC_498), i14, i74, i72 + i74) :|: i72 >= 0 && i74 > 0
5.72/2.37	f498_0_main_Store(EOS(STATIC_498), i14, i74, i77) -> f504_0_main_JMP(EOS(STATIC_504), i14, i74, i77) :|: TRUE
5.72/2.37	f504_0_main_JMP(EOS(STATIC_504), i14, i74, i77) -> f523_0_main_Load(EOS(STATIC_523), i14, i74, i77) :|: TRUE
5.72/2.37	f523_0_main_Load(EOS(STATIC_523), i14, i74, i77) -> f435_0_main_Load(EOS(STATIC_435), i14, i74, i77) :|: TRUE
5.72/2.37	f435_0_main_Load(EOS(STATIC_435), i14, i74, i72) -> f439_0_main_Load(EOS(STATIC_439), i14, i74, i72, i14) :|: TRUE
5.72/2.37	f439_0_main_Load(EOS(STATIC_439), i14, i74, i72, i14) -> f442_0_main_LT(EOS(STATIC_442), i14, i74, i72, i14, i72) :|: TRUE
5.72/2.37	f442_0_main_LT(EOS(STATIC_442), i14, i74, i72, i14, i72) -> f448_0_main_LT(EOS(STATIC_448), i14, i74, i72, i14, i72) :|: i14 >= i72
5.72/2.37	Combined rules. Obtained 1 IRulesP rules:
5.72/2.37	f448_0_main_LT(EOS(STATIC_448), i14:0, i74:0, i72:0, i14:0, i72:0) -> f448_0_main_LT(EOS(STATIC_448), i14:0, i74:0, i72:0 + i74:0, i14:0, i72:0 + i74:0) :|: i72:0 <= i14:0 && i74:0 > 0 && i72:0 + i74:0 <= i14:0 && i72:0 > -1
5.72/2.37	Filtered constant ground arguments:
5.72/2.37	   f448_0_main_LT(x1, x2, x3, x4, x5, x6) -> f448_0_main_LT(x2, x3, x4, x5, x6)
5.72/2.37	   EOS(x1) -> EOS
5.72/2.37	Filtered duplicate arguments:
5.72/2.37	   f448_0_main_LT(x1, x2, x3, x4, x5) -> f448_0_main_LT(x2, x4, x5)
5.72/2.37	Finished conversion. Obtained 1 rules.P rules:
5.72/2.37	f448_0_main_LT(i74:0, i14:0, i72:0) -> f448_0_main_LT(i74:0, i14:0, i72:0 + i74:0) :|: i74:0 > 0 && i72:0 <= i14:0 && i72:0 > -1 && i72:0 + i74:0 <= i14:0
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(8)
5.72/2.37	Obligation:
5.72/2.37	Rules:
5.72/2.37	f448_0_main_LT(i74:0, i14:0, i72:0) -> f448_0_main_LT(i74:0, i14:0, i72:0 + i74:0) :|: i74:0 > 0 && i72:0 <= i14:0 && i72:0 > -1 && i72:0 + i74:0 <= i14:0
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(9) IRSFormatTransformerProof (EQUIVALENT)
5.72/2.37	Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(10)
5.72/2.37	Obligation:
5.72/2.37	Rules:
5.72/2.37	f448_0_main_LT(i74:0, i14:0, i72:0) -> f448_0_main_LT(i74:0, i14:0, arith) :|: i74:0 > 0 && i72:0 <= i14:0 && i72:0 > -1 && i72:0 + i74:0 <= i14:0 && arith = i72:0 + i74:0
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(11) IRSwTTerminationDigraphProof (EQUIVALENT)
5.72/2.37	Constructed termination digraph!
5.72/2.37	Nodes:
5.72/2.37	(1) f448_0_main_LT(i74:0, i14:0, i72:0) -> f448_0_main_LT(i74:0, i14:0, arith) :|: i74:0 > 0 && i72:0 <= i14:0 && i72:0 > -1 && i72:0 + i74:0 <= i14:0 && arith = i72:0 + i74:0
5.72/2.37	
5.72/2.37	Arcs:
5.72/2.37	(1) -> (1)
5.72/2.37	
5.72/2.37	This digraph is fully evaluated!
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(12)
5.72/2.37	Obligation:
5.72/2.37	
5.72/2.37	Termination digraph:
5.72/2.37	Nodes:
5.72/2.37	(1) f448_0_main_LT(i74:0, i14:0, i72:0) -> f448_0_main_LT(i74:0, i14:0, arith) :|: i74:0 > 0 && i72:0 <= i14:0 && i72:0 > -1 && i72:0 + i74:0 <= i14:0 && arith = i72:0 + i74:0
5.72/2.37	
5.72/2.37	Arcs:
5.72/2.37	(1) -> (1)
5.72/2.37	
5.72/2.37	This digraph is fully evaluated!
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(13) IntTRSCompressionProof (EQUIVALENT)
5.72/2.37	Compressed rules.
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(14)
5.72/2.37	Obligation:
5.72/2.37	Rules:
5.72/2.37	f448_0_main_LT(i74:0:0, i14:0:0, i72:0:0) -> f448_0_main_LT(i74:0:0, i14:0:0, i72:0:0 + i74:0:0) :|: i72:0:0 > -1 && i72:0:0 + i74:0:0 <= i14:0:0 && i72:0:0 <= i14:0:0 && i74:0:0 > 0
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(15) TempFilterProof (SOUND)
5.72/2.37	Used the following sort dictionary for filtering: 
5.72/2.37	f448_0_main_LT(INTEGER, INTEGER, INTEGER)
5.72/2.37	Replaced non-predefined constructor symbols by 0.
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(16)
5.72/2.37	Obligation:
5.72/2.37	Rules:
5.72/2.37	f448_0_main_LT(i74:0:0, i14:0:0, i72:0:0) -> f448_0_main_LT(i74:0:0, i14:0:0, c) :|: c = i72:0:0 + i74:0:0 && (i72:0:0 > -1 && i72:0:0 + i74:0:0 <= i14:0:0 && i72:0:0 <= i14:0:0 && i74:0:0 > 0)
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(17) PolynomialOrderProcessor (EQUIVALENT)
5.72/2.37	Found the following polynomial interpretation:
5.72/2.37	[f448_0_main_LT(x, x1, x2)] = x1 - x2
5.72/2.37	
5.72/2.37	The following rules are decreasing:
5.72/2.37	f448_0_main_LT(i74:0:0, i14:0:0, i72:0:0) -> f448_0_main_LT(i74:0:0, i14:0:0, c) :|: c = i72:0:0 + i74:0:0 && (i72:0:0 > -1 && i72:0:0 + i74:0:0 <= i14:0:0 && i72:0:0 <= i14:0:0 && i74:0:0 > 0)
5.72/2.37	The following rules are bounded:
5.72/2.37	f448_0_main_LT(i74:0:0, i14:0:0, i72:0:0) -> f448_0_main_LT(i74:0:0, i14:0:0, c) :|: c = i72:0:0 + i74:0:0 && (i72:0:0 > -1 && i72:0:0 + i74:0:0 <= i14:0:0 && i72:0:0 <= i14:0:0 && i74:0:0 > 0)
5.72/2.37	
5.72/2.37	----------------------------------------
5.72/2.37	
5.72/2.37	(18)
5.72/2.37	YES
5.72/2.39	EOF