Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736612
details
property
value
status
complete
benchmark
svcomp_b.03-no-inv_assume.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n098.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
3.11052513123 seconds
cpu usage
9.144425611
max memory
5.02919168E8
stage attributes
key
value
output-size
2928
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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, 1325 ms] (6) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(x, y) -> f2(x_1, y) :|: TRUE f2(x1, x2) -> f3(x1, x3) :|: TRUE f7(x4, x5) -> f8(x4, arith) :|: TRUE && arith = x5 + x4 f4(x6, x7) -> f7(x6, x7) :|: x6 > x7 f8(x8, x9) -> f4(x8, x9) :|: TRUE f4(x10, x11) -> f9(x10, x11) :|: x10 <= x11 f3(x12, x13) -> f4(x12, x13) :|: x12 > 0 f3(x14, x15) -> f5(x14, x15) :|: x14 <= 0 f9(x16, x17) -> f6(x16, x17) :|: TRUE f5(x18, x19) -> f6(x18, x19) :|: TRUE Start term: f1(x, y) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_2,1) (f2_2,2) (f3_2,3) (f7_2,4) (f8_2,5) (f4_2,6) (f9_2,7) (f5_2,8) (f6_2,9) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := nondet(); assume(0 = 0); x0 := oldX2; x1 := oldX1; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; oldX2 := nondet(); assume(0 = 0); x0 := oldX0; x1 := oldX2; TO: 3; FROM: 4; oldX0 := x0; oldX1 := x1; oldX2 := -(-(oldX1 + oldX0)); assume(0 = 0 && oldX2 = oldX1 + oldX0); x0 := oldX0; x1 := -(-(oldX1 + oldX0)); TO: 5; FROM: 6; oldX0 := x0; oldX1 := x1; assume(oldX0 > oldX1);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257