5.68/2.34	YES
5.68/2.34	proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
5.68/2.34	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
5.68/2.34	
5.68/2.34	
5.68/2.34	termination of the given Bare JBC problem could be proven:
5.68/2.34	
5.68/2.34	(0) Bare JBC problem
5.68/2.34	(1) BareJBCToJBCProof [EQUIVALENT, 93 ms]
5.68/2.34	(2) JBC problem
5.68/2.34	(3) JBCToGraph [EQUIVALENT, 228 ms]
5.68/2.34	(4) JBCTerminationGraph
5.68/2.34	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
5.68/2.34	(6) JBCTerminationSCC
5.68/2.34	(7) SCCToIRSProof [SOUND, 63 ms]
5.68/2.34	(8) IRSwT
5.68/2.34	(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
5.68/2.34	(10) IRSwT
5.68/2.34	(11) IRSwTTerminationDigraphProof [EQUIVALENT, 18 ms]
5.68/2.34	(12) IRSwT
5.68/2.34	(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
5.68/2.34	(14) IRSwT
5.68/2.34	(15) TempFilterProof [SOUND, 35 ms]
5.68/2.34	(16) IntTRS
5.68/2.34	(17) RankingReductionPairProof [EQUIVALENT, 17 ms]
5.68/2.34	(18) YES
5.68/2.34	
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(0)
5.68/2.34	Obligation:
5.68/2.34	need to prove termination of the following program:
5.68/2.34	package simple.whileDecr;
5.68/2.34	
5.68/2.34	public class Main {
5.68/2.34	
5.68/2.34		/**
5.68/2.34		 * @param args
5.68/2.34		 */
5.68/2.34		public static void main(String[] args) {
5.68/2.34			WhileDecr.decrease(args.length);
5.68/2.34		}
5.68/2.34	
5.68/2.34	}
5.68/2.34	
5.68/2.34	
5.68/2.34	package simple.whileDecr;
5.68/2.34	
5.68/2.34	public class WhileDecr {
5.68/2.34	
5.68/2.34		// this example does acutally terminate.
5.68/2.34		
5.68/2.34		public static void decrease(int i) {
5.68/2.34			while (i > 5) {
5.68/2.34				i--;
5.68/2.34			}
5.68/2.34		}
5.68/2.34	}
5.68/2.34	
5.68/2.34	
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(1) BareJBCToJBCProof (EQUIVALENT)
5.68/2.34	initialized classpath
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(2)
5.68/2.34	Obligation:
5.68/2.34	need to prove termination of the following program:
5.68/2.34	package simple.whileDecr;
5.68/2.34	
5.68/2.34	public class Main {
5.68/2.34	
5.68/2.34		/**
5.68/2.34		 * @param args
5.68/2.34		 */
5.68/2.34		public static void main(String[] args) {
5.68/2.34			WhileDecr.decrease(args.length);
5.68/2.34		}
5.68/2.34	
5.68/2.34	}
5.68/2.34	
5.68/2.34	
5.68/2.34	package simple.whileDecr;
5.68/2.34	
5.68/2.34	public class WhileDecr {
5.68/2.34	
5.68/2.34		// this example does acutally terminate.
5.68/2.34		
5.68/2.34		public static void decrease(int i) {
5.68/2.34			while (i > 5) {
5.68/2.34				i--;
5.68/2.34			}
5.68/2.34		}
5.68/2.34	}
5.68/2.34	
5.68/2.34	
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(3) JBCToGraph (EQUIVALENT)
5.68/2.34	Constructed TerminationGraph.
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(4)
5.68/2.34	Obligation:
5.68/2.34	Termination Graph based on JBC Program:
5.68/2.34	simple.whileDecr.Main.main([Ljava/lang/String;)V: Graph of 16 nodes with 1 SCC.
5.68/2.34	
5.68/2.34	
5.68/2.34	
5.68/2.34	
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(5) TerminationGraphToSCCProof (SOUND)
5.68/2.34	Splitted TerminationGraph to 1 SCCs.
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(6)
5.68/2.34	Obligation:
5.68/2.34	SCC of termination graph based on JBC Program.
5.68/2.34	SCC contains nodes from the following methods: simple.whileDecr.Main.main([Ljava/lang/String;)V
5.68/2.34	SCC calls the following helper methods: 
5.68/2.34	Performed SCC analyses:
5.68/2.34	*Used field analysis yielded the following read fields:
5.68/2.34	
5.68/2.34	*Marker field analysis yielded the following relations that could be markers:
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(7) SCCToIRSProof (SOUND)
5.68/2.34	Transformed FIGraph SCCs to intTRSs. Log: 
5.68/2.34	Generated rules. Obtained 7 IRulesP rules:
5.68/2.34	f54_0_decrease_ConstantStackPush(EOS(STATIC_54), i14, i14) -> f55_0_decrease_LE(EOS(STATIC_55), i14, i14, 5) :|: TRUE
5.68/2.34	f55_0_decrease_LE(EOS(STATIC_55), i23, i23, matching1) -> f59_0_decrease_LE(EOS(STATIC_59), i23, i23, 5) :|: TRUE && matching1 = 5
5.68/2.34	f59_0_decrease_LE(EOS(STATIC_59), i23, i23, matching1) -> f69_0_decrease_Inc(EOS(STATIC_69), i23) :|: i23 > 5 && matching1 = 5
5.68/2.34	f69_0_decrease_Inc(EOS(STATIC_69), i23) -> f71_0_decrease_JMP(EOS(STATIC_71), i23 + -1) :|: TRUE
5.68/2.34	f71_0_decrease_JMP(EOS(STATIC_71), i27) -> f87_0_decrease_Load(EOS(STATIC_87), i27) :|: TRUE
5.68/2.34	f87_0_decrease_Load(EOS(STATIC_87), i27) -> f49_0_decrease_Load(EOS(STATIC_49), i27) :|: TRUE
5.68/2.34	f49_0_decrease_Load(EOS(STATIC_49), i14) -> f54_0_decrease_ConstantStackPush(EOS(STATIC_54), i14, i14) :|: TRUE
5.68/2.34	Combined rules. Obtained 1 IRulesP rules:
5.68/2.34	f54_0_decrease_ConstantStackPush(EOS(STATIC_54), i14:0, i14:0) -> f54_0_decrease_ConstantStackPush(EOS(STATIC_54), i14:0 - 1, i14:0 - 1) :|: i14:0 > 5
5.68/2.34	Filtered constant ground arguments:
5.68/2.34	   f54_0_decrease_ConstantStackPush(x1, x2, x3) -> f54_0_decrease_ConstantStackPush(x2, x3)
5.68/2.34	   EOS(x1) -> EOS
5.68/2.34	Filtered duplicate arguments:
5.68/2.34	   f54_0_decrease_ConstantStackPush(x1, x2) -> f54_0_decrease_ConstantStackPush(x2)
5.68/2.34	Finished conversion. Obtained 1 rules.P rules:
5.68/2.34	f54_0_decrease_ConstantStackPush(i14:0) -> f54_0_decrease_ConstantStackPush(i14:0 - 1) :|: i14:0 > 5
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(8)
5.68/2.34	Obligation:
5.68/2.34	Rules:
5.68/2.34	f54_0_decrease_ConstantStackPush(i14:0) -> f54_0_decrease_ConstantStackPush(i14:0 - 1) :|: i14:0 > 5
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(9) IRSFormatTransformerProof (EQUIVALENT)
5.68/2.34	Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(10)
5.68/2.34	Obligation:
5.68/2.34	Rules:
5.68/2.34	f54_0_decrease_ConstantStackPush(i14:0) -> f54_0_decrease_ConstantStackPush(arith) :|: i14:0 > 5 && arith = i14:0 - 1
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(11) IRSwTTerminationDigraphProof (EQUIVALENT)
5.68/2.34	Constructed termination digraph!
5.68/2.34	Nodes:
5.68/2.34	(1) f54_0_decrease_ConstantStackPush(i14:0) -> f54_0_decrease_ConstantStackPush(arith) :|: i14:0 > 5 && arith = i14:0 - 1
5.68/2.34	
5.68/2.34	Arcs:
5.68/2.34	(1) -> (1)
5.68/2.34	
5.68/2.34	This digraph is fully evaluated!
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(12)
5.68/2.34	Obligation:
5.68/2.34	
5.68/2.34	Termination digraph:
5.68/2.34	Nodes:
5.68/2.34	(1) f54_0_decrease_ConstantStackPush(i14:0) -> f54_0_decrease_ConstantStackPush(arith) :|: i14:0 > 5 && arith = i14:0 - 1
5.68/2.34	
5.68/2.34	Arcs:
5.68/2.34	(1) -> (1)
5.68/2.34	
5.68/2.34	This digraph is fully evaluated!
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(13) IntTRSCompressionProof (EQUIVALENT)
5.68/2.34	Compressed rules.
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(14)
5.68/2.34	Obligation:
5.68/2.34	Rules:
5.68/2.34	f54_0_decrease_ConstantStackPush(i14:0:0) -> f54_0_decrease_ConstantStackPush(i14:0:0 - 1) :|: i14:0:0 > 5
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(15) TempFilterProof (SOUND)
5.68/2.34	Used the following sort dictionary for filtering: 
5.68/2.34	f54_0_decrease_ConstantStackPush(INTEGER)
5.68/2.34	Replaced non-predefined constructor symbols by 0.
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(16)
5.68/2.34	Obligation:
5.68/2.34	Rules:
5.68/2.34	f54_0_decrease_ConstantStackPush(i14:0:0) -> f54_0_decrease_ConstantStackPush(c) :|: c = i14:0:0 - 1 && i14:0:0 > 5
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(17) RankingReductionPairProof (EQUIVALENT)
5.68/2.34	Interpretation:
5.68/2.34	[ f54_0_decrease_ConstantStackPush ] = f54_0_decrease_ConstantStackPush_1
5.68/2.34	
5.68/2.34	The following rules are decreasing:
5.68/2.34	f54_0_decrease_ConstantStackPush(i14:0:0) -> f54_0_decrease_ConstantStackPush(c) :|: c = i14:0:0 - 1 && i14:0:0 > 5
5.68/2.34	
5.68/2.34	The following rules are bounded:
5.68/2.34	f54_0_decrease_ConstantStackPush(i14:0:0) -> f54_0_decrease_ConstantStackPush(c) :|: c = i14:0:0 - 1 && i14:0:0 > 5
5.68/2.34	
5.68/2.34	
5.68/2.34	----------------------------------------
5.68/2.34	
5.68/2.34	(18)
5.68/2.34	YES
5.68/2.39	EOF