/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, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 306 ms] (4) JBCTerminationGraph (5) JBCNonTerm [COMPLETE, 302 ms] (6) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: package simple.twoFloatInterv; public class Main { /** * @param args */ public static void main(String[] args) { TwoFloatInterv.loop(args.length); } } package simple.twoFloatInterv; public class TwoFloatInterv { /* */ public static void loop(int i) { while (i > 0 & i < 50) { if (i < 20) { i--; } if (i > 10) { i++; } if (30 <= i && i <= 40) { i--; } } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: package simple.twoFloatInterv; public class Main { /** * @param args */ public static void main(String[] args) { TwoFloatInterv.loop(args.length); } } package simple.twoFloatInterv; public class TwoFloatInterv { /* */ public static void loop(int i) { while (i > 0 & i < 50) { if (i < 20) { i--; } if (i > 10) { i++; } if (30 <= i && i <= 40) { i--; } } } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: simple.twoFloatInterv.Main.main([Ljava/lang/String;)V: Graph of 75 nodes with 1 SCC. ---------------------------------------- (5) JBCNonTerm (COMPLETE) Constructed a run with a repetition. States 3 and 29 are repetitions (when considering only the interesting positions [lv_0_0]). 0: a24([java.lang.String...]): length 29 -->{java.lang.Object...} YES: (JL1) 1: a24([java.lang.String...]): length 29 -->{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) ---------------------------------------- (6) NO