Java Bytec 64199 pair #381919185

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.60508918762 seconds
cpu usage	6.470770343
max memory	3.62405888E8

stage attributes

key	value
output-size	13983
starexec-result	YES

output

/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, 97 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 314 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 136 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 32 ms]
(12) IRSwT
(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(14) IRSwT
(15) TempFilterProof [SOUND, 49 ms]
(16) IntTRS
(17) PolynomialOrderProcessor [EQUIVALENT, 19 ms]
(18) YES


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

(0)
Obligation:
need to prove termination of the following program:
public class IntRTA {
  // only wrap a primitive int
  private int val;

  // count up to the value
  // in "limit"
  public static void count(
      IntRTA orig, IntRTA limit) {

    if (orig == null
        || limit == null) {
      return;
    }

    // introduce sharing
    IntRTA copy = orig;

    while (orig.val < limit.val) {
      copy.val++;
    }
  }

  public static void main(String[] args) {
    Random.args = args;
    IntRTA x = new IntRTA();
    x.val = Random.random();
    IntRTA y = new IntRTA();
    y.val = Random.random();
    count(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:
public class IntRTA {
  // only wrap a primitive int
  private int val;

  // count up to the value
  // in "limit"

popout

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

job log

popout

actions all output return to Java Bytec 64199