/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 540 ms] (4) JBCTerminationGraph (5) JBCNonTerm [COMPLETE, 1396 ms] (6) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: package simple.mirrorInterv; public class Main { /** * @param args */ public static void main(String[] args) { MirrorInterv.loop(args.length); } } package simple.mirrorInterv; public class MirrorInterv { /* */ public static void loop(int i) { int range = 20; while (-range <= i & i <= range) { if (range-i < 5 || range+i < 5) { i = i*(-1); } else { range++; i--; if (i == 0) { range = -1; } } } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package simple.mirrorInterv; public class Main { /** * @param args */ public static void main(String[] args) { MirrorInterv.loop(args.length); } } package simple.mirrorInterv; public class MirrorInterv { /* */ public static void loop(int i) { int range = 20; while (-range <= i & i <= range) { if (range-i < 5 || range+i < 5) { i = i*(-1); } else { range++; i--; if (i == 0) { range = -1; } } } } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: simple.mirrorInterv.Main.main([Ljava/lang/String;)V: Graph of 76 nodes with 1 SCC. ---------------------------------------- (5) JBCNonTerm (COMPLETE) Constructed a run with a repetition. States 5 and 56 are repetitions (when considering only the interesting positions [lv_0_0, lv_0_1]). 0: a142([java.lang.String...]): length 20 -->{java.lang.Object...} YES: (JL1) 1: a142([java.lang.String...]): length 20 -->{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) ---------------------------------------- (6) NO