/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, 379 ms] (4) JBCTerminationGraph (5) JBCNonTerm [COMPLETE, 1223 ms] (6) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: package simple.narrowKonv; public class Main { /** * @param args */ public static void main(String[] args) { NarrowKonv.loop(args.length); } } package simple.narrowKonv; public class NarrowKonv { public static void loop(int i) { int range = 20; while (0 <= i && i <= range) { if (!(0 == i && i == range)) { if (i == range) { i = 0; range--; } else { i++; } } } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package simple.narrowKonv; public class Main { /** * @param args */ public static void main(String[] args) { NarrowKonv.loop(args.length); } } package simple.narrowKonv; public class NarrowKonv { public static void loop(int i) { int range = 20; while (0 <= i && i <= range) { if (!(0 == i && i == range)) { if (i == range) { i = 0; range--; } else { i++; } } } } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: simple.narrowKonv.Main.main([Ljava/lang/String;)V: Graph of 51 nodes with 1 SCC. ---------------------------------------- (5) JBCNonTerm (COMPLETE) Reached a loop using the following run: 0: a920([java.lang.String...]): length 1 -->{java.lang.Object...} YES: (JL1) 1: a920([java.lang.String...]): length 1 -->{java.lang.Object...} YES: (JL1) 2: YES: (JL1) 3: YES: (JL1) 4: YES: (JL1) 5: YES: (JL1) Start state of loop: [a14(lv_0_0)] i66: [0,+inf)(l1) i67: # i42: [0,+inf)(l1) a14([java.lang.String...]): length i42 -->{java.lang.Object...} YES: (JL1) In the loop head node, references [i66, i67] were interesting. All methods calls in the loop body are side-effect free, hence they can be ignored. By SMT, we could prove ((0 <= initial_i66 and 0 <= initial_i42) and ((((0 = res_i66 and 0 = res_i67 and path1_i66 = initial_i66 and path1_i67 = initial_i67) and (0 <= path1_i66 and path1_i66 <= path1_i67 and path1_i66 <= path1_i67 and T and path1_i66 = 0 and T and path1_i67 = 0)) or ((path2_i67 = path2_i72 and path2_i66 = path2_i71 and path2_i78 = (path2_i71 + 1) and path2_i78 = res_i66 and path2_i72 = res_i67 and path2_i66 = initial_i66 and path2_i67 = initial_i67) and (0 <= path2_i66 and path2_i66 <= path2_i67 and path2_i66 <= path2_i67 and T and 0 = 0 and 0 < path2_i71 and path2_i71 != path2_i72 and path2_i71 < path2_i72)) or ((path3_i67 = path3_i72 and path3_i66 = path3_i71 and path3_i81 = (path3_i72 + -1) and 0 = res_i66 and path3_i81 = res_i67 and path3_i66 = initial_i66 and path3_i67 = initial_i67) and (0 <= path3_i66 and path3_i66 <= path3_i67 and path3_i66 <= path3_i67 and T and 0 = 0 and 0 < path3_i71 and path3_i71 = path3_i72 and path3_i72 = path3_i72)) or ((path4_i67 = path4_i73 and 1 = res_i66 and path4_i73 = res_i67 and path4_i66 = initial_i66 and path4_i67 = initial_i67) and (0 <= path4_i66 and path4_i66 <= path4_i67 and path4_i66 <= path4_i67 and T and path4_i66 = 0 and T and 0 = 0 and 0 < path4_i73 and 0 < path4_i73)) or ((path2_i67 = path2_i72 and path2_i66 = path2_i71 and path2_i78 = (path2_i71 + 1) and path2_i78 = res_i66 and path2_i72 = res_i67 and path2_i66 = initial_i66 and path2_i67 = initial_i67) and (0 <= path2_i66 and path2_i66 <= path2_i67 and path2_i66 <= path2_i67 and T and 0 = 0 and 0 < path2_i71 and path2_i71 < path2_i72 and path2_i71 < path2_i72)) or ((path2_i67 = path2_i72 and path2_i66 = path2_i71 and path2_i78 = (path2_i71 + 1) and path2_i78 = res_i66 and path2_i72 = res_i67 and path2_i66 = initial_i66 and path2_i67 = initial_i67) and (0 <= path2_i66 and path2_i66 <= path2_i67 and path2_i66 <= path2_i67 and T and 0 = 0 and 0 < path2_i71 and path2_i71 < path2_i72 and path2_i71 > path2_i72))) and (((res_i66 = res1_i66 and res_i67 = res1_i67) and !(0 <= res1_i66 and res1_i66 <= res1_i67 and res1_i66 <= res1_i67 and T and res1_i66 = 0 and T and res1_i67 = 0)) and ((res2_i67 = res2_i72 and res2_i66 = res2_i71 and res2_i78 = (res2_i71 + 1) and res_i66 = res2_i66 and res_i67 = res2_i67) and !(0 <= res2_i66 and res2_i66 <= res2_i67 and res2_i66 <= res2_i67 and T and 0 = 0 and 0 < res2_i71 and res2_i71 != res2_i72 and res2_i71 < res2_i72)) and ((res3_i67 = res3_i72 and res3_i66 = res3_i71 and res3_i81 = (res3_i72 + -1) and res_i66 = res3_i66 and res_i67 = res3_i67) and !(0 <= res3_i66 and res3_i66 <= res3_i67 and res3_i66 <= res3_i67 and T and 0 = 0 and 0 < res3_i71 and res3_i71 = res3_i72 and res3_i72 = res3_i72)) and ((res4_i67 = res4_i73 and res_i66 = res4_i66 and res_i67 = res4_i67) and !(0 <= res4_i66 and res4_i66 <= res4_i67 and res4_i66 <= res4_i67 and T and res4_i66 = 0 and T and 0 = 0 and 0 < res4_i73 and 0 < res4_i73)) and ((res2_i67 = res2_i72 and res2_i66 = res2_i71 and res2_i78 = (res2_i71 + 1) and res_i66 = res2_i66 and res_i67 = res2_i67) and !(0 <= res2_i66 and res2_i66 <= res2_i67 and res2_i66 <= res2_i67 and T and 0 = 0 and 0 < res2_i71 and res2_i71 < res2_i72 and res2_i71 < res2_i72)) and ((res2_i67 = res2_i72 and res2_i66 = res2_i71 and res2_i78 = (res2_i71 + 1) and res_i66 = res2_i66 and res_i67 = res2_i67) and !(0 <= res2_i66 and res2_i66 <= res2_i67 and res2_i66 <= res2_i67 and T and 0 = 0 and 0 < res2_i71 and res2_i71 < res2_i72 and res2_i71 > res2_i72))))) to be UNSAT. Consequently, the loop will not terminate. ---------------------------------------- (6) NO