6.58/2.68	YES
6.58/2.69	proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
6.58/2.69	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.58/2.69	
6.58/2.69	
6.58/2.69	termination of the given Bare JBC problem could be proven:
6.58/2.69	
6.58/2.69	(0) Bare JBC problem
6.58/2.69	(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
6.58/2.69	(2) JBC problem
6.58/2.69	(3) JBCToGraph [EQUIVALENT, 343 ms]
6.58/2.69	(4) JBCTerminationGraph
6.58/2.69	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
6.58/2.69	(6) JBCTerminationSCC
6.58/2.69	(7) SCCToIRSProof [SOUND, 113 ms]
6.58/2.69	(8) IRSwT
6.58/2.69	(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
6.58/2.69	(10) IRSwT
6.58/2.69	(11) IRSwTTerminationDigraphProof [EQUIVALENT, 22 ms]
6.58/2.69	(12) IRSwT
6.58/2.69	(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
6.58/2.69	(14) IRSwT
6.58/2.69	(15) TempFilterProof [SOUND, 42 ms]
6.58/2.69	(16) IntTRS
6.58/2.69	(17) PolynomialOrderProcessor [EQUIVALENT, 15 ms]
6.58/2.69	(18) YES
6.58/2.69	
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(0)
6.58/2.69	Obligation:
6.58/2.69	need to prove termination of the following program:
6.58/2.69	/**
6.58/2.69	 * Example taken from "A Term Rewriting Approach to the Automated Termination
6.58/2.69	 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
6.58/2.69	 * and converted to Java.
6.58/2.69	 */
6.58/2.69	
6.58/2.69	public class PastaB7 {
6.58/2.69	    public static void main(String[] args) {
6.58/2.69	        Random.args = args;
6.58/2.69	        int x = Random.random();
6.58/2.69	        int y = Random.random();
6.58/2.69	        int z = Random.random();
6.58/2.69	
6.58/2.69	        while (x > z && y > z) {
6.58/2.69	            x--;
6.58/2.69	            y--;
6.58/2.69	        }
6.58/2.69	    }
6.58/2.69	}
6.58/2.69	
6.58/2.69	
6.58/2.69	public class Random {
6.58/2.69	  static String[] args;
6.58/2.69	  static int index = 0;
6.58/2.69	
6.58/2.69	  public static int random() {
6.58/2.69	    String string = args[index];
6.58/2.69	    index++;
6.58/2.69	    return string.length();
6.58/2.69	  }
6.58/2.69	}
6.58/2.69	
6.58/2.69	
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(1) BareJBCToJBCProof (EQUIVALENT)
6.58/2.69	initialized classpath
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(2)
6.58/2.69	Obligation:
6.58/2.69	need to prove termination of the following program:
6.58/2.69	/**
6.58/2.69	 * Example taken from "A Term Rewriting Approach to the Automated Termination
6.58/2.69	 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
6.58/2.69	 * and converted to Java.
6.58/2.69	 */
6.58/2.69	
6.58/2.69	public class PastaB7 {
6.58/2.69	    public static void main(String[] args) {
6.58/2.69	        Random.args = args;
6.58/2.69	        int x = Random.random();
6.58/2.69	        int y = Random.random();
6.58/2.69	        int z = Random.random();
6.58/2.69	
6.58/2.69	        while (x > z && y > z) {
6.58/2.69	            x--;
6.58/2.69	            y--;
6.58/2.69	        }
6.58/2.69	    }
6.58/2.69	}
6.58/2.69	
6.58/2.69	
6.58/2.69	public class Random {
6.58/2.69	  static String[] args;
6.58/2.69	  static int index = 0;
6.58/2.69	
6.58/2.69	  public static int random() {
6.58/2.69	    String string = args[index];
6.58/2.69	    index++;
6.58/2.69	    return string.length();
6.58/2.69	  }
6.58/2.69	}
6.58/2.69	
6.58/2.69	
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(3) JBCToGraph (EQUIVALENT)
6.58/2.69	Constructed TerminationGraph.
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(4)
6.58/2.69	Obligation:
6.58/2.69	Termination Graph based on JBC Program:
6.58/2.69	PastaB7.main([Ljava/lang/String;)V: Graph of 248 nodes with 1 SCC.
6.58/2.69	
6.58/2.69	
6.58/2.69	
6.58/2.69	
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(5) TerminationGraphToSCCProof (SOUND)
6.58/2.69	Splitted TerminationGraph to 1 SCCs.
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(6)
6.58/2.69	Obligation:
6.58/2.69	SCC of termination graph based on JBC Program.
6.58/2.69	SCC contains nodes from the following methods: PastaB7.main([Ljava/lang/String;)V
6.58/2.69	SCC calls the following helper methods: 
6.58/2.69	Performed SCC analyses:
6.58/2.69	*Used field analysis yielded the following read fields:
6.58/2.69	
6.58/2.69	*Marker field analysis yielded the following relations that could be markers:
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(7) SCCToIRSProof (SOUND)
6.58/2.69	Transformed FIGraph SCCs to intTRSs. Log: 
6.58/2.69	Generated rules. Obtained 12 IRulesP rules:
6.58/2.69	f416_0_main_Load(EOS(STATIC_416), i18, i43, i71, i18) -> f419_0_main_LE(EOS(STATIC_419), i18, i43, i71, i18, i71) :|: TRUE
6.58/2.69	f419_0_main_LE(EOS(STATIC_419), i18, i43, i71, i18, i71) -> f424_0_main_LE(EOS(STATIC_424), i18, i43, i71, i18, i71) :|: i18 > i71
6.58/2.69	f424_0_main_LE(EOS(STATIC_424), i18, i43, i71, i18, i71) -> f441_0_main_Load(EOS(STATIC_441), i18, i43, i71) :|: i18 > i71
6.58/2.69	f441_0_main_Load(EOS(STATIC_441), i18, i43, i71) -> f445_0_main_Load(EOS(STATIC_445), i18, i43, i71, i43) :|: TRUE
6.58/2.69	f445_0_main_Load(EOS(STATIC_445), i18, i43, i71, i43) -> f452_0_main_LE(EOS(STATIC_452), i18, i43, i71, i43, i71) :|: TRUE
6.58/2.69	f452_0_main_LE(EOS(STATIC_452), i18, i43, i71, i43, i71) -> f468_0_main_LE(EOS(STATIC_468), i18, i43, i71, i43, i71) :|: i43 > i71
6.58/2.69	f468_0_main_LE(EOS(STATIC_468), i18, i43, i71, i43, i71) -> f482_0_main_Inc(EOS(STATIC_482), i18, i43, i71) :|: i43 > i71
6.58/2.69	f482_0_main_Inc(EOS(STATIC_482), i18, i43, i71) -> f486_0_main_Inc(EOS(STATIC_486), i18 + -1, i43, i71) :|: TRUE
6.58/2.69	f486_0_main_Inc(EOS(STATIC_486), i75, i43, i71) -> f495_0_main_JMP(EOS(STATIC_495), i75, i43 + -1, i71) :|: TRUE
6.58/2.69	f495_0_main_JMP(EOS(STATIC_495), i75, i76, i71) -> f517_0_main_Load(EOS(STATIC_517), i75, i76, i71) :|: TRUE
6.58/2.69	f517_0_main_Load(EOS(STATIC_517), i75, i76, i71) -> f413_0_main_Load(EOS(STATIC_413), i75, i76, i71) :|: TRUE
6.58/2.69	f413_0_main_Load(EOS(STATIC_413), i18, i43, i71) -> f416_0_main_Load(EOS(STATIC_416), i18, i43, i71, i18) :|: TRUE
6.58/2.69	Combined rules. Obtained 1 IRulesP rules:
6.58/2.69	f416_0_main_Load(EOS(STATIC_416), i18:0, i43:0, i71:0, i18:0) -> f416_0_main_Load(EOS(STATIC_416), i18:0 - 1, i43:0 - 1, i71:0, i18:0 - 1) :|: i71:0 < i18:0 && i71:0 < i43:0
6.58/2.69	Filtered constant ground arguments:
6.58/2.69	   f416_0_main_Load(x1, x2, x3, x4, x5) -> f416_0_main_Load(x2, x3, x4, x5)
6.58/2.69	   EOS(x1) -> EOS
6.58/2.69	Filtered duplicate arguments:
6.58/2.69	   f416_0_main_Load(x1, x2, x3, x4) -> f416_0_main_Load(x2, x3, x4)
6.58/2.69	Finished conversion. Obtained 1 rules.P rules:
6.58/2.69	f416_0_main_Load(i43:0, i71:0, i18:0) -> f416_0_main_Load(i43:0 - 1, i71:0, i18:0 - 1) :|: i71:0 < i18:0 && i71:0 < i43:0
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(8)
6.58/2.69	Obligation:
6.58/2.69	Rules:
6.58/2.69	f416_0_main_Load(i43:0, i71:0, i18:0) -> f416_0_main_Load(i43:0 - 1, i71:0, i18:0 - 1) :|: i71:0 < i18:0 && i71:0 < i43:0
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(9) IRSFormatTransformerProof (EQUIVALENT)
6.58/2.69	Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(10)
6.58/2.69	Obligation:
6.58/2.69	Rules:
6.58/2.69	f416_0_main_Load(i43:0, i71:0, i18:0) -> f416_0_main_Load(arith, i71:0, arith1) :|: i71:0 < i18:0 && i71:0 < i43:0 && arith = i43:0 - 1 && arith1 = i18:0 - 1
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(11) IRSwTTerminationDigraphProof (EQUIVALENT)
6.58/2.69	Constructed termination digraph!
6.58/2.69	Nodes:
6.58/2.69	(1) f416_0_main_Load(i43:0, i71:0, i18:0) -> f416_0_main_Load(arith, i71:0, arith1) :|: i71:0 < i18:0 && i71:0 < i43:0 && arith = i43:0 - 1 && arith1 = i18:0 - 1
6.58/2.69	
6.58/2.69	Arcs:
6.58/2.69	(1) -> (1)
6.58/2.69	
6.58/2.69	This digraph is fully evaluated!
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(12)
6.58/2.69	Obligation:
6.58/2.69	
6.58/2.69	Termination digraph:
6.58/2.69	Nodes:
6.58/2.69	(1) f416_0_main_Load(i43:0, i71:0, i18:0) -> f416_0_main_Load(arith, i71:0, arith1) :|: i71:0 < i18:0 && i71:0 < i43:0 && arith = i43:0 - 1 && arith1 = i18:0 - 1
6.58/2.69	
6.58/2.69	Arcs:
6.58/2.69	(1) -> (1)
6.58/2.69	
6.58/2.69	This digraph is fully evaluated!
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(13) IntTRSCompressionProof (EQUIVALENT)
6.58/2.69	Compressed rules.
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(14)
6.58/2.69	Obligation:
6.58/2.69	Rules:
6.58/2.69	f416_0_main_Load(i43:0:0, i71:0:0, i18:0:0) -> f416_0_main_Load(i43:0:0 - 1, i71:0:0, i18:0:0 - 1) :|: i71:0:0 < i18:0:0 && i71:0:0 < i43:0:0
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(15) TempFilterProof (SOUND)
6.58/2.69	Used the following sort dictionary for filtering: 
6.58/2.69	f416_0_main_Load(INTEGER, INTEGER, INTEGER)
6.58/2.69	Replaced non-predefined constructor symbols by 0.
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(16)
6.58/2.69	Obligation:
6.58/2.69	Rules:
6.58/2.69	f416_0_main_Load(i43:0:0, i71:0:0, i18:0:0) -> f416_0_main_Load(c, i71:0:0, c1) :|: c1 = i18:0:0 - 1 && c = i43:0:0 - 1 && (i71:0:0 < i18:0:0 && i71:0:0 < i43:0:0)
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(17) PolynomialOrderProcessor (EQUIVALENT)
6.58/2.69	Found the following polynomial interpretation:
6.58/2.69	[f416_0_main_Load(x, x1, x2)] = x - x1
6.58/2.69	
6.58/2.69	The following rules are decreasing:
6.58/2.69	f416_0_main_Load(i43:0:0, i71:0:0, i18:0:0) -> f416_0_main_Load(c, i71:0:0, c1) :|: c1 = i18:0:0 - 1 && c = i43:0:0 - 1 && (i71:0:0 < i18:0:0 && i71:0:0 < i43:0:0)
6.58/2.69	The following rules are bounded:
6.58/2.69	f416_0_main_Load(i43:0:0, i71:0:0, i18:0:0) -> f416_0_main_Load(c, i71:0:0, c1) :|: c1 = i18:0:0 - 1 && c = i43:0:0 - 1 && (i71:0:0 < i18:0:0 && i71:0:0 < i43:0:0)
6.58/2.69	
6.58/2.69	----------------------------------------
6.58/2.69	
6.58/2.69	(18)
6.58/2.69	YES
6.83/2.71	EOF