/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES 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 proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 99 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 312 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 117 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 33 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 15 ms] (18) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: /** * Example taken from "A Term Rewriting Approach to the Automated Termination * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf) * and converted to Java. */ public class PastaB7 { public static void main(String[] args) { Random.args = args; int x = Random.random(); int y = Random.random(); int z = Random.random(); while (x > z && y > z) { x--; y--; } } } public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: /** * Example taken from "A Term Rewriting Approach to the Automated Termination * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf) * and converted to Java. */ public class PastaB7 { public static void main(String[] args) { Random.args = args; int x = Random.random(); int y = Random.random(); int z = Random.random(); while (x > z && y > z) { x--; y--; } } } public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: PastaB7.main([Ljava/lang/String;)V: Graph of 248 nodes with 1 SCC. ---------------------------------------- (5) TerminationGraphToSCCProof (SOUND) Splitted TerminationGraph to 1 SCCs. ---------------------------------------- (6) Obligation: SCC of termination graph based on JBC Program. SCC contains nodes from the following methods: PastaB7.main([Ljava/lang/String;)V SCC calls the following helper methods: Performed SCC analyses: *Used field analysis yielded the following read fields: *Marker field analysis yielded the following relations that could be markers: ---------------------------------------- (7) SCCToIRSProof (SOUND) Transformed FIGraph SCCs to intTRSs. Log: Generated rules. Obtained 12 IRulesP rules: f416_0_main_Load(EOS(STATIC_416), i19, i43, i71, i19) -> f419_0_main_LE(EOS(STATIC_419), i19, i43, i71, i19, i71) :|: TRUE f419_0_main_LE(EOS(STATIC_419), i19, i43, i71, i19, i71) -> f424_0_main_LE(EOS(STATIC_424), i19, i43, i71, i19, i71) :|: i19 > i71 f424_0_main_LE(EOS(STATIC_424), i19, i43, i71, i19, i71) -> f441_0_main_Load(EOS(STATIC_441), i19, i43, i71) :|: i19 > i71 f441_0_main_Load(EOS(STATIC_441), i19, i43, i71) -> f445_0_main_Load(EOS(STATIC_445), i19, i43, i71, i43) :|: TRUE f445_0_main_Load(EOS(STATIC_445), i19, i43, i71, i43) -> f450_0_main_LE(EOS(STATIC_450), i19, i43, i71, i43, i71) :|: TRUE f450_0_main_LE(EOS(STATIC_450), i19, i43, i71, i43, i71) -> f472_0_main_LE(EOS(STATIC_472), i19, i43, i71, i43, i71) :|: i43 > i71 f472_0_main_LE(EOS(STATIC_472), i19, i43, i71, i43, i71) -> f488_0_main_Inc(EOS(STATIC_488), i19, i43, i71) :|: i43 > i71 f488_0_main_Inc(EOS(STATIC_488), i19, i43, i71) -> f492_0_main_Inc(EOS(STATIC_492), i19 + -1, i43, i71) :|: TRUE f492_0_main_Inc(EOS(STATIC_492), i75, i43, i71) -> f495_0_main_JMP(EOS(STATIC_495), i75, i43 + -1, i71) :|: TRUE f495_0_main_JMP(EOS(STATIC_495), i75, i76, i71) -> f511_0_main_Load(EOS(STATIC_511), i75, i76, i71) :|: TRUE f511_0_main_Load(EOS(STATIC_511), i75, i76, i71) -> f413_0_main_Load(EOS(STATIC_413), i75, i76, i71) :|: TRUE f413_0_main_Load(EOS(STATIC_413), i19, i43, i71) -> f416_0_main_Load(EOS(STATIC_416), i19, i43, i71, i19) :|: TRUE Combined rules. Obtained 1 IRulesP rules: f416_0_main_Load(EOS(STATIC_416), i19:0, i43:0, i71:0, i19:0) -> f416_0_main_Load(EOS(STATIC_416), i19:0 - 1, i43:0 - 1, i71:0, i19:0 - 1) :|: i71:0 < i19:0 && i71:0 < i43:0 Filtered constant ground arguments: f416_0_main_Load(x1, x2, x3, x4, x5) -> f416_0_main_Load(x2, x3, x4, x5) EOS(x1) -> EOS Filtered duplicate arguments: f416_0_main_Load(x1, x2, x3, x4) -> f416_0_main_Load(x2, x3, x4) Finished conversion. Obtained 1 rules.P rules: f416_0_main_Load(i43:0, i71:0, i19:0) -> f416_0_main_Load(i43:0 - 1, i71:0, i19:0 - 1) :|: i71:0 < i19:0 && i71:0 < i43:0 ---------------------------------------- (8) Obligation: Rules: f416_0_main_Load(i43:0, i71:0, i19:0) -> f416_0_main_Load(i43:0 - 1, i71:0, i19:0 - 1) :|: i71:0 < i19:0 && i71:0 < i43:0 ---------------------------------------- (9) IRSFormatTransformerProof (EQUIVALENT) Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %). ---------------------------------------- (10) Obligation: Rules: f416_0_main_Load(i43:0, i71:0, i19:0) -> f416_0_main_Load(arith, i71:0, arith1) :|: i71:0 < i19:0 && i71:0 < i43:0 && arith = i43:0 - 1 && arith1 = i19:0 - 1 ---------------------------------------- (11) IRSwTTerminationDigraphProof (EQUIVALENT) Constructed termination digraph! Nodes: (1) f416_0_main_Load(i43:0, i71:0, i19:0) -> f416_0_main_Load(arith, i71:0, arith1) :|: i71:0 < i19:0 && i71:0 < i43:0 && arith = i43:0 - 1 && arith1 = i19:0 - 1 Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (12) Obligation: Termination digraph: Nodes: (1) f416_0_main_Load(i43:0, i71:0, i19:0) -> f416_0_main_Load(arith, i71:0, arith1) :|: i71:0 < i19:0 && i71:0 < i43:0 && arith = i43:0 - 1 && arith1 = i19:0 - 1 Arcs: (1) -> (1) This digraph is fully evaluated! ---------------------------------------- (13) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (14) Obligation: Rules: f416_0_main_Load(i43:0:0, i71:0:0, i19:0:0) -> f416_0_main_Load(i43:0:0 - 1, i71:0:0, i19:0:0 - 1) :|: i71:0:0 < i19:0:0 && i71:0:0 < i43:0:0 ---------------------------------------- (15) TempFilterProof (SOUND) Used the following sort dictionary for filtering: f416_0_main_Load(INTEGER, INTEGER, INTEGER) Replaced non-predefined constructor symbols by 0. ---------------------------------------- (16) Obligation: Rules: f416_0_main_Load(i43:0:0, i71:0:0, i19:0:0) -> f416_0_main_Load(c, i71:0:0, c1) :|: c1 = i19:0:0 - 1 && c = i43:0:0 - 1 && (i71:0:0 < i19:0:0 && i71:0:0 < i43:0:0) ---------------------------------------- (17) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f416_0_main_Load(x, x1, x2)] = x - x1 The following rules are decreasing: f416_0_main_Load(i43:0:0, i71:0:0, i19:0:0) -> f416_0_main_Load(c, i71:0:0, c1) :|: c1 = i19:0:0 - 1 && c = i43:0:0 - 1 && (i71:0:0 < i19:0:0 && i71:0:0 < i43:0:0) The following rules are bounded: f416_0_main_Load(i43:0:0, i71:0:0, i19:0:0) -> f416_0_main_Load(c, i71:0:0, c1) :|: c1 = i19:0:0 - 1 && c = i43:0:0 - 1 && (i71:0:0 < i19:0:0 && i71:0:0 < i43:0:0) ---------------------------------------- (18) YES