Java Bytec 64199 pair #381919334

details

property	value
status	complete
benchmark	GrowTreeR.jar
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n029.star.cs.uiowa.edu
space	BOG_RTA_11

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.87654614449 seconds
cpu usage	14.875674716
max memory	1.396506624E9

stage attributes

key	value
output-size	161213
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
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 proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 1140 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 2 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToQDPProof [SOUND, 477 ms]
        (9) QDP
        (10) DependencyGraphProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) JBCTerminationSCC
        (15) SCCToIRSProof [SOUND, 174 ms]
        (16) IRSwT
        (17) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (18) IRSwT
        (19) IRSwTTerminationDigraphProof [EQUIVALENT, 194 ms]
        (20) IRSwT
        (21) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (22) IRSwT
        (23) TempFilterProof [SOUND, 163 ms]
        (24) IntTRS
        (25) PolynomialOrderProcessor [EQUIVALENT, 34 ms]
        (26) AND
            (27) IntTRS
                (28) RankingReductionPairProof [EQUIVALENT, 0 ms]
                (29) YES
            (30) IntTRS
                (31) RankingReductionPairProof [EQUIVALENT, 0 ms]
                (32) IntTRS
                (33) RankingReductionPairProof [EQUIVALENT, 7 ms]
                (34) YES


----------------------------------------

(0)
Obligation:
need to prove termination of the following program:
package GrowTreeR;

public class GrowTreeR {
  public static void main(final String[] args) {
    Random.args = args;

    final Tree t = Tree.createTree(Random.random());
    growList(t.children);
  }

  public static void growTree(final Tree t) {
      if (t == null) {
          return;
      } else if (t.children == null) {
          t.children = new TreeList(new Tree(), null);
      } else {
          growList(t.children);
      }
  }

  public static void growList(final TreeList l) {
      if (l == null) {
          return;
      } else {
          growTree(l.value);
          growList(l.next);
      }
  }
}


package GrowTreeR;
public class Random {
  static String[] args;
  static int index = 0;

  public static int random() {
    final String string = args[index];
    index++;
    return string.length();
  }
}


package GrowTreeR;

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Java Bytec 64199