/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, 276 ms] (4) JBCTerminationGraph (5) JBCNonTerm [COMPLETE, 99 ms] (6) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: package simple.cousot; public class Cousot { public static void loop(int i, int j) { while (true) { if (i < j) { i = i+4; } else { j = j+1; i = i+2; } } } } package simple.cousot; public class Main { /** * @param args */ public static void main(String[] args) { Cousot.loop(args[0].length(), args[1].length()); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package simple.cousot; public class Cousot { public static void loop(int i, int j) { while (true) { if (i < j) { i = i+4; } else { j = j+1; i = i+2; } } } } package simple.cousot; public class Main { /** * @param args */ public static void main(String[] args) { Cousot.loop(args[0].length(), args[1].length()); } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: simple.cousot.Main.main([Ljava/lang/String;)V: Graph of 135 nodes with 1 SCC. ---------------------------------------- (5) JBCNonTerm (COMPLETE) Reached a loop using the following run: 0: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} a2([java.lang.String...]): {o15, o37} -->{java.lang.Object...} o15!: String(count=0, hash=#, offset=0, value=o16?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} o16:: [CHAR] -->{java.lang.Object...} a2-><-o38 a2-><-o37 a2-><-o16 a2-><-o15 YES: (JL1) 1: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} a2([java.lang.String...]): {o15, o37} -->{java.lang.Object...} o15!: String(count=0, hash=#, offset=0, value=o16?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} o16:: [CHAR] -->{java.lang.Object...} a2-><-o38 a2-><-o37 a2-><-o16 a2-><-o15 YES: (JL1) 2: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} a2([java.lang.String...]): {o15, o37} -->{java.lang.Object...} o15!: String(count=0, hash=#, offset=0, value=o16?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} o16:: [CHAR] -->{java.lang.Object...} a2-><-o38 a2-><-o37 a2-><-o16 a2-><-o15 YES: (JL1) 3: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} a2([java.lang.String...]): {o15, o37} -->{java.lang.Object...} o15!: String(count=0, hash=#, offset=0, value=o16?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} o16:: [CHAR] -->{java.lang.Object...} a2-><-o38 a2-><-o37 a2-><-o16 a2-><-o15 YES: (JL1) 4: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} a2([java.lang.String...]): {o15, o37} -->{java.lang.Object...} o15!: String(count=0, hash=#, offset=0, value=o16?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} o16:: [CHAR] -->{java.lang.Object...} a2-><-o38 a2-><-o37 a2-><-o16 a2-><-o15 YES: (JL1) 5: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} a2([java.lang.String...]): {o15, o37} -->{java.lang.Object...} o15!: String(count=0, hash=#, offset=0, value=o16?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} o16:: [CHAR] -->{java.lang.Object...} a2-><-o38 a2-><-o37 a2-><-o16 a2-><-o15 YES: (JL1) 6: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} a2([java.lang.String...]): {o15, o37} -->{java.lang.Object...} o15!: String(count=0, hash=#, offset=0, value=o16?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} o16:: [CHAR] -->{java.lang.Object...} a2-><-o38 a2-><-o37 a2-><-o16 a2-><-o15 YES: (JL1) 7: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} a2([java.lang.String...]): {o15, o37} -->{java.lang.Object...} o15!: String(count=0, hash=#, offset=0, value=o16?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} o16:: [CHAR] -->{java.lang.Object...} a2-><-o38 a2-><-o37 a2-><-o16 a2-><-o15 YES: (JL1) 8: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} a2([java.lang.String...]): {o15, o37} -->{java.lang.Object...} o15!: String(count=0, hash=#, offset=0, value=o16?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} o16:: [CHAR] -->{java.lang.Object...} a2-><-o38 a2-><-o37 a2-><-o16 a2-><-o15 YES: (JL1) 9: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} a2([java.lang.String...]): {o15, o37} -->{java.lang.Object...} o15!: String(count=0, hash=#, offset=0, value=o16?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} o16:: [CHAR] -->{java.lang.Object...} a2-><-o38 a2-><-o37 a2-><-o16 a2-><-o15 YES: (JL1) 10: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} YES: (JL1) 11: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} YES: (JL1) 12: o37!: String(count=1, hash=#, offset=0, value=o38?) -->{java.lang.Object...} o38:: [CHAR] -->{java.lang.Object...} YES: (JL1) 13: YES: (JL1) 14: YES: (JL1) 15: YES: (JL1) Start state of loop: [a2(lv_0_0)] a2([java.lang.String...]): length i16 -->{java.lang.Object...} i13: [0,+inf) i16: [2,+inf){0,+inf} i30: [0,+inf) YES: (JL1) In the loop head node, references [i13, i30] 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_i13 and 0 <= initial_i30 and 2 <= initial_i16) and ((((path1_i35 = (path1_i13 + 4) and path1_i35 = res_i13 and path1_i30 = res_i30 and path1_i13 = initial_i13 and path1_i30 = initial_i30) and (path1_i13 < path1_i30 and path1_i13 < path1_i30)) or ((path2_i34 = (path2_i30 + 1) and path2_i76 = (path2_i13 + 2) and path2_i76 = res_i13 and path2_i34 = res_i30 and path2_i13 = initial_i13 and path2_i30 = initial_i30) and (path2_i13 >= path2_i30 and path2_i13 >= path2_i30))) and (((res1_i35 = (res1_i13 + 4) and res_i13 = res1_i13 and res_i30 = res1_i30) and !(res1_i13 < res1_i30 and res1_i13 < res1_i30)) and ((res2_i34 = (res2_i30 + 1) and res2_i76 = (res2_i13 + 2) and res_i13 = res2_i13 and res_i30 = res2_i30) and !(res2_i13 >= res2_i30 and res2_i13 >= res2_i30))))) to be UNSAT. Consequently, the loop will not terminate. ---------------------------------------- (6) NO