Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571597
details
property
value
status
complete
benchmark
TriTas.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
Julia_10_Iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.42719817162 seconds
cpu usage
9.252692382
max memory
6.39377408E8
stage attributes
key
value
output-size
31877
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 600 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 173 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 14 ms] (12) AND (13) IRSwT (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IRSwT (16) TempFilterProof [SOUND, 12 ms] (17) IntTRS (18) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (19) YES (20) IRSwT (21) IntTRSCompressionProof [EQUIVALENT, 0 ms] (22) IRSwT (23) TempFilterProof [SOUND, 34 ms] (24) IntTRS (25) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (26) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class TriTas { static int N; static int[] a; static int nTas = 0; static void Ajouter(int v) { int i,j; nTas++; i = nTas - 1; while (i > 0 && a[(i - 1)/2] <= v){ a[i] = a[(i - 1)/2]; j = (i - 1)/2; if (j >= i) break; else i = j; } a[i] = v; } static int Maximum() { return a[0]; } static void Supprimer() { int i, j, v; a[0] = a[nTas - 1]; nTas--; i = 0; v = a[0]; while (2 * i + 1 < nTas) { j = 2*i + 1; if (j + 1 < nTas) if (a[j + 1] > a[j]) j++; if (v >= a[j]) break; a[i] = a[j]; i = j; } a[i] = v; } static void HeapSort(){ int i, v; nTas = 0; for (i = 0; i < N; i++) Ajouter(a[i]); for (i = N - 1; i >= 0; i--) { v = Maximum(); Supprimer(); a[i]=v; } } public static void main(String[] args){
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode