Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315548
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
n047.star.cs.uiowa.edu
space
Julia_10_Iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.9245 seconds
cpu usage
20.7323
user time
19.2797
system time
1.45259
max virtual memory
2.1007868E7
max residence set size
1743060.0
stage attributes
key
value
starexec-result
YES
output
20.53/6.86 YES 20.53/6.87 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 20.53/6.87 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 20.53/6.87 20.53/6.87 20.53/6.87 termination of the given Bare JBC problem could be proven: 20.53/6.87 20.53/6.87 (0) Bare JBC problem 20.53/6.87 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 20.53/6.87 (2) JBC problem 20.53/6.87 (3) JBCToGraph [EQUIVALENT, 2058 ms] 20.53/6.87 (4) JBCTerminationGraph 20.53/6.87 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 20.53/6.87 (6) AND 20.53/6.87 (7) JBCTerminationSCC 20.53/6.87 (8) SCCToQDPProof [SOUND, 157 ms] 20.53/6.87 (9) QDP 20.53/6.87 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.53/6.87 (11) YES 20.53/6.87 (12) JBCTerminationSCC 20.53/6.87 (13) SCCToIRSProof [SOUND, 357 ms] 20.53/6.87 (14) IRSwT 20.53/6.87 (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 20.53/6.87 (16) IRSwT 20.53/6.87 (17) IRSwTTerminationDigraphProof [EQUIVALENT, 216 ms] 20.53/6.87 (18) IRSwT 20.53/6.87 (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] 20.53/6.87 (20) IRSwT 20.53/6.87 (21) TempFilterProof [SOUND, 4 ms] 20.53/6.87 (22) IRSwT 20.53/6.87 (23) IRSwTToQDPProof [SOUND, 0 ms] 20.53/6.87 (24) QDP 20.53/6.87 (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] 20.53/6.88 (26) YES 20.53/6.88 (27) JBCTerminationSCC 20.53/6.88 (28) SCCToIRSProof [SOUND, 49 ms] 20.53/6.88 (29) IRSwT 20.53/6.88 (30) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 20.53/6.88 (31) IRSwT 20.53/6.88 (32) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] 20.53/6.88 (33) IRSwT 20.53/6.88 (34) IntTRSCompressionProof [EQUIVALENT, 1 ms] 20.53/6.88 (35) IRSwT 20.53/6.88 (36) TempFilterProof [SOUND, 40 ms] 20.53/6.88 (37) IntTRS 20.53/6.88 (38) PolynomialOrderProcessor [EQUIVALENT, 12 ms] 20.53/6.88 (39) YES 20.53/6.88 (40) JBCTerminationSCC 20.53/6.88 (41) SCCToIRSProof [SOUND, 234 ms] 20.53/6.88 (42) IRSwT 20.53/6.88 (43) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 20.53/6.88 (44) IRSwT 20.53/6.88 (45) IRSwTTerminationDigraphProof [EQUIVALENT, 45 ms] 20.53/6.88 (46) IRSwT 20.53/6.88 (47) IntTRSCompressionProof [EQUIVALENT, 0 ms] 20.53/6.88 (48) IRSwT 20.53/6.88 (49) TempFilterProof [SOUND, 57 ms] 20.53/6.88 (50) IntTRS 20.53/6.88 (51) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 20.53/6.88 (52) IntTRS 20.53/6.88 (53) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 20.53/6.88 (54) YES 20.53/6.88 20.53/6.88 20.53/6.88 ---------------------------------------- 20.53/6.88 20.53/6.88 (0) 20.53/6.88 Obligation: 20.53/6.88 need to prove termination of the following program: 20.53/6.88 public class Infix2Postfix { 20.53/6.88 public static LinkedList buildExpression(int n) { 20.53/6.88 LinkedList exp = null; 20.53/6.88 for (int i = 1; i <= n; i++) { 20.53/6.88 if (i <= n-1) exp = new LinkedList(')', exp); 20.53/6.88 exp = new LinkedList(')', exp); 20.53/6.88 exp = new LinkedList('b', exp); 20.53/6.88 exp = new LinkedList('+', exp); 20.53/6.88 exp = new LinkedList('a', exp); 20.53/6.88 exp = new LinkedList('(', exp); 20.53/6.88 if (i <= n-1) exp = new LinkedList('*', exp); 20.53/6.88 } 20.53/6.88 20.53/6.88 for (int i = 1; i < n; i++) 20.53/6.88 exp = new LinkedList('(', exp); 20.53/6.88 20.53/6.88 return exp; 20.53/6.88 } 20.53/6.88 20.53/6.88 public static LinkedList toPostfix(LinkedList infix) { 20.53/6.88 LinkedList operators = null, operands = null; 20.53/6.88 while (infix != null) { 20.53/6.88 char c = infix.getFirst(); 20.53/6.88 switch (c) { 20.53/6.88 case '(': break; 20.53/6.88 case '+': case '-': case '*': case '/': 20.53/6.88 operators = new LinkedList(c, operators); 20.53/6.88 break; 20.53/6.88 case ')': 20.53/6.88 operands = new LinkedList(operators.getFirst(), operands); 20.53/6.88 operators = operators.getTail();
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