Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919172
details
property
value
status
complete
benchmark
EqUserDefRec.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
BOG_RTA_11
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.54298186302 seconds
cpu usage
6.786649382
max memory
5.57535232E8
stage attributes
key
value
output-size
8652
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 342 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 137 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 16 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class EqUserDefRec { public static void main(String[] args) { int x = args[0].length(); int y = args[1].length(); eq(x, y); } public static boolean eq(int x, int y) { if (x > 0 && y > 0) { return eq(x-1, y-1); } else { return (x == 0 && y == 0); } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class EqUserDefRec { public static void main(String[] args) { int x = args[0].length(); int y = args[1].length(); eq(x, y); } public static boolean eq(int x, int y) { if (x > 0 && y > 0) { return eq(x-1, y-1); } else { return (x == 0 && y == 0); } } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: EqUserDefRec.main([Ljava/lang/String;)V: Graph of 129 nodes with 0 SCCs. EqUserDefRec.eq(II)Z: Graph of 43 nodes with 0 SCCs.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199