Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571592
details
property
value
status
complete
benchmark
Infix2Postfix.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
Julia_10_Iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.76931595802 seconds
cpu usage
19.806929635
max memory
1.829408768E9
stage attributes
key
value
output-size
169526
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: 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, 1994 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 182 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) JBCTerminationSCC (13) SCCToIRSProof [SOUND, 429 ms] (14) IRSwT (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IRSwTTerminationDigraphProof [EQUIVALENT, 211 ms] (18) IRSwT (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IRSwT (21) TempFilterProof [SOUND, 4 ms] (22) IRSwT (23) IRSwTToQDPProof [SOUND, 0 ms] (24) QDP (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] (26) YES (27) JBCTerminationSCC (28) SCCToIRSProof [SOUND, 33 ms] (29) IRSwT (30) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (31) IRSwT (32) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (33) IRSwT (34) IntTRSCompressionProof [EQUIVALENT, 0 ms] (35) IRSwT (36) TempFilterProof [SOUND, 25 ms] (37) IntTRS (38) PolynomialOrderProcessor [EQUIVALENT, 14 ms] (39) YES (40) JBCTerminationSCC (41) SCCToIRSProof [SOUND, 256 ms] (42) IRSwT (43) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (44) IRSwT (45) IRSwTTerminationDigraphProof [EQUIVALENT, 59 ms] (46) IRSwT (47) IntTRSCompressionProof [EQUIVALENT, 0 ms] (48) IRSwT (49) TempFilterProof [SOUND, 84 ms] (50) IntTRS (51) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (52) AND (53) IntTRS (54) RankingReductionPairProof [EQUIVALENT, 7 ms] (55) YES (56) IntTRS (57) RankingReductionPairProof [EQUIVALENT, 0 ms] (58) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class Infix2Postfix { public static LinkedList buildExpression(int n) { LinkedList exp = null; for (int i = 1; i <= n; i++) { if (i <= n-1) exp = new LinkedList(')', exp); exp = new LinkedList(')', exp); exp = new LinkedList('b', exp); exp = new LinkedList('+', exp); exp = new LinkedList('a', exp); exp = new LinkedList('(', exp); if (i <= n-1) exp = new LinkedList('*', exp); } for (int i = 1; i < n; i++) exp = new LinkedList('(', exp); return exp; } public static LinkedList toPostfix(LinkedList infix) { LinkedList operators = null, operands = null;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode