Java Bytec 64199 pair #381919582

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.40324282646 seconds
cpu usage	12.780447764
max memory	9.46024448E8

stage attributes

key	value
output-size	116542
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, 93 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 948 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) JBCTerminationSCC
        (8) SCCToQDPProof [SOUND, 354 ms]
        (9) QDP
        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (11) YES
    (12) JBCTerminationSCC
        (13) SCCToIRSProof [SOUND, 241 ms]
        (14) IRSwT
        (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (16) IRSwT
        (17) IRSwTTerminationDigraphProof [EQUIVALENT, 98 ms]
        (18) IRSwT
        (19) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (20) IRSwT
        (21) TempFilterProof [SOUND, 46 ms]
        (22) IntTRS
        (23) RankingReductionPairProof [EQUIVALENT, 0 ms]
        (24) YES


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

(0)
Obligation:
need to prove termination of the following program:
public class DuplicateNodes {
    public static void main(String[] args) {
		Random.args = args;
        Tree tree = Tree.createTree();

		randomlyDuplicate(tree);
    }

	public static void randomlyDuplicate(Tree tree) {
		Tree cur = tree;
		
		while (cur != null) {
			if (Random.random() > 42) {
				cur.right = new Tree(cur.left, cur.right);
				cur = cur.left;
			} else {
				cur.left = new Tree(cur.left, cur.right);
				cur = cur.right;
			}
		}
	}
}


public class List {
  Tree value;
  List next;

  public List(Tree value, List next) {
    this.value = value;
    this.next = next;
  }
}


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

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


public class Tree {
  Tree left;
  Tree right;
  Object value;

  public Tree(Tree l, Tree r) {
    this.left = l;
    this.right = r;

popout

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

job log

popout

actions all output return to Java Bytec 64199