/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty termination of the given Bare JBC problem could be disproven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] (2) JBC problem (3) JBCNonTerm [COMPLETE, 145 ms] (4) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class TerminatorRec03 { public static void main(String[] args) { f(args.length); } public static void f(int x) { if (x == 0) { f(1); } else { f(0); } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class TerminatorRec03 { public static void main(String[] args) { f(args.length); } public static void f(int x) { if (x == 0) { f(1); } else { f(0); } } } ---------------------------------------- (3) JBCNonTerm (COMPLETE) Constructed a run with a repetition. States 3 and 11 are repetitions (when considering only the interesting positions [lv_0_0]). 0: a2([java.lang.String...]): length 0 -->{java.lang.Object...} YES: (JL1) 1: a2([java.lang.String...]): length 0 -->{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) ---------------------------------------- (4) NO