/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 414 ms] (4) JBCTerminationGraph (5) JBCNonTerm [COMPLETE, 1806 ms] (6) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: package simple.complxStruc; public class ComplxStruc { public static void loop(int i) { int j = i; while (i > 0) { if (i >= j) { i--; if (j < 5) { j++; if (i-j>2) { i++; } else { j++; } } else { j--; } } else { if (i > 0 & j < 0) { i--; if (j < -1) { j++; } else { i++; } } else { i++; if (j*2 > i) { j--; } else { j++; } } } } } } package simple.complxStruc; public class Main { /** * @param args */ public static void main(String[] args) { ComplxStruc.loop(args.length); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package simple.complxStruc; public class ComplxStruc { public static void loop(int i) { int j = i; while (i > 0) { if (i >= j) { i--; if (j < 5) { j++; if (i-j>2) { i++; } else { j++; } } else { j--; } } else { if (i > 0 & j < 0) { i--; if (j < -1) { j++; } else { i++; } } else { i++; if (j*2 > i) { j--; } else { j++; } } } } } } package simple.complxStruc; public class Main { /** * @param args */ public static void main(String[] args) { ComplxStruc.loop(args.length); } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: simple.complxStruc.Main.main([Ljava/lang/String;)V: Graph of 68 nodes with 1 SCC. ---------------------------------------- (5) JBCNonTerm (COMPLETE) Constructed a run with a repetition. States 5 and 116 are repetitions (when considering only the interesting positions [lv_0_0, lv_0_1]). 0: a39([java.lang.String...]): length 4 -->{java.lang.Object...} YES: (JL1) 1: a39([java.lang.String...]): length 4 -->{java.lang.Object...} YES: (JL1) 2: YES: (JL1) 3: YES: (JL1) 4: YES: (JL1) 5: YES: (JL1) 6: YES: (JL1) 7: YES: (JL1) 8: YES: (JL1) 9: YES: (JL1) 10: YES: (JL1) 11: YES: (JL1) 12: YES: (JL1) 13: YES: (JL1) 14: YES: (JL1) 15: YES: (JL1) 16: YES: (JL1) 17: YES: (JL1) 18: YES: (JL1) 19: YES: (JL1) 20: YES: (JL1) 21: YES: (JL1) 22: YES: (JL1) 23: YES: (JL1) 24: YES: (JL1) 25: YES: (JL1) 26: YES: (JL1) 27: YES: (JL1) 28: YES: (JL1) 29: YES: (JL1) 30: YES: (JL1) 31: YES: (JL1) 32: YES: (JL1) 33: YES: (JL1) 34: YES: (JL1) 35: YES: (JL1) 36: YES: (JL1) 37: YES: (JL1) 38: YES: (JL1) 39: YES: (JL1) 40: YES: (JL1) 41: YES: (JL1) 42: YES: (JL1) 43: YES: (JL1) 44: YES: (JL1) 45: YES: (JL1) 46: YES: (JL1) 47: YES: (JL1) 48: YES: (JL1) 49: YES: (JL1) 50: YES: (JL1) 51: YES: (JL1) 52: YES: (JL1) 53: YES: (JL1) 54: YES: (JL1) 55: YES: (JL1) 56: YES: (JL1) 57: YES: (JL1) 58: YES: (JL1) 59: YES: (JL1) 60: YES: (JL1) 61: YES: (JL1) 62: YES: (JL1) 63: YES: (JL1) 64: YES: (JL1) 65: YES: (JL1) 66: YES: (JL1) 67: YES: (JL1) 68: YES: (JL1) 69: YES: (JL1) 70: YES: (JL1) 71: YES: (JL1) 72: YES: (JL1) 73: YES: (JL1) 74: YES: (JL1) 75: YES: (JL1) 76: YES: (JL1) 77: YES: (JL1) 78: YES: (JL1) 79: YES: (JL1) 80: YES: (JL1) 81: YES: (JL1) 82: YES: (JL1) 83: YES: (JL1) 84: YES: (JL1) 85: YES: (JL1) 86: YES: (JL1) 87: YES: (JL1) 88: YES: (JL1) 89: YES: (JL1) 90: YES: (JL1) 91: YES: (JL1) 92: YES: (JL1) 93: YES: (JL1) 94: YES: (JL1) 95: YES: (JL1) 96: YES: (JL1) 97: YES: (JL1) 98: YES: (JL1) 99: YES: (JL1) 100: YES: (JL1) 101: YES: (JL1) 102: YES: (JL1) 103: YES: (JL1) 104: YES: (JL1) 105: YES: (JL1) 106: YES: (JL1) 107: YES: (JL1) 108: YES: (JL1) 109: YES: (JL1) 110: YES: (JL1) 111: YES: (JL1) 112: YES: (JL1) 113: YES: (JL1) 114: YES: (JL1) 115: YES: (JL1) 116: YES: (JL1) ---------------------------------------- (6) NO