Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571413
details
property
value
status
complete
benchmark
Mod.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n022.star.cs.uiowa.edu
space
Aprove_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.12012600899 seconds
cpu usage
7.720517731
max memory
4.87284736E8
stage attributes
key
value
output-size
10854
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, 98 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 364 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 67 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 40 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 60 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 12 ms] (18) IntTRS (19) RankingReductionPairProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class Mod { public static void main(String[] args) { int x = args[0].length(); int y = args[1].length(); mod(x, y); } public static int mod(int x, int y) { while (x >= y && y > 0) { x = minus(x,y); } return x; } public static int minus(int x, int y) { while (y != 0) { if (y > 0) { y--; x--; } else { y++; x++; } } return x; } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class Mod { public static void main(String[] args) { int x = args[0].length(); int y = args[1].length(); mod(x, y); } public static int mod(int x, int y) { while (x >= y && y > 0) { x = minus(x,y); } return x; } public static int minus(int x, int y) { while (y != 0) { if (y > 0) {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode