Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315729
details
property
value
status
complete
benchmark
CyclicPair.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n092.star.cs.uiowa.edu
space
AProVE_10_iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.81399 seconds
cpu usage
3.89122
user time
3.73301
system time
0.158214
max virtual memory
1.8277284E7
max residence set size
244684.0
stage attributes
key
value
starexec-result
YES
output
3.74/1.78 YES 3.74/1.79 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 3.74/1.79 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.74/1.79 3.74/1.79 3.74/1.79 termination of the given Bare JBC problem could be proven: 3.74/1.79 3.74/1.79 (0) Bare JBC problem 3.74/1.79 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] 3.74/1.79 (2) JBC problem 3.74/1.79 (3) JBCToGraph [EQUIVALENT, 135 ms] 3.74/1.79 (4) JBCTerminationGraph 3.74/1.79 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 3.74/1.79 (6) TRUE 3.74/1.79 3.74/1.79 3.74/1.79 ---------------------------------------- 3.74/1.79 3.74/1.79 (0) 3.74/1.79 Obligation: 3.74/1.79 need to prove termination of the following program: 3.74/1.79 public class CyclicPair { 3.74/1.79 CyclicPair next; 3.74/1.79 3.74/1.79 public static void main(String[] args) { 3.74/1.79 Random.args = args; 3.74/1.79 CyclicPair one = new CyclicPair(); 3.74/1.79 CyclicPair two = new CyclicPair(); 3.74/1.79 int i = Random.random(); 3.74/1.79 if (i == 0) { //two cyclic 3.74/1.79 two.next = two; 3.74/1.79 } else { //one cyclic 3.74/1.79 one.next = one; 3.74/1.79 } 3.74/1.79 3.74/1.79 while (two.next == two && one.next == one) { 3.74/1.79 one.next = two; //one: o1, two: o2 | o1: (next=o2), o2: (next=o2) 3.74/1.79 two.next = one; //one: o1, two: o2 | o1: (next=o2), o2: (next=o1) 3.74/1.79 one.next = two.next; //one: o2, two: o2 | o1: (next=o1), o2: (next=o1) 3.74/1.79 two.next = two; 3.74/1.79 } 3.74/1.79 } 3.74/1.79 } 3.74/1.79 3.74/1.79 3.74/1.79 public class Random { 3.74/1.79 static String[] args; 3.74/1.79 static int index = 0; 3.74/1.79 3.74/1.79 public static int random() { 3.74/1.79 String string = args[index]; 3.74/1.79 index++; 3.74/1.79 return string.length(); 3.74/1.79 } 3.74/1.79 } 3.74/1.79 3.74/1.79 3.74/1.79 3.74/1.79 ---------------------------------------- 3.74/1.79 3.74/1.79 (1) BareJBCToJBCProof (EQUIVALENT) 3.74/1.79 initialized classpath 3.74/1.79 ---------------------------------------- 3.74/1.79 3.74/1.79 (2) 3.74/1.79 Obligation: 3.74/1.79 need to prove termination of the following program: 3.74/1.79 public class CyclicPair { 3.74/1.79 CyclicPair next; 3.74/1.79 3.74/1.79 public static void main(String[] args) { 3.74/1.79 Random.args = args; 3.74/1.79 CyclicPair one = new CyclicPair(); 3.74/1.79 CyclicPair two = new CyclicPair(); 3.74/1.79 int i = Random.random(); 3.74/1.79 if (i == 0) { //two cyclic 3.74/1.79 two.next = two; 3.74/1.79 } else { //one cyclic 3.74/1.79 one.next = one; 3.74/1.79 } 3.74/1.79 3.74/1.79 while (two.next == two && one.next == one) { 3.74/1.79 one.next = two; //one: o1, two: o2 | o1: (next=o2), o2: (next=o2) 3.74/1.79 two.next = one; //one: o1, two: o2 | o1: (next=o2), o2: (next=o1) 3.74/1.79 one.next = two.next; //one: o2, two: o2 | o1: (next=o1), o2: (next=o1) 3.74/1.79 two.next = two; 3.74/1.79 } 3.74/1.79 } 3.74/1.79 } 3.74/1.79 3.74/1.79 3.74/1.79 public class Random { 3.74/1.79 static String[] args; 3.74/1.79 static int index = 0; 3.74/1.79 3.74/1.79 public static int random() { 3.74/1.79 String string = args[index]; 3.74/1.79 index++; 3.74/1.79 return string.length(); 3.74/1.79 }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode 2019-04-01 06.50