Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736408
details
property
value
status
complete
benchmark
AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n086.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
3.02708792686 seconds
cpu usage
9.22687048
max memory
7.66058496E8
stage attributes
key
value
output-size
5099
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.c # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) IRS2T2 [EQUIVALENT, 0 ms] (4) T2IntSys (5) T2 [EQUIVALENT, 1327 ms] (6) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(i, m, n) -> f2(i, m, x_1) :|: TRUE f2(x, x1, x2) -> f3(x, x3, x2) :|: TRUE f4(x4, x5, x6) -> f7(x6, x5, x6) :|: TRUE f9(x7, x8, x9) -> f12(arith, x8, x9) :|: TRUE && arith = x7 - 1 f10(x46, x47, x48) -> f13(x49, x47, x48) :|: TRUE && x49 = x46 - x47 f8(x13, x14, x15) -> f9(x13, x14, x15) :|: x13 < x14 f8(x16, x17, x18) -> f10(x16, x17, x18) :|: x16 >= x17 f12(x19, x20, x21) -> f11(x19, x20, x21) :|: TRUE f13(x22, x23, x24) -> f11(x22, x23, x24) :|: TRUE f7(x25, x26, x27) -> f8(x25, x26, x27) :|: x25 > 0 f11(x28, x29, x30) -> f7(x28, x29, x30) :|: TRUE f7(x31, x32, x33) -> f14(x31, x32, x33) :|: x31 <= 0 f3(x34, x35, x36) -> f4(x34, x35, x36) :|: x35 > 0 && x36 > x35 f3(x37, x38, x39) -> f5(x37, x38, x39) :|: x38 <= 0 f3(x50, x51, x52) -> f5(x50, x51, x52) :|: x52 <= x51 f14(x40, x41, x42) -> f6(x40, x41, x42) :|: TRUE f5(x43, x44, x45) -> f6(x43, x44, x45) :|: TRUE Start term: f1(i, m, n) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_3,1) (f2_3,2) (f3_3,3) (f4_3,4) (f7_3,5) (f9_3,6) (f12_3,7) (f10_3,8) (f13_3,9) (f8_3,10) (f11_3,11) (f14_3,12) (f5_3,13) (f6_3,14) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := nondet(); assume(0 = 0); x0 := oldX0; x1 := oldX1; x2 := oldX3; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := nondet(); assume(0 = 0); x0 := oldX0; x1 := oldX3;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257