Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315570
details
property
value
status
complete
benchmark
BubbleSort.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n173.star.cs.uiowa.edu
space
Costa_Julia_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.06131 seconds
cpu usage
11.1687
user time
10.7081
system time
0.460577
max virtual memory
2.1158196E7
max residence set size
746412.0
stage attributes
key
value
starexec-result
YES
output
10.56/3.79 YES 10.56/3.80 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 10.56/3.80 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.56/3.80 10.56/3.80 10.56/3.80 termination of the given Bare JBC problem could be proven: 10.56/3.80 10.56/3.80 (0) Bare JBC problem 10.56/3.80 (1) BareJBCToJBCProof [EQUIVALENT, 94 ms] 10.56/3.80 (2) JBC problem 10.56/3.80 (3) JBCToGraph [EQUIVALENT, 637 ms] 10.56/3.80 (4) JBCTerminationGraph 10.56/3.80 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 10.56/3.80 (6) JBCTerminationSCC 10.56/3.80 (7) SCCToIRSProof [SOUND, 43 ms] 10.56/3.80 (8) IRSwT 10.56/3.80 (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 10.56/3.80 (10) IRSwT 10.56/3.80 (11) IRSwTTerminationDigraphProof [EQUIVALENT, 136 ms] 10.56/3.80 (12) IRSwT 10.56/3.80 (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] 10.56/3.80 (14) IRSwT 10.56/3.80 (15) TempFilterProof [SOUND, 78 ms] 10.56/3.80 (16) IntTRS 10.56/3.80 (17) RankingReductionPairProof [EQUIVALENT, 25 ms] 10.56/3.80 (18) IntTRS 10.56/3.80 (19) RankingReductionPairProof [EQUIVALENT, 0 ms] 10.56/3.80 (20) YES 10.56/3.80 10.56/3.80 10.56/3.80 ---------------------------------------- 10.56/3.80 10.56/3.80 (0) 10.56/3.80 Obligation: 10.56/3.80 need to prove termination of the following program: 10.56/3.80 class BubbleSort { 10.56/3.80 public static void main(String[] args) { 10.56/3.80 sort(new int[100]); 10.56/3.80 } 10.56/3.80 10.56/3.80 public static void sort(int[] x) { 10.56/3.80 int n = x.length; 10.56/3.80 for (int pass=1; pass < n; pass++) // count how many times 10.56/3.80 // This next loop becomes shorter and shorter 10.56/3.80 for (int i=0; i < n - pass; i++) 10.56/3.80 if (x[i] > x[i+1]) { 10.56/3.80 // exchange elements 10.56/3.80 int temp = x[i]; x[i] = x[i+1]; x[i+1] = temp; 10.56/3.80 } 10.56/3.80 } 10.56/3.80 } 10.56/3.80 10.56/3.80 10.56/3.80 10.56/3.80 ---------------------------------------- 10.56/3.80 10.56/3.80 (1) BareJBCToJBCProof (EQUIVALENT) 10.56/3.80 initialized classpath 10.56/3.80 ---------------------------------------- 10.56/3.80 10.56/3.80 (2) 10.56/3.80 Obligation: 10.56/3.80 need to prove termination of the following program: 10.56/3.80 class BubbleSort { 10.56/3.80 public static void main(String[] args) { 10.56/3.80 sort(new int[100]); 10.56/3.80 } 10.56/3.80 10.56/3.80 public static void sort(int[] x) { 10.56/3.80 int n = x.length; 10.56/3.80 for (int pass=1; pass < n; pass++) // count how many times 10.56/3.80 // This next loop becomes shorter and shorter 10.56/3.80 for (int i=0; i < n - pass; i++) 10.56/3.80 if (x[i] > x[i+1]) { 10.56/3.80 // exchange elements 10.56/3.80 int temp = x[i]; x[i] = x[i+1]; x[i+1] = temp; 10.56/3.80 } 10.56/3.80 } 10.56/3.80 } 10.56/3.80 10.56/3.80 10.56/3.80 10.56/3.80 ---------------------------------------- 10.56/3.80 10.56/3.80 (3) JBCToGraph (EQUIVALENT) 10.56/3.80 Constructed TerminationGraph. 10.56/3.80 ---------------------------------------- 10.56/3.80 10.56/3.80 (4) 10.56/3.80 Obligation: 10.56/3.80 Termination Graph based on JBC Program: 10.56/3.80 BubbleSort.main([Ljava/lang/String;)V: Graph of 169 nodes with 1 SCC. 10.56/3.80 10.56/3.80 10.56/3.80 10.56/3.80 10.56/3.80 10.56/3.80 ---------------------------------------- 10.56/3.80 10.56/3.80 (5) TerminationGraphToSCCProof (SOUND)
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